{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:55:44Z","timestamp":1760028944634,"version":"3.41.0"},"reference-count":56,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2015ini0003","type":"journal-article","created":{"date-parts":[[2016,7,31]],"date-time":"2016-07-31T22:12:26Z","timestamp":1470003146000},"page":"1982-1990","source":"Crossref","is-referenced-by-count":9,"title":["Challenges of Fully Homomorphic Encryptions for the Internet of Things"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Licheng","family":"WANG","sequence":"first","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"LI","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haseeb","family":"AHMAD","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] M. Ajtai and C. Dwork, \u201cA public-key cryptosystem with worstcase\/ averagecase equivalence,\u201d Proc. twenty-ninth annual ACM symposium on Theory of computing, ACM, pp.284-293, 1997.","DOI":"10.1145\/258533.258604"},{"key":"2","unstructured":"[2] J. Benaloh, \u201cDense Probabilistic Encryption,\u201d First Annual Workshop on Selected Areas in Cryptography, pp.120-128, 1994."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] D. Boneh, E. Goh, and K. Nissim, \u201cEvaluating 2-DNF formulas on ciphertexts,\u201d Theory of Cryptography-TCC&apos;05, LNCS, pp.325-341, 2005.","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Z. Brakerski, \u201cFully homomorphic encryption without modulus switching from classical gapSVP,\u201d Advances in Cryptology-CRYPTO 2012, Springer, pp.868-886, 2012.","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Z. Brakerski, C. Gentry, and V. Vaikuntanathan, \u201cFully homomorphic encryption without bootstrapping,\u201d Proc. 3rd Innovations in Theoretical Computer Science Conference, ACM, pp.309-325, 2012.","DOI":"10.1145\/2090236.2090262"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] Z. Brakerski and V. Vaikuntanathan, \u201cFully Homomorphic Encryption from Ring-LWE and security for Key Dependent Messages,\u201d Advances in Cryptology-CRYPTO 2011, Springer, pp.505-524, 2011.","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] J. Bringer, H. Chabanne, M. Izabach&apos;ene, D. Pointcheval, Q. Tang, and S. Zimmer, \u201cAn Application of the Goldwasser-Micali Cryptosystem to Biometric Authentication,\u201d Information Security and Privacy, Springer, pp.96-106, 2007.","DOI":"10.1007\/978-3-540-73458-1_8"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] H.-Y. Chien, \u201cSASI: A New Ultralightweight RFID Authentication Protocol Providing Strong Authentication and Strong Integrity,\u201d IEEE Trans. Dependable and Secure Computing, vol.4, no.4, pp.337-340, 2007.","DOI":"10.1109\/TDSC.2007.70226"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] J. Cohen and M.J. Fischer, \u201cA robust and verifiable cryptographically secure election scheme (extended abstract),\u201d In FOCS, IEEE Computer Society, pp.372-382, 1985.","DOI":"10.1109\/SFCS.1985.2"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] J.H. Cheon, J.-S. Coron, J. Kim, M.S. Lee, T. Lepoint, M. Tibouchi, and A. Yun, \u201cBatch fully homomorphic encryption over the integers,\u201d Advances in Cryptology-EUROCRYPT 2013, Springer, pp.315-335, 2013.","DOI":"10.1007\/978-3-642-38348-9_20"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] J. Coron, A. Mandal, D. Naccache, and M. Tibouchi, \u201cFully homomorphic encryption over the integers with shorter public keys,\u201d Advances in Cryptology-CRYPTO 2011, Springer, pp.487-504, 2011.","DOI":"10.1007\/978-3-642-22792-9_28"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] J. Coron, D. Naccache, and M. Tibouchi, \u201cPublic key compression and modulus switching for fully homomorphic encryption over the integers,\u201d Advances in Cryptology-EUROCRYPT 2012, Springer, pp.446-464, 2012.","DOI":"10.1007\/978-3-642-29011-4_27"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] R. Cramer and V. Shoup, \u201cA Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack,\u201d Advances in Cryptology-CRYPTO&apos;98, Springer, pp.13-25, 1998.","DOI":"10.1007\/BFb0055717"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] I. Damg\u00e5rd and M. Jurik, \u201cA generalisation, simplification and some applications of Paillier&apos;s probabilistic public-key system,\u201d Public Key Cryptography-PKC 2011, Springer, pp.119-136, 2001.","DOI":"10.1007\/3-540-44586-2_9"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, \u201cFully homomorphic encryption over the integers,\u201d Advances in cryptology-EUROCRYPT 2010, Springer, pp.24-43, 2010.","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] M. Dong, K. Ota, L.T. Yang, S. Chang, H. Zhu, and Z. Zhou, \u201cMobile agent-based energy-aware and user-centric data collection in wireless sensor networks,\u201d Comput. Netw. 74, pp.58-70, 2014.","DOI":"10.1016\/j.comnet.2014.06.019"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] L. Ducas and D. Micciancio, \u201cFHEW: Bootstrapping homomorphic encryption in less than a second,\u201d Advances in Cryptology-EUROCRYPT 2015, Springer, pp.617-640, 2015.","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] T. ElGamal, \u201cA Public Key Cryptosystem and a Signature Scheme based on Discrete Logarithms,\u201d Advances in cryptology, Springer, pp.10-18, 1984.","DOI":"10.1007\/3-540-39568-7_2"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] Z. Fu, X. Sun, Q. Liu, L. Zhou, and J. Shu, \u201cAchieving Efficient Cloud Search Services: Multi-keyword Ranked Search over Encrypted Cloud Data Supporting Parallel Computing,\u201d IEICE Trans. Commun., vol.98, no.1, pp.190-200, 2015.","DOI":"10.1587\/transcom.E98.B.190"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] C. Gentry, \u201cFully homomorphic encryption using ideal lattices,\u201d STOC, pp.168-179, 2009.","DOI":"10.1145\/1536414.1536440"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] C. Gentry and Shai Halevi, \u201cFully homomorphic encryption without squashing using depth-3 arithmetic circuits,\u201d Foundations of Computer Science (FOCS), pp.107-109, 2011.","DOI":"10.1109\/FOCS.2011.94"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] C. Gentry, S. Halevi, and N.P. Smart, \u201cBetter bootstrapping in fully homomorphic encryption,\u201d Public Key Cryptography-PKC 2012, Springer, pp.1-16, 2012.","DOI":"10.1007\/978-3-642-30057-8_1"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] S. Goldwasser and S. Micali, \u201cProbabilistic encryption,\u201d J. Computer and System Sciences, vol.28, no.2, pp.270-299, 1984.","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] M. Joye and B. Libert, \u201cEfficient cryptosystems from 2<i><sup>k<\/sup><\/i>-th power residue symbols,\u201d Advances in Cryptology-EUROCRYPT 2013, Springer, pp.76-92, 2013.","DOI":"10.1007\/978-3-642-38348-9_5"},{"key":"25","unstructured":"[25] M. Kantarcioglu, Privacy-preserving distributed data mining and processing on horizontally partitioned data. ETD Collection for Purdue University, 2005, AAI3191494."},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] A. Kawachi, K. Tanaka, and K. Xagawa, \u201cMulti-bit cryptosystems based on lattice problems,\u201d Public Key Cryptography-PKC 2007, Springer, pp.315-329, 2007.","DOI":"10.1007\/978-3-540-71677-8_21"},{"key":"27","unstructured":"[27] J. Kim, M.S. Lee, A. Yun, and J.H. Cheon, CRT-based fully homomorphic encryption over the integers, IACR Cryptology ePrint Archive 2013; 2013: 57. URL http:\/\/eprint.iacr.org\/2013\/057."},{"key":"28","unstructured":"[28] A. Kipnis and E. Hibshoosh, Efficient methods for practical fully homomorphic symmetric-key encrypton, randomization and verification, IACR Cryptology ePrint Archive 2012; 2012: 637. URL http:\/\/eprint.iacr.org\/2012\/637."},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] H. Li, M. Dong, and K. Ota, \u201cRadio Access Network Virtualization for the Social Internet of Things,\u201d IEEE Cloud Computing, vol.2, no.6, pp.42-50, 2015.","DOI":"10.1109\/MCC.2015.114"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] M. Naehrig, K. Lauter, and V. Vaikunthnathan, \u201cCan homomorphic encryption be practical?\u201d Proc. 3rd ACM workshop on Cloud computing security workshop, ACM, pp.113-124, 2011.","DOI":"10.1145\/2046660.2046682"},{"key":"31","unstructured":"[31] D. Liu, Practical fully homomorphic encryption without noise reduction, IACR Cryptology ePrint Archive 2015; 2015: 468. URL http:\/\/eprint.iacr.org\/2015\/468."},{"key":"32","unstructured":"[32] A. L\u00f3pez-Alt, E. Tromer, and V. Vaikuntanathan, Cloud-assisted multiparty computation from fully homomorphic encryption, IACR Cryptology ePrint Archive 2011; 2011: 663. URL http:\/\/eprint.iacr.org\/2011\/663."},{"key":"33","doi-asserted-by":"crossref","unstructured":"[33] C. Moore, M. O&apos;Neill, E. O&apos;Sullivan, Y. Dor\u00f6z, and B. Sunar, \u201cPractical homomorphic encryption: A survey,\u201d Circuits and Systems (ISCAS), 2014 IEEE International Symposium on. IEEE, pp.2792-2795, 2014.","DOI":"10.1109\/ISCAS.2014.6865753"},{"key":"34","doi-asserted-by":"crossref","unstructured":"[34] T. Ma, J. Zhou, M. Tang, Y. Tian, A. Al-Dhelaan, M. Al-Rodhaan, and S. Lee, \u201cSocial network and tag sources based augmenting col-laborative recommender system,\u201d IEICE Trans. Inf. &amp; Syst., vol.E98-D, no.4, pp.902-910, 2015.","DOI":"10.1587\/transinf.2014EDP7283"},{"key":"35","doi-asserted-by":"crossref","unstructured":"[35] D. Naccache and J. Stern, \u201cA New Public Key Cryptosystem Based on Higher Residues,\u201d Proc. 5th ACM CCS, pp.59-66, 1998.","DOI":"10.1145\/288090.288106"},{"key":"36","doi-asserted-by":"crossref","unstructured":"[36] K. Nuida and K. Kurosawa, \u201c(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces,\u201d Advances in Cryptology-EUROCRYPT 2015, Springer, pp.537-555, 2015.","DOI":"10.1007\/978-3-662-46800-5_21"},{"key":"37","doi-asserted-by":"crossref","unstructured":"[37] T. Okamoto and S. Uchiyama, \u201cA new public-key cryptosystemas secure as factoring,\u201d Advances in Cryptology-EUROCRYPT 1998, Springer, pp.308-318, 1998.","DOI":"10.1007\/BFb0054135"},{"key":"38","doi-asserted-by":"crossref","unstructured":"[38] P. Paillier, \u201cPublic-key cryptosystems based on composite degree residuosity classes,\u201d Advances in cryptology-EUROCRYPT 1999, Springer, pp.223-238, 1999.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"39","doi-asserted-by":"crossref","unstructured":"[39] C. Peikert and B. Waters, \u201cLossy Trapdoor Functions and Their Applications,\u201d SIAM J. Computing, vol.40, no.6, pp.1803-1844, 2011.","DOI":"10.1137\/080733954"},{"key":"40","unstructured":"[40] A. Poschmann, Lightweight Cryptography from an Engineers Perspective, Workshop on Elliptic Curve Cryptography (ECC 2007). 2007."},{"key":"41","unstructured":"[41] R.L. Rivest, L.M. Adleman, and M.L. Dertouzos, \u201cOn data banks and privacy homomorphisms,\u201d Foundations of Secure Computation, vol.4, no.11, pp.169-180, 1978."},{"key":"42","doi-asserted-by":"crossref","unstructured":"[42] R.L. Rivest, A. Shamir, and L.M. Adleman, \u201cA method for obtaining digital signatures and public-key cryptosystems,\u201d Commun. ACM, vol.21, no.2, pp.120-126, 1978.","DOI":"10.1145\/359340.359342"},{"key":"43","doi-asserted-by":"crossref","unstructured":"[43] S. Sowe, T. Kimata, M. Dong, and K. Zettsu, \u201cManaging Heterogeneous Sensor Data on a Big Data Platform: IoT Services for Data-Intensive Science,\u201d Computer Software and Applications Conference Workshops (COMPSACW), 2014 IEEE 38th International. IEEE, pp.295-300, 2014.","DOI":"10.1109\/COMPSACW.2014.52"},{"key":"44","doi-asserted-by":"crossref","unstructured":"[44] T. Sander, A. Young, and M. Yung, \u201cNon-interactive cryptocomputing for NC<sup>1<\/sup>,\u201d Foundations of Computer Science (FOCS), pp.554-567, 1999.","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"45","doi-asserted-by":"crossref","unstructured":"[45] P. Scholl and N. Smart, \u201cImproved key generation for Gentry&apos;s fully homomorphic encryption scheme,\u201d Cryptography and Coding, Springer, pp.10-22, 2011.","DOI":"10.1007\/978-3-642-25516-8_2"},{"key":"46","doi-asserted-by":"crossref","unstructured":"[46] N. Smart and F. Vercauteren, \u201cFully homomorphic encryption with relatively small key and ciphertext sizes,\u201d Public Key Cryptography-PKC 2010, Springer, pp.420-443, 2010.","DOI":"10.1007\/978-3-642-13013-7_25"},{"key":"47","doi-asserted-by":"crossref","unstructured":"[47] N. Smart and F. Vercauteren, \u201cFully homomorphic SIMD operations,\u201d Designs, codes and cryptography, vol.71, no.1, pp.57-81, 2014.","DOI":"10.1007\/s10623-012-9720-4"},{"key":"48","doi-asserted-by":"crossref","unstructured":"[48] D. Stehl\u00e9 and R. Steinfeld, \u201cFaster fully homomorphic encryption,\u201d Advances in Cryptology-ASIACRYPT 2010, Springer, pp.377-394, 2010.","DOI":"10.1007\/978-3-642-17373-8_22"},{"key":"49","unstructured":"[49] Y. Wang, Notes on two fully homomorphic encryption schemes without bootstrapping, IACR Cryptology ePrint Archive 2015; 2015: 519. URL http:\/\/eprint.iacr.org\/2015\/519."},{"key":"50","doi-asserted-by":"crossref","unstructured":"[50] A.S. Wander, N. Gura, H. Eberle, V. Gupta, and S.C. Shantz, \u201cEnergy analysis of public-key cryptography for wireless sensor networks,\u201d Pervasive Computing and Communications, 2005. PerCom 2005. Third IEEE International Conference on. IEEE, pp.324-328, 2005.","DOI":"10.1109\/PERCOM.2005.18"},{"key":"51","doi-asserted-by":"crossref","unstructured":"[51] J. Wu, M. Dong, K. Ota, L. Liang, and Z. Zhou, \u201cSecuring distributed storage for Social Internet of Things using regenerating code and Blom key agreement,\u201d Peer-to-Peer Networking and Applications, vol.8, no.6, pp.1133-1142, 2015.","DOI":"10.1007\/s12083-014-0286-y"},{"key":"52","doi-asserted-by":"crossref","unstructured":"[52] Z. Xia, X. Wang, X. Sun, and Q. Wang, A Secure and Dynamic Multi-keyword Ranked Search Scheme over Encrypted Cloud Data, IEEE Trans. Parallel Distrib. Syst., (DOI: 10.1109\/TPDS.2015.2401003), 2015.","DOI":"10.1109\/TPDS.2015.2401003"},{"key":"53","unstructured":"[53] M. Yagisawa, Fully homomorphic encryption with composite number modulus, IACR Cryptology ePrint Archive 2015; 2015: 474. URL http:\/\/eprint.iacr.org\/2015\/474."},{"key":"54","unstructured":"[54] M. Yagisawa, Fully homomorphic encryption without bootstrapping, IACR Cryptology ePrint Archive 2015; 2015: 1040. URL http:\/\/eprint.iacr.org\/2015\/1040."},{"key":"55","unstructured":"[55] M. Yagisawa, Fully homomorphic encryption on octonion ring, IACR Cryptology ePrint Archive 2015; 2015: 733. URL http:\/\/eprint.iacr.org\/2015\/733."},{"key":"56","doi-asserted-by":"crossref","unstructured":"[56] J.H. Ziegeldorf, O.G. Morchon, and K. Wehrle, \u201cPrivacy in the internet of things: threats and challenges,\u201d Security and Communication Networks, vol.7, no.12, pp.2728-2742, 2014.","DOI":"10.1002\/sec.795"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/8\/E99.D_2015INI0003\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T10:06:23Z","timestamp":1749031583000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/8\/E99.D_2015INI0003\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":56,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2015ini0003","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2016]]}}}