Skip to main content
Log in

Multi-key FHE for multi-bit messages

  • Letter
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Gentry C. Fully homomorphic encryption using ideal lattices. Acm Symp Theory Comput, 2009, 9: 169–178

    MathSciNet  MATH  Google Scholar 

  2. Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from (standard) LWE. In: Proceedings of 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), Palm Springs, 2011. 97–106

    Chapter  Google Scholar 

  3. Gentry C, Sahai A, Waters B. Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Advances in Cryptology — CRYPTO 2013. Berlin: Springer, 2013. 8042: 75–92

    Article  MATH  Google Scholar 

  4. Hiromasa R, Abe M, Okamoto T. Packing messages and optimizing bootstrapping in GSW-FHE. In: Public-Key Cryptography — PKC 2015. Berlin: Springer, 2015. 9020: 699–715

    MathSciNet  MATH  Google Scholar 

  5. Li Z, Galbraith S, Ma C. Preventing adaptive key recovery attacks on the GSW levelled homomorphic encryption scheme. In: Proceedings of International Conference on Provable Security. Cham: Springer, 2016. 10005: 373–383

    MathSciNet  MATH  Google Scholar 

  6. Li Z, Ma C, Morais E, et al. Multi-bit leveled homomorphic encryption via dual.lwe-based. In: Proceedings of International Conference on Information Security and Cryptology. Cham: Springer, 2016. 10143: 221–242

    Article  MathSciNet  MATH  Google Scholar 

  7. López-Alt A, Tromer E, Vaikuntanathan V. On-thefly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Proceedings of the 44th ACM Symposium on Theory of Computing, New York, 2012. 1219–1234

    Google Scholar 

  8. Clear M, McGoldrick C. Multi-identity and multi-key leveled FHE from learning with errors. In: Advances in Cryptology — CRYPTO 2015. Berlin: Springer, 2015. 9216: 630–656

    Article  MathSciNet  MATH  Google Scholar 

  9. Mukherjee P, Wichs D. Two round multiparty computation via multi-key FHE. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2016. 9666: 735–763

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by National Natural Science Foundation of China (Grant No. 61472097).

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Zengpeng Li, Chunguang Ma or Hongsheng Zhou.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, Z., Ma, C. & Zhou, H. Multi-key FHE for multi-bit messages. Sci. China Inf. Sci. 61, 029101 (2018). https://doi.org/10.1007/s11432-017-9206-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-017-9206-y

Navigation