An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem
- 1 January 2004
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption CasePublished by Springer Nature ,2002
- GEM: A Generic Chosen-Ciphertext Secure Encryption MethodPublished by Springer Nature ,2002
- Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length MessagesPublished by Springer Nature ,2002
- Provably Secure Length-saving Public-Key Encryption Scheme under the Computational Diffie-Hellman AssumptionETRI Journal, 2000
- REACT: Rapid Enhanced-Security Asymmetric Cryptosystem TransformPublished by Springer Nature ,2000
- Secure Length-Saving ElGamal Encryption under the Computational Diffie-Hellman AssumptionPublished by Springer Nature ,2000
- Computationally Sound ProofsSIAM Journal on Computing, 2000
- Secure Integration of Asymmetric and Symmetric Encryption SchemesPublished by Springer Nature ,1999
- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attackPublished by Springer Nature ,1998
- Probabilistic encryptionJournal of Computer and System Sciences, 1984