Toward RSA-OAEP without random oracles
From MaRDI portal
Recommendations
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A note on the bivariate Coppersmith theorem
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- Adaptive One-Way Functions and Applications
- Adaptive trapdoor functions and chosen-ciphertext security
- All-but-many lossy trapdoor functions
- Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
- Computational extractors and pseudorandomness
- Cryptography from compression functions: the UCE bridge to the ROM
- Expedient Non-malleability Notions for Hash Functions
- Extractable Perfectly One-Way Functions
- Finding a small root of a univariate modular equation
- Foundations of non-malleable hash and one-way functions
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- How to Strengthen the Security of RSA-OAEP
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 176566 (Why is no real title available?)
- scientific article; zbMATH DE number 1302836 (Why is no real title available?)
- scientific article; zbMATH DE number 1304088 (Why is no real title available?)
- scientific article; zbMATH DE number 1088253 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 1775397 (Why is no real title available?)
- scientific article; zbMATH DE number 1842495 (Why is no real title available?)
- scientific article; zbMATH DE number 1842496 (Why is no real title available?)
- scientific article; zbMATH DE number 1842497 (Why is no real title available?)
- Identity-Based Encryption from the Weil Pairing
- Indistinguishability obfuscation and UCEs: the case of computationally unpredictable sources
- Instantiability of RSA-OAEP under chosen-plaintext attack
- Instantiating random oracles via UCEs
- Lossy trapdoor functions and their applications
- OAEP reconsidered
- On constant-round concurrent zero-knowledge from a knowledge assumption
- On Seed-Incompressible Functions
- On the correlation intractability of obfuscated pseudorandom functions
- On the existence of extractable one-way functions
- On the existence of extractable one-way functions
- On the Generic Insecurity of the Full Domain Hash
- On the instantiability of hash-and-sign RSA signatures
- On the regularity of lossy RSA. Improved bounds and applications to padding-based encryption
- On the Security of OAEP
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
- Practical chosen ciphertext secure encryption from factoring
- Regularity of lossy RSA on subdomains and its applications
- Replacing a random oracle: full domain hash from indistinguishability obfuscation
- RSA-OAEP is secure under the RSA assumption
- Secure two-party computation with low communication
- Selective-Opening Security in the Presence of Randomness Failures
- The exact security of digital signatures -- how to sign with RSA and Rabin
- The hunting of the SNARK
- The magic of ELFs
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- The random oracle methodology, revisited.
- Towards a Theory of Extractable Functions
- Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
- Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
Cited in
(12)- OAEP reconsidered
- RSA-OAEP is secure under the RSA assumption
- Instantiability of RSA-OAEP under chosen-plaintext attack
- Instantiability of RSA-OAEP under chosen-plaintext attack
- Strengthening Security of RSA-OAEP
- scientific article; zbMATH DE number 1107669 (Why is no real title available?)
- scientific article; zbMATH DE number 1842495 (Why is no real title available?)
- scientific article; zbMATH DE number 1842496 (Why is no real title available?)
- Post-quantum Security of Plain OAEP Transform
- Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
- On the Security of OAEP
- Instantiability of classical random-oracle-model encryption transforms
This page was built for publication: Toward RSA-OAEP without random oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041161)
