Instantiability of RSA-OAEP under chosen-plaintext attack
From MaRDI portal
Publication:2408591
Recommendations
- Instantiability of RSA-OAEP under chosen-plaintext attack
- scientific article; zbMATH DE number 1848307
- Toward RSA-OAEP without random oracles
- scientific article; zbMATH DE number 1107698
- Instantiability of classical random-oracle-model encryption transforms
- scientific article; zbMATH DE number 1842497
- scientific article; zbMATH DE number 1302834
- RSA-OAEP is secure under the RSA assumption
- scientific article; zbMATH DE number 1842496
- A generalized attack on some variants of the RSA cryptosystem
Cites work
- scientific article; zbMATH DE number 1617924 (Why is no real title available?)
- scientific article; zbMATH DE number 1722684 (Why is no real title available?)
- scientific article; zbMATH DE number 4172375 (Why is no real title available?)
- scientific article; zbMATH DE number 4033661 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 1304086 (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 1942423 (Why is no real title available?)
- scientific article; zbMATH DE number 2081059 (Why is no real title available?)
- scientific article; zbMATH DE number 1842497 (Why is no real title available?)
- Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
- Correcting errors without leaking partial information
- Deterministic and Efficiently Searchable Encryption
- Extractable Perfectly One-Way Functions
- Foundations of Cryptography
- Foundations of non-malleable hash and one-way functions
- Improved cryptanalysis of the multi-prime \(\varphi\)-hiding assumption
- Instantiability of RSA-OAEP under chosen-plaintext attack
- Instantiating random oracles via UCEs
- Lossy Trapdoor Functions and Their Applications
- More constructions of lossy and correlation-secure trapdoor functions
- New attacks on PKCS\#1 V1.5 encryption
- New hash functions and their use in authentication and set equality
- Non-committing encryption from \(\Phi\)-hiding
- OAEP reconsidered
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- On the Generic Insecurity of the Full Domain Hash
- On the Security of OAEP
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
- On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols
- On the lossiness of the Rabin trapdoor function
- On the regularity of lossy RSA. Improved bounds and applications to padding-based encryption
- Optimal bounds for multi-prime \(\Phi \)-hiding assumption
- Probabilistic encryption
- Public-Key Locally-Decodable Codes
- RSA-OAEP is secure under the RSA assumption
- Randomness is linear in space
- Regularity of lossy RSA on subdomains and its applications
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- The Group of Signed Quadratic Residues and Applications
- The random oracle methodology, revisited.
- Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
- Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
- True random number generators secure in a changing environment.
Cited in
(11)- On the lossiness of \(2^k\)-th power and the instantiability of Rabin-OAEP
- scientific article; zbMATH DE number 1842497 (Why is no real title available?)
- Regular lossy functions and their applications in leakage-resilient cryptography
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
- Instantiability of classical random-oracle-model encryption transforms
- Factorization, malleability and equivalent problems
- On the regularity of lossy RSA. Improved bounds and applications to padding-based encryption
- A Note on the Instantiability of the Quantum Random Oracle
- Toward RSA-OAEP without random oracles
- Randomized coding of plaintext encryption scheme
- Instantiability of RSA-OAEP under chosen-plaintext attack
This page was built for publication: Instantiability of RSA-OAEP under chosen-plaintext attack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408591)
