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