Instantiability of RSA-OAEP under chosen-plaintext attack
From MaRDI portal
Publication:2408591
DOI10.1007/s00145-016-9238-4zbMath1377.94056OpenAlexW2521689482MaRDI QIDQ2408591
Publication date: 12 October 2017
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-016-9238-4
Related Items (3)
A Note on the Instantiability of the Quantum Random Oracle ⋮ Regular lossy functions and their applications in leakage-resilient cryptography ⋮ Factorization, malleability and equivalent problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- New hash functions and their use in authentication and set equality
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- OAEP reconsidered
- RSA-OAEP is secure under the RSA assumption
- Randomness is linear in space
- More constructions of lossy and correlation-secure trapdoor functions
- Instantiating Random Oracles via UCEs
- Optimal Bounds for Multi-Prime Φ-Hiding Assumption
- Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption
- The random oracle methodology, revisited
- The Group of Signed Quadratic Residues and Applications
- Lossy Trapdoor Functions and Their Applications
- Extractable Perfectly One-Way Functions
- Correcting errors without leaking partial information
- Instantiability of RSA-OAEP under Chosen-Plaintext Attack
- Public-Key Locally-Decodable Codes
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols
- Deterministic and Efficiently Searchable Encryption
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
- Foundations of Non-malleable Hash and One-Way Functions
- Foundations of Cryptography
- Regularity of Lossy RSA on Subdomains and Its Applications
- True Random Number Generators Secure in a Changing Environment
- Non-committing Encryption from Φ-hiding
- On the Regularity of Lossy RSA
- On the Lossiness of the Rabin Trapdoor Function
- Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
- On the Generic Insecurity of the Full Domain Hash
- On the Security of OAEP
- Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
- Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
This page was built for publication: Instantiability of RSA-OAEP under chosen-plaintext attack