A New Randomness Extraction Paradigm for Hybrid Encryption

  • Eike Kiltz
  • Krzysztof Pietrzak
  • Martijn Stam
  • Moti Yung
Conference paper

DOI: 10.1007/978-3-642-01001-9_34

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5479)
Cite this paper as:
Kiltz E., Pietrzak K., Stam M., Yung M. (2009) A New Randomness Extraction Paradigm for Hybrid Encryption. In: Joux A. (eds) Advances in Cryptology - EUROCRYPT 2009. EUROCRYPT 2009. Lecture Notes in Computer Science, vol 5479. Springer, Berlin, Heidelberg

Abstract

We present a new approach to the design of IND-CCA2 secure hybrid encryption schemes in the standard model. Our approach provides an efficient generic transformation from 1-universal to 2-universal hash proof systems. The transformation involves a randomness extractor based on a 4-wise independent hash function as the key derivation function. Our methodology can be instantiated with efficient schemes based on standard intractability assumptions such as Decisional Diffie-Hellman, Quadratic Residuosity, and Paillier’s Decisional Composite Residuosity. Interestingly, our framework also allows to prove IND-CCA2 security of a hybrid version of 1991’s Damgård’s ElGamal public-key encryption scheme under the DDH assumption.

Keywords

Chosen-ciphertext security hybrid encryption randomness extraction hash proof systems ElGamal 

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Eike Kiltz
    • 1
  • Krzysztof Pietrzak
    • 1
  • Martijn Stam
    • 2
  • Moti Yung
    • 3
  1. 1.Cryptology & Information Security GroupCWI AmsterdamThe Netherlands
  2. 2.LACALEPFLSwitzerland
  3. 3.Google Inc. and Columbia UniversityUSA

Personalised recommendations