Parallelizable MACs Based on the Sum of PRPs with Security Beyond the Birthday Bound

Alexander Moch

Eik List

[0]

Lecture Notes in Computer Science, pp. 131-151, 2019.

Cited by: 3|Views3

Keywords:

Symmetric-key cryptographyAuthenticationProvable securityPermutationBeyond-birthday securityMore(2+)

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 re...More

Code:

Data:

Get fulltext within 24h

View via Publisher