Skip to main content

Blockchain-Based Secure Outsourcing of Fully Homomorphic Encryption Using Hidden Ideal Lattice

  • Conference paper
  • First Online:
Parallel and Distributed Computing, Applications and Technologies (PDCAT 2020)

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

  • 1163 Accesses

Abstract

The efficiency of homomorphic encryption has always affected its practicality. With the dawn of internet of things, the demand for computation and encryption on lightweight devices is increasing. Complex cryptographic computing is an important burden for lightweight devices, but outsourcing provides great convenience for them. In this paper, based on blockchain, we propose a secure outsourcing scheme for Fully Homomorphic Encryption using Hidden Ideal Lattice (FHEHIL), in which the time-consuming operations (including modular exponentiation and polynomial multiplication) are outsourced. For polynomial multiplication, we propose a secure outsourcing algorithm that reduces the local computation cost to \(O\left(n\right)\). Previous work based on Fast Fourier Transform can only achieve \(O\left(nlog(n)\right)\) for the local cost. Through security analysis, our scheme achieves the goals of privacy protection against passive attackers and cheating detection against active attackers. Experiments also demonstrate our scheme is more efficient in comparison with the non-outsourcing FHEHIL.

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 EPUB and 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

References

  1. Nakamoto, S.: Bitcoin: A Peer-to-Peer Electronic Cash System (2008). https://bitcoin.rog/bitcoin.pdf

  2. Zhong, H., Sang, Y., Zhang, Y., Xi, Z.: Secure multi-party computation on blockchain: an overview. In: Shen, H., Sang, Y. (eds.) PAAP 2019. CCIS, vol. 1163, pp. 452–460. Springer, Singapore (2020). https://doi.org/10.1007/978-981-15-2767-8_40

    Chapter  Google Scholar 

  3. Thomas, T., Willy, S., Zhenfei, Z.: Fully homomorphic encryption using hidden ideal lattice. IEEE Trans. Inf. Forensics Secur. 8(12), 2127–2137 (2013)

    Article  Google Scholar 

  4. Smart, N.P., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext Sizes. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 420–443. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13013-7_25

    Chapter  MATH  Google Scholar 

  5. Gentry, C., Halevi, S.: Implementing Gentry’s fully-homomorphic encryption scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129–148. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20465-4_9

    Chapter  Google Scholar 

  6. Zhou, Q., Tian, C., Zhang, H., Yu, J., Li, F.: How to securely outsource the extended Euclidean algorithm for large-scale polynomial over finite fields. Inf. Sci. 512, 641–660 (2020)

    Article  MathSciNet  Google Scholar 

  7. Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465–482. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14623-7_25

    Chapter  Google Scholar 

  8. Fei, C., Tao, X., Yuanyuan, Y.: Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud. J. Parallel Distrib. Comput. 74(3), 2141–2151 (2014)

    Article  Google Scholar 

  9. Anmin, F., Shuai, L., Shui, Y., Yuqing, Z., Yinxia, S.: Privacy-preserving composite modular exponentiation outsourcing with optimal checkability in single untrusted cloud server. J. Netw. Comput. Appl. 118, 102–112 (2018)

    Article  Google Scholar 

  10. Brakerski, Z.: Fully homomorphic encryption without switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology-CRYPTO 2012. LNCS, vol. 7417, pp. 868–886. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32009-5_50

    Chapter  Google Scholar 

  11. Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 75–92. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40041-4_5

    Chapter  Google Scholar 

  12. Zvika, B., Vinod, V.: Efficient fully homomorphic encryption from (standard) LEW. SIAM J. Comput. 43(2), 831–871 (2014)

    Article  MathSciNet  Google Scholar 

  13. Hohenberger, S., Lysyanskaya, A.: How to securely outsource cryptographic computations. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 264–282. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-30576-7_15

    Chapter  Google Scholar 

  14. Chen, X., Li, J., Ma, J., Tang, Q., Lou, W.: New algorithms for secure outsourcing of modular exponentiations. IEEE Trans. Parallel Distrib. Syst. 25(9), 2386–2396 (2014)

    Article  Google Scholar 

  15. Ren, Y., Ding, N., Zhang, X., Lu, H., Gu, D.: Verifiable outsourcing algorithms for modular exponentiations with improved checkability. In: ASIA CCS 2016: Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, pp. 293–303. ACM (2016)

    Google Scholar 

  16. Zang, Y., Deng, R.H., Liu, X., et al.: Blockchain based efficient and robust fair payment for outsourcing services in cloud computing. Inf. Sci. 462, 262–277 (2018)

    Article  MathSciNet  Google Scholar 

  17. Wang, H., Wang, X.A., Wang, W., Xiao, S.: A basic framework of blockchain-based decentralized verifiable outsourcing. In: Barolli, L., Nishino, H., Miwa, H. (eds.) Advances in Intelligent Networking and Collaborative Systems, INCoS 2019. Advances in Intelligent Systems and Computing, pp. 415–421, vol. 1035. Springer, Cham. https://doi.org/10.1007/978-3-030-29035-1_40

  18. Hao, K., Xin, J., Wang, Z., Wang, G.: Outsourced data integrity verification based on blockchain in untrusted environment. World Wide Web 23(4), 2215–2238 (2020). https://doi.org/10.1007/s11280-019-00761-2

    Article  Google Scholar 

  19. Zheng, H., Shao, J., Wei, G.: Attribute-based encryption with outsourced decryption in blockchain. Peer-to-Peer Netw. Appl. 13(5), 1643–1655 (2020). https://doi.org/10.1007/s12083-020-00918-1

    Article  Google Scholar 

Download references

Acknowledgement

This work was supported by the Key-Area Research and Development Program of Guangdong Province (NO. 2020B010164003), the Science and Technology Program of Guangzhou, China (No. 201904010209), and the Science and Technology Program of Guangdong Province, China (No. 2017A010101039).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yingpeng Sang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Song, M., Sang, Y., Zeng, Y., Luo, S. (2021). Blockchain-Based Secure Outsourcing of Fully Homomorphic Encryption Using Hidden Ideal Lattice. In: Zhang, Y., Xu, Y., Tian, H. (eds) Parallel and Distributed Computing, Applications and Technologies. PDCAT 2020. Lecture Notes in Computer Science(), vol 12606. Springer, Cham. https://doi.org/10.1007/978-3-030-69244-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-69244-5_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-69243-8

  • Online ISBN: 978-3-030-69244-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics