Toward RSA-OAEP Without Random Oracles
From MaRDI portal
Publication:5041161
DOI10.1007/978-3-030-45374-9_10zbMath1501.94034OpenAlexW3020911485MaRDI QIDQ5041161
Nairen Cao, Adam O'Neill, Mohammad Zaheri
Publication date: 13 October 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45374-9_10
Related Items (2)
Post-quantum Security of Plain OAEP Transform ⋮ Instantiability of classical random-oracle-model encryption transforms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- The hunting of the SNARK
- OAEP reconsidered
- RSA-OAEP is secure under the RSA assumption
- Practical chosen ciphertext secure encryption from factoring
- The magic of ELFs
- A note on the bivariate Coppersmith theorem
- On the Correlation Intractability of Obfuscated Pseudorandom Functions
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- On the Existence of Extractable One-Way Functions
- Instantiating Random Oracles via UCEs
- Cryptography from Compression Functions: The UCE Bridge to the ROM
- Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources
- Finding a Small Root of a Univariate Modular Equation
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Secure Two-Party Computation with Low Communication
- On the Instantiability of Hash-and-Sign RSA Signatures
- Computational Extractors and Pseudorandomness
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- All-But-Many Lossy Trapdoor Functions
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption
- Selective-Opening Security in the Presence of Randomness Failures
- The random oracle methodology, revisited
- Expedient Non-malleability Notions for Hash Functions
- Extractable Perfectly One-Way Functions
- Lossy trapdoor functions and their applications
- Adaptive Trapdoor Functions and Chosen-Ciphertext Security
- Instantiability of RSA-OAEP under Chosen-Plaintext Attack
- Adaptive One-Way Functions and Applications
- Towards a Theory of Extractable Functions
- 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
- A method for obtaining digital signatures and public-key cryptosystems
- Identity-Based Encryption from the Weil Pairing
- Regularity of Lossy RSA on Subdomains and Its Applications
- On the existence of extractable one-way functions
- On the Regularity of Lossy RSA
- How to Strengthen the Security of RSA-OAEP
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
- Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
- On Seed-Incompressible Functions
- 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: Toward RSA-OAEP Without Random Oracles
