OAEP reconsidered
From MaRDI portal
Recommendations
Cited in
(41)- scientific article; zbMATH DE number 1617928 (Why is no real title available?)
- Signcryption schemes with insider security in an ideal permutation model
- Information and Communications Security
- On the optimality of lattices for the Coppersmith technique
- scientific article; zbMATH DE number 1942423 (Why is no real title available?)
- OAEP Is Secure under Key-Dependent Messages
- Sponge based CCA2 secure asymmetric encryption for arbitrary length message
- On the security of distributed multiprime RSA
- RSA-OAEP is secure under the RSA assumption
- Sponge-based CCA2 secure asymmetric encryption for arbitrary length message (extended version)
- scientific article; zbMATH DE number 1842497 (Why is no real title available?)
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
- Strengthening Security of RSA-OAEP
- scientific article; zbMATH DE number 1842495 (Why is no real title available?)
- Automated proofs for asymmetric encryption
- New approach to practical leakage-resilient public-key cryptography
- OAEP 3-Round:A Generic and Secure Asymmetric Encryption Padding
- Automated proofs for asymmetric encryption
- Time-selective convertible undeniable signatures with short conversion receipts
- Enforcing User-Aware Browser-Based Mutual Authentication with Strong Locked Same Origin Policy
- Relationship between Two Approaches for Defining the Standard Model PA-ness
- scientific article; zbMATH DE number 1950347 (Why is no real title available?)
- On the Security of OAEP
- NTRU prime: reducing attack surface at low cost
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
- NEW EXTENSIONS OF PAIRING-BASED SIGNATURES INTO UNIVERSAL (MULTI) DESIGNATED VERIFIER SIGNATURES
- Randomness recoverable secret sharing schemes
- From plaintext-extractability to IND-CCA security
- Instantiability of classical random-oracle-model encryption transforms
- Easy verifiable primitives and practical public key cryptosystems
- Instantiability of RSA-OAEP under chosen-plaintext attack
- Beyond provable security verifiable IND-CCA security of OAEP
- Cramer-Shoup Satisfies a Stronger Plaintext Awareness under a Weaker Assumption
- Chosen-ciphertext security without redundancy
- Toward RSA-OAEP without random oracles
- New \((t, n)\) threshold directed signature scheme with provable security
- RSA-OAEP is RKA secure
- Post-quantum verification of Fujisaki-Okamoto
- scientific article; zbMATH DE number 1848307 (Why is no real title available?)
- Instantiability of RSA-OAEP under chosen-plaintext attack
- scientific article; zbMATH DE number 1842496 (Why is no real title available?)
This page was built for publication: OAEP reconsidered
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865124)