Parallelizable MACs Based on the Sum of PRPs with Security Beyond the Birthday Bound.
Lecture Notes in Computer Science(2019)
摘要
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.
更多查看译文
关键词
Symmetric-key cryptography,Authentication,Provable security,Permutation,Beyond-birthday security,Pseudorandom function,Universal hashing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络