Skip to main content

Attack on Recent Homomorphic Encryption Scheme over Integers

  • Conference paper
  • First Online:
Multimedia and Ubiquitous Engineering

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 240))

  • 1277 Accesses

Abstract

At CDCIEM 2012, Yang et al. proposed a new construction of somewhat homomorphic encryption scheme over integers, which is quite efficient in the perspective of the key size. In this paper, we present an effective lattice reduction attack on Yang et al.’s scheme, where it is easy to recover the plaintext by applying LLL algorithm.

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 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: STOC 2009, pp 169–178

    Google Scholar 

  2. Dijk M, Gentry C, Halevi S, Vaikuntanathan V (2010) Fully homomorphic encryption over the integers. In: Advances in cryptology—EUROCRYPT 2010. LNCS, vol 6110, pp 24–43

    Google Scholar 

  3. Coron JS, Mandal A, Naccache D, Tibouchi M (2011) Fully homomorphic encryption over the integers with shorter public keys. In: Advances in cryptology—CRYPTO 2011. LNCS, vol 6841, pp 487–504

    Google Scholar 

  4. Yang H, Tang D, Xia Q, Wang X (2012) A new somewhat homomorphic encryption scheme over integers. In: Proceedings of CDCIEM 2012, pp 61–64

    Google Scholar 

  5. Regev O (2005) On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of STOC 2005, pp 84–93

    Google Scholar 

  6. Nguyen PQ, Vallée B (2009) The LLL algorithm: survey and applications., Information security and cryptographySpringer, Heidelberg

    Google Scholar 

  7. Lenstra HW, Lenstra AK, Lovasz L (1982) Factoring polynomials with rational coefficients. Math Ann 261:515–534

    Article  MATH  MathSciNet  Google Scholar 

  8. Shoup V. NTL: A library for doing number theory. http://shoup.net/ntl/, Version 5.5.2

Download references

Acknowledgments

This work was supported by National Research Foundation of Korea (NRF) under “2011 Korea-China Young Scientist Exchange Program” and National Science Fund of China under Grant No. 61103207 and also was partially supported by the National Research Foundation of Korea Grant funded by the Korean Government (MEST) (NRF-2010-0021575).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hyunsung Kim .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media Dordrecht(Outside the USA)

About this paper

Cite this paper

Yang, H., Kim, H., Tang, D. (2013). Attack on Recent Homomorphic Encryption Scheme over Integers. In: Park, J., Ng, JY., Jeong, HY., Waluyo, B. (eds) Multimedia and Ubiquitous Engineering. Lecture Notes in Electrical Engineering, vol 240. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-6738-6_34

Download citation

  • DOI: https://doi.org/10.1007/978-94-007-6738-6_34

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-007-6737-9

  • Online ISBN: 978-94-007-6738-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics