An uninstantiable random-oracle-model scheme for a hybrid-encryption problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3027, Issue , 2004, Pages 171-188

  Bellare, Mihir ^a   Boldyreva, Alexandra ^a   Palacio, Adriana ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

ASYMMETRIC ENCRYPTION; HYBRID ENCRYPTION; RANDOM ORACLE MODEL; RANDOM ORACLES; RO MODELING; STANDARD MODEL; SYMMETRIC ENCRYPTION; SYMMETRIC KEYS;

CRYPTOGRAPHY;

EID: 35048832490     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24676-3_11     Document Type: Article

References (21)

1. M. AGARWAL, N. SAXENA AND N. KAYAL, "PRIMES is in P," Preprint. Available at http://www.cse.iitk.ac.in/news/primality.html, August 6, 2002.
2. J. BAEK, B. LEE AND K. KIM, "Secure length-saving ElGamal encryption under the Computational Diffie-Hellman assumption," Proceedings of the Fifth Australasian Conference on Information Security and Privacy- ACISP 2000, LNCS Vol. 1841, E. Dawson, A. Clark and C. Boyd ed., Springer-Verlag, 2000.
3. M. BELLARE, A. BOLDYREVA AND A. PALACIO, "An Uninstantiable RandomOracle-Model Scheme for a Hybrid-Encryption Problem," Full version of this paper. Available at http://www-cse.ucsd.edu/users/mihir/.
4. J. BAEK, B. LEE AND K. KIM, "Provably secure length-saving public-key encryption scheme under the computational Diffie-Hellman assumption," ETRI Journal, 22(4), 2000.
5. M. BELLARE, A. DESAI, E. JOKIPII AND P. ROGAWAY, ''A concrete security treatment of symmetric encryption: Analysis of the DES modes of operation,'' Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997.
6. M. BELLARE AND P. ROGAWAY, Random oracles are practical: a paradigm for designing efficient protocols, First ACM Conference on Computer and Communications Security, ACM, 1993.
7. R. CANETTI, U. FEIGE, O. GOLDREICH AND M. NAOR, ''Adaptively secure multiparty computation,'' Proceedings of the 28th Annual Symposium on the Theory of Computing, ACM, 1996.
8. R. CANETTI, O. GOLDREICH, S. HALEVI, ''The random oracle methodology, revisited,'' Proceedings of the 30th Annual Symposium on the Theory of Computing, ACM, 1998.
9. J.-S. CORON, H. HANDSCHUH, M. JOYE, P. PAILLIER, D. POINTCHEVAL, C. TYMEN, ''GEM: A Generic Chosen-Ciphertext Secure Encryption Method'', Topics in Cryptology - CT-RSA 2002, LNCS Vol. 2271, B. Preneel ed., Springer-Verlag, 2002.
10. J.-S. CORON, H. HANDSCHUH, M. JOYE, P. PAILLIER, D. POINTCHEVAL, C. TYMEN, ''Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages,'' Proceedings of the Fifth International workshop on practice and theory in Public Key Cryptography- PKC 2002, LNCS Vol. 1431, D. Naccache and P. Paillier eds., Springer-Verlag, 2002.
11. R. CRAMER AND V. SHOUP, ''A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack,'' Advances in Cryptology - CRYPTO 1998, LNCS Vol. 1462, H. Krawczyk ed., Springer-Verlag, 1998.
12. R. CRAMER AND V. SHOUP, ''Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack,'' IACR ePrint archive, record 2001/108, 2001, http://eprint.iacr.org/.
13. T. ELGAMAL, ''A public key cryptosystem and signature scheme based on discrete logarithms,'' IEEE Transactions on Information Theory, Vol. 31, 1985.
14. A. FIAT AND A. SHAMIR, ''How to prove yourself: practical solutions to identification and signature problems,'' Advances in CryptoJogy - CRYPTO 1986, LNCS Vol. 263, A. Odlyzko ed., Springer-Verlag, 1986.
15. E. FUJISAKI, T. OKAMOTO, ''Secure Integration of Asymmetric and Symmetric Encryption Schemes,'' Advances in Cryptology - CRYPTO 1999, LNCS Vol. 1666, M. Wiener ed., Springer-Verlag, 1999.
16. S. GOLDWASSER AND S. MICALI, ''Probabilistic encryption,'' Journal of Computer and System Science, Vol. 28, 1984, pp. 270-299.
17. S. GOLDWASSER AND Y. TAUMANN, ''On the (in)security of the Fiat-Shamir paradigm,'' Proceedings of the 44th Symposium on Foundations of Computer Science, IEEE, 2003.
18. S. MICALI, ''Computationally sound proofs,'' SIAM Journal on Computing, Vol. 30, No. 4, 2000, pp. 1253-1298.
19. J. B. NlELSEN ''Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case,'' Advances in Cryptology - CRYPTO 2002, LNCS Vol. 2442, M. Yung ed., Springer-Verlag, 2002.
20. T. OKAMOTO AND D. POINTCHEVAL ''REACT: Rapid Enhanced-security Asymmetric Cryptosystem Transform,'' Topics in CryptoJogy - CT-RSA 2001, LNCS Vol. 2020, D. Naccache ed., Springer-Verlag, 2001.
21. V. SHOUP, ''A proposal for an ISO standard for public key encryption'', IACR ePrint archive, record 2001/112, 2001, http://eprint.iacr.org/.