On the adaptive security of MACs and PRFs
From MaRDI portal
Publication:2692364
DOI10.1007/978-3-030-64837-4_24OpenAlexW3090823858MaRDI QIDQ2692364
Andrew Morgan, Rafael Pass, Elaine Shi
Publication date: 21 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-64837-4_24
Related Items
Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting ⋮ Authenticated key exchange and signatures with tight security in the standard model ⋮ Optimal tightness for chain-based unique signatures ⋮ Almost tight multi-user security under adaptive corruptions \& leakages in the standard model ⋮ Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication ⋮ Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness ⋮ Almost tight multi-user security under adaptive corruptions from LWE in the standard model ⋮ Verifiable random functions with optimal tightness ⋮ Multi-user BBB security of public permutations based MAC
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the security loss of unique signatures
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- Multi-key authenticated encryption with corruptions: reductions are lossy
- Analyzing multi-key security degradation
- Optimally Secure Block Ciphers from Ideal Primitives
- On the Hardness of Proving CCA-Security of Signed ElGamal
- Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
- Notions of Black-Box Reductions, Revisited
- Another Look at Tightness
- Optimal Security Proofs for Full Domain Hash, Revisited
- Waters Signatures with Optimal Security Reduction
- Multi-instance Security and Its Application to Password-Based Cryptography
- Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
- Multi-key Security: The Even-Mansour Construction Revisited
- On the Impossibility of Three-Move Blind Signature Schemes
- On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
- Foundations of Cryptography
- New directions in cryptography
- Breaking RSA may not be equivalent to factoring
- Communication Complexity of Byzantine Agreement, Revisited
- Tightly-Secure Authenticated Key Exchange
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Limits of provable security from standard assumptions
- Advances in Cryptology - CRYPTO 2003
- Separation Results on the “One-More” Computational Problems
- On the Impossibility of Tight Cryptographic Reductions
