{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T11:47:25Z","timestamp":1770464845333,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T00:00:00Z","timestamp":1663372800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T00:00:00Z","timestamp":1663372800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["20K19765"],"award-info":[{"award-number":["20K19765"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["17H00729"],"award-info":[{"award-number":["17H00729"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19H21526"],"award-info":[{"award-number":["19H21526"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"crossref","award":["JPMJCR19K5"],"award-info":[{"award-number":["JPMJCR19K5"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"crossref","award":["JPMJPR18M3"],"award-info":[{"award-number":["JPMJPR18M3"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Homomorphic encryption (HE) method can be used to realize arithmetic operations on encrypted data. This method, however, is limited owing to its low efficiency in performing certain functions, especially those involving several multiplications. As a solution, this paper proposes a new HE-based secure computation scheme, termed as the HE for stochastic computing (HESC); this scheme can homomorphically evaluate both the stochastic addition and multiplication operations, without any bootstrapping. This HESC scheme is constructed based on additive\/multiplicative HE, which only supports homomorphic addition\/multiplication, and realizes the homomorphic evaluation of stochastic multiplication. The HESC employs the features of stochastic computing (SC) for homomorphic stochastic operations, where stochastic additions and multiplications are performed using random multiplexing and bit-parallel logic operations, respectively. This paper first presents a basic HESC scheme based on additive\/multiplicative HE. It then presents an efficient HESC scheme that utilizes the parallelism of lattice-based cryptography (i.e., plaintext packing and vectorized homomorphic evaluation). A new stochastic addition operation is also introduced in this study, which can be used for the HESC instantiated by lattice-based cryptography. This new stochastic addition operation significantly improves the accuracy of the HESC, albeit with the trade-off of increased ciphertext size. Accordingly, this paper also proposes a technique that can reduce the size of ciphertexts, while maintaining the accuracy of the scheme. The basic performance of the HESC implemented with various HEs is demonstrated, along with its applications in polynomial functions and an oblivious inference with a neural network. Lastly, the results thus obtained indicate that the proposed scheme is more advantageous than the conventional schemes. This paper is concluded with some implications\/research directions for HESC from perspectives of cryptography and HE implementations.<\/jats:p>","DOI":"10.1007\/s13389-022-00299-6","type":"journal-article","created":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T06:02:36Z","timestamp":1663394556000},"page":"251-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Homomorphic encryption for stochastic computing"],"prefix":"10.1007","volume":"13","author":[{"given":"Ryusuke","family":"Koseki","sequence":"first","affiliation":[]},{"given":"Akira","family":"Ito","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9754-6792","authenticated-orcid":false,"given":"Rei","family":"Ueno","sequence":"additional","affiliation":[]},{"given":"Mehdi","family":"Tibouchi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0864-3126","authenticated-orcid":false,"given":"Naofumi","family":"Homma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,17]]},"reference":[{"issue":"11","key":"299_CR1","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Found. Secure Comput. 4(11), 169\u2013180 (1978)","journal-title":"Found. Secure Comput."},{"key":"299_CR2","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"issue":"5","key":"299_CR3","first-page":"1333","volume":"13","author":"Y Aono","year":"2017","unstructured":"Aono, Y., Hayashi, T., Wang, L., Moriai, S., et al.: Privacy-preserving deep learning via additively homomorphic encryption. IEEE Trans. Inf. Forensics Secur. 13(5), 1333\u20131345 (2017)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"299_CR4","unstructured":"Gilad-Bachrach, R., Dowlin, N., Laine, K., Lauter, K., Naehrig, M., Wernsing, J.: Cryptonets: Applying neural networks to encrypted data with high throughput and accuracy. In: International Conference on Machine Learning, pp. 201\u2013210. PMLR (2016)"},{"key":"299_CR5","first-page":"2364","volume":"33","author":"LT Phong","year":"2020","unstructured":"Phong, L.T., Aono, Y., Hayashi, T., Wang, L., Moriai, S.: Fast spectral inference on encrypted data. Adv. Neural Inf. Process. Syst. 33, 2364\u20132374 (2020)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"299_CR6","unstructured":"Brutzkus, A., Gilad-Bachrach, R., Elisha, O.: Low latency privacy preserving inference. In: International Conference on Machine Learning, pp. 812\u2013821. PMLR (2019)"},{"key":"299_CR7","doi-asserted-by":"crossref","unstructured":"Dathathri, R., Saarikivi, O., Chen, H., Laine, K., Lauter, K., Maleki, S., Musuvathi, M., Mytkowicz, T.: Chet: an optimizing compiler for fully-homomorphic neural-network inferencing. In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 142\u2013156 (2019)","DOI":"10.1145\/3314221.3314628"},{"key":"299_CR8","doi-asserted-by":"crossref","unstructured":"Jiang, X., Kim, M., Lauter, K., Song, Y.: Secure outsourced matrix computation and application to neural networks. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 1209\u20131222 (2018)","DOI":"10.1145\/3243734.3243837"},{"key":"299_CR9","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 409\u2013437. Springer (2017)","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"299_CR10","unstructured":"Boura, C., Gama, N., Georgieva, M.: Chimera: a unified framework for B\/FV, TFHE and HEAAN fully homomorphic encryption and predictions for deep learning. IACR Cryptol. ePrint Arch. 2018:758 (2018)"},{"key":"299_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-1-4899-5841-9_2","volume-title":"Advances in Information Systems Science","author":"BR Gaines","year":"1969","unstructured":"Gaines, B.R.: Stochastic computing systems. In: Advances in Information Systems Science, pp. 37\u2013172. Springer (1969)"},{"key":"299_CR12","doi-asserted-by":"crossref","unstructured":"Chang, Y.N., Parhi, K.K.: Architectures for digital filters using stochastic computing. In: 2013 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 2697\u20132701. IEEE (2013)","DOI":"10.1109\/ICASSP.2013.6638146"},{"issue":"8","key":"299_CR13","doi-asserted-by":"publisher","first-page":"1592","DOI":"10.1587\/transinf.2016LOP0011","volume":"100","author":"S Koshita","year":"2017","unstructured":"Koshita, S., Onizawa, N., Abe, M., Hanyu, T., Kawamata, M.: High-accuracy and area-efficient stochastic FIR digital filters based on hybrid computation. IEICE Trans. Inf. Syst. 100(8), 1592\u20131602 (2017)","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"10","key":"299_CR14","doi-asserted-by":"publisher","first-page":"2688","DOI":"10.1109\/TVLSI.2017.2654298","volume":"25","author":"A Ardakani","year":"2017","unstructured":"Ardakani, A., Leduc-Primeau, F., Onizawa, N., Hanyu, T., Gross, W.J.: VLSI implementation of deep neural network using integral stochastic computing. IEEE Trans. Very Large Scale Integr. Syst. 25(10), 2688\u20132699 (2017)","journal-title":"IEEE Trans. Very Large Scale Integr. Syst."},{"issue":"9","key":"299_CR15","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1109\/TC.2018.2817237","volume":"67","author":"Y Liu","year":"2018","unstructured":"Liu, Y., Liu, S., Wang, Y., Lombardi, F., Han, J.: A stochastic computational multi-layer perceptron with backward propagation. IEEE Trans. Comput. 67(9), 1273\u20131286 (2018)","journal-title":"IEEE Trans. Comput."},{"key":"299_CR16","doi-asserted-by":"crossref","unstructured":"Li, J., Ren, A., Li, Z., Ding, C., Yuan, B., Qiu, Q., Wang, Y.: Towards acceleration of deep convolutional neural networks using stochastic computing. In: 2017 22nd Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 115\u2013120. IEEE (2017)","DOI":"10.1109\/ASPDAC.2017.7858306"},{"issue":"4","key":"299_CR17","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1145\/3093336.3037746","volume":"52","author":"A Ren","year":"2017","unstructured":"Ren, A., Li, Z., Ding, C., Qiu, Q., Wang, Y., Li, J., Qian, X., Yuan, B.: SC-DCNN: Highly-scalable deep convolutional neural network using stochastic computing. ACM SIGPLAN Notices 52(4), 405\u2013418 (2017)","journal-title":"ACM SIGPLAN Notices"},{"issue":"6","key":"299_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3124441","volume":"50","author":"P Martins","year":"2017","unstructured":"Martins, P., Sousa, L., Mariano, A.: A survey on fully homomorphic encryption: an engineering perspective. ACM Comput. Surv. 50(6), 1\u201333 (2017)","journal-title":"ACM Comput. Surv."},{"key":"299_CR19","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption & how to play mental poker keeping secret all partial information. In: Providing Sound Foundations for Cryptography, pp. 173\u2013201. ACM (2019)","DOI":"10.1145\/3335741.3335749"},{"issue":"4","key":"299_CR20","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"299_CR21","doi-asserted-by":"crossref","unstructured":"Liu, J., Asokan, N., Pinkas, B.: Secure deduplication of encrypted data without additional independent servers. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 874\u2013885 (2015)","DOI":"10.1145\/2810103.2813623"},{"issue":"5","key":"299_CR22","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/49.223883","volume":"11","author":"GB Agnew","year":"1993","unstructured":"Agnew, G.B., Mullin, R.C., Vanstone, S.A.: An implementation of elliptic curve cryptosystems over F\/sub 2\/155. IEEE J. Sel. Areas Commun. 11(5), 804\u2013813 (1993)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"299_CR23","unstructured":"Virat, M.: A cryptosystem\u201d \u00e0 la\u201d ELGamal on an elliptic curve over Fp [$$\\epsilon $$]. In: WEWoRC 2005\u2014Western European Workshop on Research in Cryptology. Gesellschaft f\u00fcr Informatik eV (2005)"},{"key":"299_CR24","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","DOI":"10.1145\/359340.359342"},{"key":"299_CR25","doi-asserted-by":"crossref","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 617\u2013640. Springer (2015)","DOI":"10.1007\/978-3-662-46800-5_24"},{"issue":"1","key":"299_CR26","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2020)","journal-title":"J. Cryptol."},{"key":"299_CR27","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. IACR Cryptol. ePrint Arch. 2012:144 (2012)"},{"issue":"3","key":"299_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory 6(3), 1\u201336 (2014)","journal-title":"ACM Trans. Comput. Theory"},{"key":"299_CR29","unstructured":"Kim, A., Deryabin, M., Eom, J., Choi, R., Lee, Y., Ghang, W., Yoo, D.: General bootstrapping approach for RLWE-based homomorphic encryption. Cryptology ePrint Archive, Report 2021\/691 (2021). https:\/\/ia.cr\/2021\/691"},{"key":"299_CR30","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: Bootstrapping for approximate homomorphic encryption. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 360\u2013384. Springer (2018)","DOI":"10.1007\/978-3-319-78381-9_14"},{"issue":"1","key":"299_CR31","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10623-012-9720-4","volume":"71","author":"NP Smart","year":"2014","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic SIMD operations. Des. Codes Cryptogr. 71(1), 57\u201381 (2014)","journal-title":"Des. Codes Cryptogr."},{"key":"299_CR32","unstructured":"LeCun, Y., Cortes, C.: MNIST handwritten digit database (2010)"},{"key":"299_CR33","unstructured":"Laine, K., Player, R.: Simple encrypted arithmetic library-seal (v2. 0). Technical Report (2016)"},{"key":"299_CR34","unstructured":"Microsoft SEAL (release 3.4). https:\/\/github.com\/Microsoft\/SEAL, October 2019. Microsoft Research, Redmond"},{"key":"299_CR35","unstructured":"Huelse. SEAL-Python. https:\/\/github.com\/Huelse\/SEAL-Python"},{"key":"299_CR36","unstructured":"Certicom Research. Recommended elliptic curve domain parameters. Standards for Efficient Cryptography (SEC) 2 (2000)"},{"key":"299_CR37","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.800-57p1r2006","volume-title":"Recommendation for key management: Part 1: General","author":"E Barker","year":"2006","unstructured":"Barker, E., Barker, E., Burr, W., Polk, W., Smid, M., et al.: Recommendation for key management: Part 1: General. National Institute of Standards and Technology, Technology Administration (2006)"},{"issue":"2","key":"299_CR38","doi-asserted-by":"publisher","first-page":"37","DOI":"10.15514\/ISPRAS-2020-32(2)-4","volume":"32","author":"MGE Babenko","year":"2020","unstructured":"Babenko, M.G.E., Golimblevskaia, E.I., Shiriaev, E.M.: Comparative analysis of homomorphic encryption algorithms based on learning with errors. Proc. Inst. Syst. Program. RAS 32(2), 37\u201351 (2020)","journal-title":"Proc. Inst. Syst. Program. RAS"},{"key":"299_CR39","doi-asserted-by":"crossref","unstructured":"Wen, Y., Zhang, K., Li, Z., Qiao, Y.: A discriminative feature learning approach for deep face recognition. In: ECCV, pp. 499\u2013515. Springer (2016)","DOI":"10.1007\/978-3-319-46478-7_31"},{"key":"299_CR40","doi-asserted-by":"crossref","unstructured":"Halevi, S., Shoup, V.: Algorithms in helib. In: Annual Cryptology Conference, pp. 554\u2013571. Springer (2014)","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"299_CR41","doi-asserted-by":"crossref","unstructured":"Li, B., Micciancio, D.: On the security of homomorphic encryption on approximate numbers. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Lecture Notes in Computer Science, vol. 12696, pp. 648\u2013677 (2021)","DOI":"10.1007\/978-3-030-77870-5_23"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-022-00299-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13389-022-00299-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-022-00299-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T04:21:36Z","timestamp":1684815696000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13389-022-00299-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,17]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["299"],"URL":"https:\/\/doi.org\/10.1007\/s13389-022-00299-6","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,17]]},"assertion":[{"value":"31 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}