Web30 de jul. de 2024 · On the Adaptive Security of MACs and PRFs. Authors: Andrew Morgan, Rafael Pass, Elaine Shi Abstract: We consider the security of two of the most … WebConstrained pseudorandom functions have recently been introduced independently by Boneh and Waters [Asiacrypt’13], Kiayias et al. [CCS’13], and Boyle et al. [PKC’14]. In a standard pseudorandom function (PRF) a key k is used to evaluate the PRF on

On the Adaptive Security of MACs and PRFs. BibSonomy

WebAbstract. We consider the security of two of the most commonly used cryptographic primitives message authentication codes (MACs) and pseudorandom functions (PRFs) in … WebThis constrained PRF has already found many interesting applications. Unfortunately, the existing security proofs only show selective security (by a reduction to the security of the underlying PRG). To achieve full security, one has to use complexity leveraging, which loses an exponential factor 2 N in security, where N is the input length. flair blockstufe

On the Adaptive Security of MACs and PRFs (Journal Article) NSF …

Webconstructed the PDM* MAC and its variant 1K-PDM* MAC both with BBB security. Recently, Dutta et al. [15] gave a BBB secure PRF pEDM. For these classically prov-able BBB secure PRFs or MACs based on public random permutations, it is natural to consider their concrete security in the quantum setting. 123 Web39]). In recent work, Bader et al. [3] explicitly consider a notion of adaptive multi-user security for signature schemes and MACs. They remark that a simple “guessing” … WebIn this work we study the question of security amplification of MACs, SIGs and PRFs, showing how to convert a corresponding weak primitive into a strong primitive. In brief, we prove a direct product theorem for MACs/SIGs (and even a Chernoff-type theorem to handle MACs/SIGs with imperfect completeness), and a (regular) XOR lemma for PRFs. flair berghotel talblick