Lifting standard model reductions to common setup assumptions

DOI10.1007/978-3-030-97131-1_5zbMath1519.94179MaRDI QIDQ6169031

Eftychios Theodorakis, Ngoc Khanh Nguyen, Bogdan Warinschi

Publication date: 10 August 2023

Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-97131-1_5

zbMATH Keywords

ideal cipher model; random oracle; black-box reductions

Mathematics Subject Classification ID

94A60: Cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to build an ideal cipher: the indifferentiability of the Feistel construction
• On quantum slide attacks
• Probabilistic encryption
• Transaction protection by beacons
• On tightly secure primitives in the multi-instance setting
• Analysis of Information Set Decoding for a Sub-linear Error Weight
• Notions of Black-Box Reductions, Revisited
• Random Oracles with(out) Programmability
• Random Oracles in a Quantum World
• Decoding One Out of Many
• Information-Set Decoding for Linear Codes over F q
• The Random Oracle Model and the Ideal Cipher Model Are Equivalent
• One-Time Programs
• Communication Theory of Secrecy Systems*
• Breaking RSA may not be equivalent to factoring
• Advances in Cryptology – CRYPTO 2004
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
• Theory of Cryptography