Minimizing the use of random oracles in authenticated encryption schemes
From MaRDI portal
(Redirected from Minimizing the use of random oracles in authenticated encryption schemes)
Recommendations
- scientific article; zbMATH DE number 2079934
- On obfuscation with random oracles
- Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Toward RSA-OAEP without random oracles
- Boosting authenticated encryption robustness with minimal modifications
- Efficient Identity-Based Encryption Without Random Oracles
- Theory of Cryptography
- Security of Encryption Schemes in Weakened Random Oracle Models
Cited in
(12)- The wonderful world of global random oracles
- BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
- IND-CCA secure encryption based on a Zheng-Seberry scheme
- Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme
- Signcryption schemes with threshold unsigncryption, and applications
- Designing efficient authenticated key exchange resilient to leakage of ephemeral secret keys
- Subliminal hash channels
- Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead
- Combining Encryption and Proof of Knowledge in the Random Oracle Model
- Fully secure threshold unsigncryption
- Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
- More efficient shuffle argument from unique factorization
This page was built for publication: Minimizing the use of random oracles in authenticated encryption schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373607)
