Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption

Ronald Cramer, Victor Shoup

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present several new and fairly practical public-key encryption schemes and prove them secure against adaptive chosen ciphertext attack. One scheme is based on Paillier’s Decision Composite Residuosity assumption, while another is based in the classical Quadratic Residuosity assumption. The analysis is in the standard cryptographic model, i.e., the security of our schemes does not rely on the Random Oracle model. Moreover, we introduce a general framework that allows one to construct secure encryption schemes in a generic fashion from language membership problems that satisfy certain technical requirements. Our new schemes fit into this framework, as does the Cramer-Shoup scheme based on the Decision Diffie-Hellman assumption.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology - EUROCRYPT 2002 - International Conference on the Theory and Applications of Cryptographic Techniques, 2002, Proceedings
EditorsLars R. Knudsen
PublisherSpringer Verlag
Pages45-64
Number of pages20
ISBN (Print)9783540435532
DOIs
StatePublished - 2002
EventInternational Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2002 - Amsterdam, Netherlands
Duration: Apr 28 2002May 2 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2332
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherInternational Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2002
CountryNetherlands
CityAmsterdam
Period4/28/025/2/02

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption'. Together they form a unique fingerprint.

  • Cite this

    Cramer, R., & Shoup, V. (2002). Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In L. R. Knudsen (Ed.), Advances in Cryptology - EUROCRYPT 2002 - International Conference on the Theory and Applications of Cryptographic Techniques, 2002, Proceedings (pp. 45-64). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2332). Springer Verlag. https://doi.org/10.1007/3-540-46035-7_4