Skip to main content

Twin Hybrid ElGamal Encryption over Signed Quadratic Residue Groups

  • Conference paper
Wireless Algorithms, Systems, and Applications (WASA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6221))

Abstract

In this paper, we consider the security of twin Hybrid ElGamal (THEG) scheme when instantiated over the group of signed quadratic residues. In random oracle model, the scheme is proved IND-CCA secure under composite computation Diffie-Hellman assumption, which is at least as hard as factoring. In the standard model, we give a more tight security reduction for THEG, using a new hash proof system, than that of Hybrid ElGamal (HEG) in [4]. Therefore, THEG can be instantiated over smaller RSA modulus than HEG, which results in shorter ciphertexts for the same bit security and hence reduces the communication complexity of encrypted data transmitted over public communication lines.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdalla, M., Bellare, M., Rogaway, P.: The oracle Diffie-Hellman assumptions and an analysis of DHIES. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 143–158. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Cash, D.M., Kiltz, E., Shoup, V.: The twin diffie-hellman problem and applications. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 127–145. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Kiltz, E., Pietrzak, K., Stam, M., Yung. M.: A New Randomness Extraction Paradigm for Hybrid Encryption. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 589–608. Springer, Heidelberg (2010)

    Google Scholar 

  4. Hofheinz, D., Kiltz, E.: The group of signed quadratic residues and applications. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 637–653. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Rackoff, C., Simon, R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 433–444. Springer, Heidelberg (1992)

    Google Scholar 

  6. Shmuely, Z.: Composite diffie-hellman public-key generating systems are hard to break. Technical Report 356, Computer Science Department, Technion, Israel (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cui, Y., Liu, Y. (2010). Twin Hybrid ElGamal Encryption over Signed Quadratic Residue Groups. In: Pandurangan, G., Anil Kumar, V.S., Ming, G., Liu, Y., Li, Y. (eds) Wireless Algorithms, Systems, and Applications. WASA 2010. Lecture Notes in Computer Science, vol 6221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14654-1_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14654-1_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14653-4

  • Online ISBN: 978-3-642-14654-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics