Name
Title | ||
|---|---|---|
Parallelizable MACs Based on the Sum of PRPs with Security Beyond the Birthday Bound. |
Abstract | ||
|---|---|---|
The combination of universal hashing and encryption is a fundamental paradigm for the construction of symmetric-key MACs, dating back to the seminal works by Wegman and Carter, Shoup, and Bernstein. While fully sufficient for many practical applications, the Wegman-Carter construction, however, is well-known to break if nonces are ever repeated, and provides only birthday-bound security if instantiated with a permutation. Those limitations inspired the community to severals recent proposals that addressed them, initiated by Cogliati et al.'s Encrypted Wegman-Carter Davies-Meyer (EWCDM) construction. This work extends this line of research by studying two constructions based on the sum of PRPs: (1) a stateless deterministic scheme that uses two hash functions, and (2) a nonce-based scheme with one hash-function call and a nonce. We show up to 2n/3-bit security for both of them if the hash function is universal. Compared to the EWCDM construction, our proposals avoid the fact that a single reuse of a nonce can lead to a break. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-21568-2_7 | Lecture Notes in Computer Science |
Keywords | DocType | Volume |
Symmetric-key cryptography,Authentication,Provable security,Permutation,Beyond-birthday security,Pseudorandom function,Universal hashing | Conference | 11464 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.35 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Moch | 1 | 1 | 1.03 |
| Eik List | 2 | 111 | 13.70 |