Abstract
In encryption scheme setting, users who possess the right key can authorize to do computation with the data. In particular, cloud storage users lose their rights in terms of integrity on data, even after they ends up metered service from a CSP(Cloud Storage service provider), There is a possibility of dishonest computation over an old data by CSP also. Fully homomorphic encryption scheme address the problem of possessing the data in untrusted servers. In this proposed work, authors bring in a fully Homomorphic Batch Encryption Scheme using Integers with Shorter public key (HBEIS) converged with integrity verification process in a cloud setting. Any third-party auditor can do random audit on the encrypted data for assuring the correctness of data without possessing the original data. In our experimental set up, HBEIS scheme ensures optimal space and linear computational complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cheon, J.H., Coron, J.-S., Kim, J., Lee, M.S., Lepoint, T., Tibouchi, M., Yun, A.: Batch fully homomorphic encryption over the ıntegers. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 315–335. Springer, Heidelberg (2013)
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)
van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the ıntegers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24–43. Springer, Heidelberg (2010)
Coron, J.-S., Mandal, A., Naccache, D., Tibouchi, M.: Fully homomorphic encryption over the integers with shorter public-keys. In: Advances in Cryptology – Proceedings of Crypto 2011. Lecture Notes in Computer Science, vol. 6841, pp. 487–504. Springer, Heidelberg (2011)
Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (Standard) LWE. In: Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. FOCS 2011, pp. 97–106. IEEE Computer Society, Palm Springs (2011)
Brakerski, Z., Gentry, C., Vaikuntanathan, V.: Fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, Proceeding ITCS 2012, Cambridge, Massachusetts, pp. 309–325 (2012). Also available in Cryptology Eprint Archive, Report (2011/277)
dos Santos, L.C., Bilar, G.R., Pereira, F.D.: Implementation of the fully homomorphic encryption scheme over integers with shorter keys. In: 7th International Conference on New Technologies, Mobility and Security (NTMS). IEEE Xplore digital Library, Paris (2015)
Gentry, C.: A Fully Homomorphic Encryption Scheme, Doctoral Dissertation, Stanford University, Stanford, California (2009). http://Crypto.Stanford.Edu/Craig
Sachan, A.: Implementation of Homomorphic Encryption Technique, M. Tech Thesis. National Institute of Technology, Rourkela, June (2014). http://ethesis.nitrkl.ac.in/6436/
De Carvalh, N.T.F.: A Practical Validation of Homomorphic Message Authentication Schemes, Doctoral Dissertation, Universidade Do Minho, Outubro De, Portugal (2014)
Acar, A., Aksu, H., Uluagac, A.S., Conti, M.: A Survey on Homomorphic Encryption Schemes: Theory and Implementation, arXiv preprint arXiv:1704.03578 (2017)
Rivest, R.L., Adleman, L., Dertouzos, M.L.: On Data Banks And Privacy Homomor-Phisms. Foundations of Secure Computation, vol. 4, 11th edn, pp. 169–180. Academic Press Inc, Cambridge (1978)
Malik, D.S., Mordeson, J. N., Sen, M.: MTH 581–582 Introduction to Abstract Algebra, pp. 581–582 (2007)
Liddell, H.G., Scott, R.: An İntermediate Greek-English Lexicon: Founded Upon the Seventh Edition of Liddell and Scott’s Greek-English Lexicon. Harper & Brothers, New York (1896)
Gentry, C.: Computing arbitrary functions of encrypted data. Commun. ACM (CACM) 53, 97–105 (2010)
Archer, D.W., Rohloff, G.K.: Computing with data privacy: steps toward realization. IEEE Secur. Privacy 13(1), 22–29 (2015)
Yao, A.C.-C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982), FOCS, Chicago, Illinois, vol. 82, pp. 160–164 (1982)
Kim, J., Lee, M.S., Yun, A., Cheon, J.H.: CRT-Based Fully Homomorphic Encryption Over the Integers. Information Sciences, vol. 310, pp. 149–162. Elsevier, Amsterdam (2015). https://doi.org/10.1016/j.ins.2015.03.019
Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop, CCSW 2011, pp. 113–124. ACM (2011)
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)
Chen, H., Laine, K., Player, R.: Simple Encrypted Arithmetic Library - SEAL v2.2, Microsoft Research foundation-Tech report, Number MSR-TR-2017-22 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Hariharasitaraman, S., Balakannan, S.P. (2020). Towards Converging Fully Homomorphic Batch Encryption with Data Integrity Assurance in Cloud Setting. In: Pandian, A.P., Senjyu, T., Islam, S.M.S., Wang, H. (eds) Proceeding of the International Conference on Computer Networks, Big Data and IoT (ICCBI - 2018). ICCBI 2018. Lecture Notes on Data Engineering and Communications Technologies, vol 31. Springer, Cham. https://doi.org/10.1007/978-3-030-24643-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-24643-3_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-24642-6
Online ISBN: 978-3-030-24643-3
eBook Packages: EngineeringEngineering (R0)