Instantiability of RSA-OAEP under chosen-plaintext attack

DOI10.1007/S00145-016-9238-4zbMATH Open1377.94056OpenAlexW2521689482MaRDI QIDQ2408591FDOQ2408591

Authors: Yanyan Li 

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

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

zbMATH Keywords

RSAstandard modellossy trapdoor functionsleftover hash lemmaOAEPpadding-based encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Probabilistic encryption
• New hash functions and their use in authentication and set equality
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Title not available (Why is that?)
• The random oracle methodology, revisited.
• Title not available (Why is that?)
• Foundations of Cryptography
• Title not available (Why is that?)
• Randomness is linear in space
• New attacks on PKCS\#1 V1.5 encryption
• On the Generic Insecurity of the Full Domain Hash
• Title not available (Why is that?)
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Correcting errors without leaking partial information
• The Group of Signed Quadratic Residues and Applications
• Deterministic and Efficiently Searchable Encryption
• On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
• Title not available (Why is that?)
• Non-committing encryption from \(\Phi\)-hiding
• OAEP reconsidered
• Title not available (Why is that?)
• Lossy Trapdoor Functions and Their Applications
• Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
• On the Security of OAEP
• Title not available (Why is that?)
• Title not available (Why is that?)
• Instantiating random oracles via UCEs
• Public-Key Locally-Decodable Codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• More constructions of lossy and correlation-secure trapdoor functions
• On the lossiness of the Rabin trapdoor function
• Foundations of non-malleable hash and one-way functions
• Instantiability of RSA-OAEP under chosen-plaintext attack
• Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
• Extractable Perfectly One-Way Functions
• On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols
• Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
• Title not available (Why is that?)
• Optimal bounds for multi-prime \(\Phi \)-hiding assumption
• Improved cryptanalysis of the multi-prime \(\varphi\)-hiding assumption
• RSA-OAEP is secure under the RSA assumption
• True random number generators secure in a changing environment.
• Regularity of lossy RSA on subdomains and its applications
• On the regularity of lossy RSA. Improved bounds and applications to padding-based encryption

Cited In (11)

• Title not available (Why is that?)
• 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
• On the lossiness of \(2^k\)-th power and the instantiability of Rabin-OAEP

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)