{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T18:34:56Z","timestamp":1773945296972,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"CAS Project for Young Scientists in Basic Research Grant","award":["No. YSBR-035"],"award-info":[{"award-number":["No. YSBR-035"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Homomorphic evaluation of hash functions offers a solution to the challenge of data integrity authentication in the context of homomorphic encryption. The earliest attempt to achieve homomorphic evaluation of SHA-256 hash function was proposed by Mella and Susella (in: Cryptography and coding\u201414th IMA international conference, IMACC 2013. Lecture notes in computer science, vol 8308. Springer, Heidelberg, pp 28\u201344, 2013. <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"doi\" xlink:href=\"10.1007\/978-3-642-45239-0_3\">https:\/\/doi.org\/10.1007\/978-3-642-45239-0_3<\/jats:ext-link>.) based on the BGV scheme. Unfortunately, their implementation faced significant limitations due to the exceedingly high multiplicative depth, rendering it impractical. Recently, a homomorphic implementation of SHA-256 based on the TFHE scheme (Homomorphic evaluation of SHA-256. <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/zama-ai\/tfhe-rs\/tree\/main\/tfhe\/examples\/sha256_bool\">https:\/\/github.com\/zama-ai\/tfhe-rs\/tree\/main\/tfhe\/examples\/sha256_bool<\/jats:ext-link>) brings it from theory to reality, however, its current efficiency remains insufficient. In this paper, we revisit the homomorphic evaluation of the SHA-256 hash function in the context of TFHE, further reducing the reliance on gate bootstrapping and enhancing evaluation latency. Specifically, we primarily utilize ternary gates to reduce the number of gate bootstrappings required for logic functions in message expansion and addition of modulo <jats:inline-formula><jats:alternatives><jats:tex-math>$$2^{32}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mn>2<\/mml:mn>\n                    <mml:mn>32<\/mml:mn>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> in iterative compression. Furthermore, we demonstrate that our optimization techniques are applicable to the Chinese commercial cryptographic hash SM3. Finally, we give specific comparative implementations based on the TFHE-rs library. Experiments demonstrate that our optimization techniques lead to an improvement of approximately 35\u201350% compared with the state-of-the-art result under different cores.<\/jats:p>","DOI":"10.1186\/s42400-024-00204-0","type":"journal-article","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:02:18Z","timestamp":1719878538000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved homomorphic evaluation for hash function based on TFHE"],"prefix":"10.1186","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-0653-2070","authenticated-orcid":false,"given":"Benqiang","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianhui","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"key":"204_CR1","doi-asserted-by":"publisher","unstructured":"Albrecht MR, Rechberger C, Schneider T, Tiessen T, Zohner M (2015) Ciphers for MPC and FHE. In: EUROCRYPT 2015, vol 9056. Springer, Heidelberg, pp 430\u2013454. https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"204_CR2","doi-asserted-by":"publisher","unstructured":"Ashur T, Mahzoun M, Toprakhisar D (2022) Chaghri\u2013A fhe-friendly block cipher. In: Proceedings of the 2022 ACM SIGSAC conference on computer and communications security, CCS 2022. ACM, New York, pp 139\u2013150. https:\/\/doi.org\/10.1145\/3548606.3559364","DOI":"10.1145\/3548606.3559364"},{"key":"204_CR3","doi-asserted-by":"publisher","unstructured":"Bendoukha A, Stan O, Sirdey R, Quero N, Souza LF (2022) Practical homomorphic evaluation of block-cipher-based hash functions with applications. In: Foundations and practice of security\u201415th international symposium, FPS 2022. Lecture notes in computer science, vol 13877. Springer, Cham, pp 88\u2013103. https:\/\/doi.org\/10.1007\/978-3-031-30122-3_6","DOI":"10.1007\/978-3-031-30122-3_6"},{"key":"204_CR4","doi-asserted-by":"crossref","unstructured":"Bonte C, Iliashenko I, Park J, Pereira HVL, Smart NP (2022) FINAL: faster FHE instantiated with NTRU and LWE. In: ASIACRYPT 2022, vol 13792. Lecture notes in computer science. Springer, Cham, pp 188\u2013215","DOI":"10.1007\/978-3-031-22966-4_7"},{"key":"204_CR5","doi-asserted-by":"crossref","unstructured":"Brakerski Z (2012) Fully homomorphic encryption without modulus switching from classical GapSVP. In: CRYPTO 2012. Springer, Heidelberg, pp 868\u2013886","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"204_CR6","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V (2012) (leveled) fully homomorphic encryption without bootstrapping. In: Innovations in theoretical computer science 2012. ACM, New York, pp 309\u2013325","DOI":"10.1145\/2090236.2090262"},{"key":"204_CR7","doi-asserted-by":"publisher","unstructured":"Canteaut A, Carpov S, Fontaine C, Lepoint T, Naya-Plasencia M, Paillier P, Sirdey R (2016) Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. In: FSE 2016. Lecture notes in computer science, vol 9783. Springer, Heidelberg, pp 313\u2013333. https:\/\/doi.org\/10.1007\/978-3-662-52993-5_16","DOI":"10.1007\/978-3-662-52993-5_16"},{"key":"204_CR8","doi-asserted-by":"crossref","unstructured":"Cheon JH, Han K, Kim A, Kim M, Song Y (2018) Bootstrapping for approximate homomorphic encryption. In: EUROCRYPT 2018, vol 10820. Lecture notes in computer science. Springer, Cham, pp 360\u2013384","DOI":"10.1007\/978-3-319-78381-9_14"},{"key":"204_CR9","doi-asserted-by":"crossref","unstructured":"Cheon JH, Kim A, Kim M, Song YS (2017) Homomorphic encryption for arithmetic of approximate numbers. In: ASIACRYPT 2017. Springer, Cham, pp 409\u2013437","DOI":"10.1007\/978-3-319-70694-8_15"},{"issue":"1","key":"204_CR10","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 (2020) TFHE: fast fully homomorphic encryption over the torus. J Cryptol 33(1):34\u201391","journal-title":"J Cryptol"},{"key":"204_CR11","doi-asserted-by":"publisher","unstructured":"Cho J, Ha J, Kim S, Lee B, Lee J, Lee J, Moon D, Yoon H (2021) Transciphering framework for approximate homomorphic encryption. In: ASIACRYPT 2021. Lecture notes in computer science, vol 13092. Springer, Cham, pp 640\u2013669. https:\/\/doi.org\/10.1007\/978-3-030-92078-4_22","DOI":"10.1007\/978-3-030-92078-4_22"},{"key":"204_CR12","doi-asserted-by":"crossref","unstructured":"Cid C, Indr\u00f8y JP, Raddum H (2022) FASTA\u2014a stream cipher for fast FHE evaluation. In: CT-RSA 2022, vol 13161. Lecture notes in computer science. Springer, Cham, pp 451\u2013483","DOI":"10.1007\/978-3-030-95312-6_19"},{"key":"204_CR13","doi-asserted-by":"crossref","unstructured":"Cosseron O, Hoffmann C, M\u00e9aux P, Standaert F (2022)Towards globally optimized hybrid homomorphic encryption\u2014featuring the Elisabeth stream cipher. IACR Cryptol ePrint Arch 180","DOI":"10.1007\/978-3-031-22969-5_2"},{"key":"204_CR14","doi-asserted-by":"publisher","unstructured":"Dinur I, Liu Y, Meier W, Wang Q (2015) Optimized interpolation attacks on lowmc. In: ASIACRYPT 2015. Lecture notes in computer science, vol 9453. Springer, Heidelberg, pp 535\u2013560. https:\/\/doi.org\/10.1007\/978-3-662-48800-3_22","DOI":"10.1007\/978-3-662-48800-3_22"},{"key":"204_CR15","doi-asserted-by":"publisher","first-page":"30","DOI":"10.46586\/TCHES.V2023.I3.30-73","volume":"3","author":"C Dobraunig","year":"2023","unstructured":"Dobraunig C, Grassi L, Helminger L, Rechberger C, Schofnegger M, Walch R (2023) Pasta: a case for hybrid homomorphic encryption. IACR Trans Cryptogr Hardw Embed Syst 3:30\u201373. https:\/\/doi.org\/10.46586\/TCHES.V2023.I3.30-73","journal-title":"IACR Trans Cryptogr Hardw Embed Syst"},{"key":"204_CR16","doi-asserted-by":"publisher","unstructured":"Dobraunig C, Eichlseder M, Grassi L, Lallemand V, Leander G, List E, Mendel F, Rechberger C (2018) Rasta: a cipher with low and depth and few ands per bit. In: CRYPTO 2018. Lecture notes in computer science, vol 10991. Springer, Cham, pp 662\u2013692. https:\/\/doi.org\/10.1007\/978-3-319-96884-1_22","DOI":"10.1007\/978-3-319-96884-1_22"},{"key":"204_CR17","doi-asserted-by":"crossref","unstructured":"Dobraunig C, Eichlseder M, Mendel F (2015) Higher-order cryptanalysis of lowmc. In: ICISC 2015, vol 9558. Lecture notes in computer science. Springer, Cham, pp 87\u2013101","DOI":"10.1007\/978-3-319-30840-1_6"},{"issue":"2","key":"204_CR18","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10623-015-0095-1","volume":"80","author":"Y Dor\u00f6z","year":"2016","unstructured":"Dor\u00f6z Y, Hu Y, Sunar B (2016) Homomorphic AES evaluation using the modified LTV scheme. Des Codes Cryptogr 80(2):333\u2013358","journal-title":"Des Codes Cryptogr"},{"key":"204_CR19","doi-asserted-by":"crossref","unstructured":"Ducas L, Micciancio D (2015) FHEW: bootstrapping homomorphic encryption in less than a second. In: EUROCRYPT 2015. Springer, Heidelberg, pp 617\u2013640","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"204_CR20","unstructured":"Fan J, Vercauteren F (2012) Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report \/144. https:\/\/eprint.iacr.org\/2012\/144"},{"key":"204_CR21","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) A fully homomorphic encryption scheme","DOI":"10.1145\/1536414.1536440"},{"key":"204_CR22","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S, Smart NP (2012) Homomorphic evaluation of the AES circuit. In: CRYPTO 2012, vol 7417. Springer, Heidelberg, pp 850\u2013867","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"204_CR23","doi-asserted-by":"publisher","first-page":"194741","DOI":"10.1109\/ACCESS.2020.3033564","volume":"8","author":"J Ha","year":"2020","unstructured":"Ha J, Kim S, Choi W, Lee J, Moon D, Yoon H, Cho J (2020) Masta: an he-friendly cipher using modular arithmetic. IEEE Access 8:194741\u2013194751. https:\/\/doi.org\/10.1109\/ACCESS.2020.3033564","journal-title":"IEEE Access"},{"key":"204_CR24","doi-asserted-by":"publisher","unstructured":"Ha J, Kim S, Lee B, Lee J, Son M (2022) Rubato: noisy ciphers for approximate homomorphic encryption. In: EUROCRYPT 2022. Springer, Cham, pp 581\u2013610. https:\/\/doi.org\/10.1007\/978-3-031-06944-4_20","DOI":"10.1007\/978-3-031-06944-4_20"},{"issue":"3","key":"204_CR25","doi-asserted-by":"publisher","first-page":"46","DOI":"10.13154\/TOSC.V2020.I3.46-86","volume":"2020","author":"P Hebborn","year":"2020","unstructured":"Hebborn P, Leander G (2020) Dasta\u2014alternative linear layer for rasta. IACR Trans Symmetric Cryptol 2020(3):46\u201386. https:\/\/doi.org\/10.13154\/TOSC.V2020.I3.46-86","journal-title":"IACR Trans Symmetric Cryptol"},{"key":"204_CR26","doi-asserted-by":"crossref","unstructured":"Hoffmann C, M\u00e9aux P, Ricosset T (2020) Transciphering, using filip and TFHE for an efficient delegation of computation. In: INDOCRYPT 2020, vol 12578. Lecture notes in computer science. Springer, Cham, pp 39\u201361","DOI":"10.1007\/978-3-030-65277-7_3"},{"key":"204_CR27","unstructured":"Homomorphic evaluation of SHA-256 (2023) https:\/\/github.com\/zama-ai\/tfhe-rs\/tree\/main\/tfhe\/examples\/sha256_bool"},{"key":"204_CR28","unstructured":"https:\/\/oscca.gov.cn\/sca\/xxgk\/2010-12\/17\/1002389\/files\/302a3ada057c4a73830536d03e683110.pdf"},{"key":"204_CR29","unstructured":"https:\/\/www.zama.ai\/post\/announcing-tfhe-rs"},{"key":"204_CR30","doi-asserted-by":"publisher","unstructured":"Klemsa J, \u00d6nen M (2022) Parallel operations over TFHE-encrypted multi-digit integers. In: CODASPY \u201922. ACM, New York, pp 288\u2013299. https:\/\/doi.org\/10.1145\/3508398.3511527","DOI":"10.1145\/3508398.3511527"},{"key":"204_CR31","doi-asserted-by":"crossref","unstructured":"Lepoint T, Naehrig M (2014) A comparison of the homomorphic encryption schemes FV and YASHE. In: AFRICACRYPT 2014, vol 8469. Lecture notes in computer science. Springer, Cham, pp 318\u2013335","DOI":"10.1007\/978-3-319-06734-6_20"},{"key":"204_CR32","unstructured":"Lou Q, Jiang L (2019) SHE: a fast and accurate deep neural network for encrypted data. In: NeurIPS 2019, pp 10035\u201310043"},{"key":"204_CR33","doi-asserted-by":"publisher","unstructured":"Mandal K, Gong G (2021) Homomorphic evaluation of lightweight cipher Boolean circuits. In: FPS 2021. Springer, Cham, pp 63\u201374. https:\/\/doi.org\/10.1007\/978-3-031-08147-7_5","DOI":"10.1007\/978-3-031-08147-7_5"},{"key":"204_CR34","doi-asserted-by":"publisher","unstructured":"Matsuoka K, Hoshizuki Y, Sato T, Bian S (2021) Towards better standard cell library: Optimizing compound logic gates for TFHE. In: WAHC \u201921: proceedings of the 9th on workshop on encrypted computing & applied homomorphic cryptography. WAHC@ACM, New York, pp 63\u201368. https:\/\/doi.org\/10.1145\/3474366.3486927","DOI":"10.1145\/3474366.3486927"},{"key":"204_CR35","doi-asserted-by":"publisher","unstructured":"M\u00e9aux P, Journault A, Standaert F (2019) Improved filter permutators for efficient FHE: better instances and implementations. In: INDOCRYPT 2019, vol 11898. Springer, Cham, pp 68\u201391 https:\/\/doi.org\/10.1007\/978-3-030-35423-7_4","DOI":"10.1007\/978-3-030-35423-7_4"},{"key":"204_CR36","doi-asserted-by":"publisher","unstructured":"M\u00e9aux P, Journault A, Standaert F, Carlet C (2016) Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: EUROCRYPT lecture notes in computer science, vol 9665. Springer, Heidelberg, pp 311\u2013343 (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_13","DOI":"10.1007\/978-3-662-49890-3_13"},{"key":"204_CR37","doi-asserted-by":"publisher","unstructured":"Mella S, Susella R (2013) On the homomorphic computation of symmetric cryptographic primitives. In: Cryptography and coding\u201414th IMA international conference, IMACC 2013. Lecture notes in computer science, vol 8308. Springer, Heidelberg, pp 28\u201344. https:\/\/doi.org\/10.1007\/978-3-642-45239-0_3","DOI":"10.1007\/978-3-642-45239-0_3"},{"key":"204_CR38","doi-asserted-by":"crossref","unstructured":"Naehrig M, Lauter KE, Vaikuntanathan V (2011) Can homomorphic encryption be practical? In: CCSW 2011. ACM, New York, pp 113\u2013124","DOI":"10.1145\/2046660.2046682"},{"key":"204_CR39","first-page":"12","volume":"4","author":"R Payal","year":"2015","unstructured":"Payal R, Goel M, Manglik P (2015) Design and implementation of parallel prefix adder for improving the performance of carry lookahead adder. Int J Eng Tech Res 4:12","journal-title":"Int J Eng Tech Res"},{"issue":"3","key":"204_CR40","doi-asserted-by":"publisher","first-page":"163","DOI":"10.46586\/tosc.v2018.i3.163-181","volume":"2018","author":"C Rechberger","year":"2018","unstructured":"Rechberger C, Soleimany H, Tiessen T (2018) Cryptanalysis of low-data instances of full lowmcv2. IACR Trans Symmetric Cryptol 2018(3):163\u2013181","journal-title":"IACR Trans Symmetric Cryptol"},{"key":"204_CR41","unstructured":"Science TN Secure hash standard (shs) (2012) http:\/\/csrc.nist.gov\/publications\/PubsFIPS.html"},{"key":"204_CR42","unstructured":"Stracovsky R, Mahdavi RA, Kerschbaum F (2022) Faster evaluation of AES using TFHE. In: Poster Session, FHE.Org\u20142022. https:\/\/rasoulam.github.io\/data\/poster-aes-tfhe.pdf"},{"key":"204_CR43","first-page":"375","volume":"16","author":"M Togan","year":"2015","unstructured":"Togan M, Lupascu C, Plesca C (2015) Homomorphic evaluation of speck cipher. Proc Roman Acad Ser A: Math Phys Tech Sci Inf Sci 16:375\u2013384","journal-title":"Proc Roman Acad Ser A: Math Phys Tech Sci Inf Sci"},{"key":"204_CR44","doi-asserted-by":"publisher","unstructured":"Trama D, Clet P, Boudguiga A, Sirdey R (2023) A homomorphic AES evaluation in less than 30 seconds by means of TFHE. In: Proceedings of the 11th workshop on encrypted computing & applied homomorphic cryptography. ACM, New York, , pp 79\u201390. https:\/\/doi.org\/10.1145\/3605759.3625260","DOI":"10.1145\/3605759.3625260"},{"key":"204_CR45","doi-asserted-by":"crossref","unstructured":"Wei B, Lu X (2023) Improved homomorphic evaluation for hash function based on TFHE. In: Information security and cryptology\u201419th international conference, Inscrypt 2023","DOI":"10.1007\/978-981-97-0945-8_25"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00204-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-024-00204-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00204-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:04:37Z","timestamp":1719878677000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-024-00204-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,2]]},"references-count":45,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["204"],"URL":"https:\/\/doi.org\/10.1186\/s42400-024-00204-0","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,2]]},"assertion":[{"value":"30 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"14"}}