Cryptography from compression functions: the UCE bridge to the ROM

DOI10.1007/978-3-662-44371-2_10zbMATH Open1343.94043OpenAlexW2158167950MaRDI QIDQ2874503FDOQ2874503

Authors: M. Bellare, Viet Tung Hoang, Sriram Keelveedhi 

Publication date: 7 August 2014

Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44371-2_10

Recommendations

• Instantiating random oracles via UCEs
• Security definitions for hash functions: combining UCE and indifferentiability
• Chosen ciphertext security via UCE
• Modeling random oracles under unpredictable queries
• Security Analysis of Constructions Combining FIL Random Oracles

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (5)

• Beyond Uber: instantiating generic groups via PGGs
• Public-seed pseudorandom permutations
• Security definitions for hash functions: combining UCE and indifferentiability
• Toward RSA-OAEP without random oracles
• Modeling random oracles under unpredictable queries

Uses Software

• AESNI

This page was built for publication: Cryptography from compression functions: the UCE bridge to the ROM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874503)