{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T12:52:30Z","timestamp":1771073550762,"version":"3.50.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031301216","type":"print"},{"value":"9783031301223","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30122-3_6","type":"book-chapter","created":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T07:03:57Z","timestamp":1680246237000},"page":"88-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Practical Homomorphic Evaluation of\u00a0Block-Cipher-Based Hash Functions with\u00a0Applications"],"prefix":"10.1007","author":[{"given":"Adda Akram","family":"Bendoukha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oana","family":"Stan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renaud","family":"Sirdey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Quero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luciano","family":"Freitas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,1]]},"reference":[{"key":"6_CR1","unstructured":"Albrecht, M., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. Cryptology ePrint Archive, Paper 2016\/687 (2016). https:\/\/eprint.iacr.org\/2016\/687"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-030-40186-3_15","volume-title":"Topics in Cryptology \u2013 CT-RSA 2020","author":"P Aubry","year":"2020","unstructured":"Aubry, P., Carpov, S., Sirdey, R.: Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits. In: Jarecki, S. (ed.) CT-RSA 2020. LNCS, vol. 12006, pp. 345\u2013363. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_15"},{"key":"6_CR3","unstructured":"Beaulieu, R., Shors, D., Smith, J., Treatman-Clark, S., Weeks, B., Wingers, L.: The SIMON and SPECK families of lightweight block ciphers. Cryptology ePrint Archive, Paper 2013\/404 (2013). https:\/\/eprint.iacr.org\/2013\/404"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Beierle, C., et al.: Schwaemm and Esch: Lightweight authenticated encryption and hashing using the sparkle permutation family (2019)","DOI":"10.46586\/tosc.v2020.iS1.208-261"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Bendoukha, A.A., Boudguiga, A., Sirdey, R.: Revisiting stream-cipher-based homomorphic transciphering in the TFHE era. In: A\u00efmeur, E., Laurent, M., Yaich, R., Dupont, B., Garcia-Alfaro, J. (eds.) Foundations and Practice of Security. LNCS, vol. 13291, pp. 19\u201333. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08147-7_2","DOI":"10.1007\/978-3-031-08147-7_2"},{"key":"6_CR6","unstructured":"Biham, E., Dunkelman, O.: A framework for iterative hash functions - HAIFA. Cryptology ePrint Archive, Paper 2007\/278 (2007). https:\/\/eprint.iacr.org\/2007\/278"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-45708-9_21","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"J Black","year":"2002","unstructured":"Black, J., Rogaway, P., Shrimpton, T.: Black-box analysis of the block-cipher-based hash-function constructions from PGV. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 320\u2013335. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_21"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-23951-9_21","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"A Bogdanov","year":"2011","unstructured":"Bogdanov, A., Kne\u017eevi\u0107, M., Leander, G., Toz, D., Var\u0131c\u0131, K., Verbauwhede, I.: spongent: a lightweight hash function. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 312\u2013325. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_21"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Boneh, D., Eskandarian, S., Hanzlik, L., Greco, N.: Single secret leader election. Cryptology ePrint Archive, Paper 2020\/025 (2020). https:\/\/eprint.iacr.org\/2020\/025","DOI":"10.1145\/3419614.3423258"},{"key":"6_CR10","unstructured":"Boneh, D., et al.: Threshold cryptosystems from threshold fully homomorphic encryption. Cryptology ePrint Archive, Paper 2017\/956 (2017). https:\/\/eprint.iacr.org\/2017\/956"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Borghoff, J., et al.: Prince - a low-latency block cipher for pervasive computing applications (full version). Cryptology ePrint Archive, Paper 2012\/529 (2012). https:\/\/eprint.iacr.org\/2012\/529","DOI":"10.1007\/978-3-642-34961-4_14"},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s00145-017-9273-9","volume":"31","author":"A Canteaut","year":"2018","unstructured":"Canteaut, A., et al.: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. J. Cryptol. 31(3), 885\u2013916 (2018). https:\/\/doi.org\/10.1007\/s00145-017-9273-9","journal-title":"J. Cryptol."},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-78825-8_23","volume-title":"Combinatorial Algorithms","author":"S Carpov","year":"2018","unstructured":"Carpov, S., Aubry, P., Sirdey, R.: A multi-start heuristic for multiplicative depth minimization of Boolean circuits. In: Brankovic, L., Ryan, J., Smyth, W.F. (eds.) IWOCA 2017. LNCS, vol. 10765, pp. 275\u2013286. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78825-8_23"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Carpov, S., Dubrulle, P., Sirdey, R.: Armadillo: a compilation chain for privacy preserving applications. In: Bao, F., Miller, S., Chow, S.S.M., Yao, D. (eds.) Proceedings of the 3rd International Workshop on Security in Cloud Computing, SCC@ASIACCS 2015, Singapore, Republic of Singapore, 14 April 2015, pp. 13\u201319. ACM (2015). https:\/\/doi.org\/10.1145\/2732516.2732520","DOI":"10.1145\/2732516.2732520"},{"key":"6_CR15","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption over the torus. Cryptology ePrint Archive, Paper 2018\/421 (2018). https:\/\/eprint.iacr.org\/2018\/421"},{"key":"6_CR16","unstructured":"Cho, J., et al.: Transciphering framework for approximate homomorphic encryption (full version). Cryptology ePrint Archive, Paper 2020\/1335 (2020). https:\/\/eprint.iacr.org\/2020\/1335"},{"key":"6_CR17","unstructured":"Cryptography: NIST lightweight cryptography. https:\/\/csrc.nist.gov\/Projects\/Lightweight"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Daemen, J., Hoffert, S., Peeters, M., Assche, G.V., Keer, R.V.: Xoodyak and a lightweight cryptographic scheme (2020)","DOI":"10.46586\/tosc.v2020.iS1.60-87"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"Ivan Bjerre Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, Ivan Bjerre: A design principle for hash functions. In: Brassard, Gilles (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 416\u2013427. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_39"},{"key":"6_CR20","unstructured":"Dobraunig, C., Grassi, L., Helminger, L., Rechberger, C., Schofnegger, M., Walch, R.: Pasta: a case for hybrid homomorphic encryption. Cryptology ePrint Archive, Paper 2021\/731 (2021). https:\/\/eprint.iacr.org\/2021\/731"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-03317-9_6","volume-title":"Fast Software Encryption","author":"E Fleischmann","year":"2009","unstructured":"Fleischmann, E., Gorski, M., Lucks, S.: On the security of TANDEM-DM. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol. 5665, pp. 84\u2013103. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03317-9_6"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-10868-6_10","volume-title":"Cryptography and Coding","author":"E Fleischmann","year":"2009","unstructured":"Fleischmann, E., Gorski, M., Lucks, S.: Security of cyclic double block length hash functions. In: Parker, M.G. (ed.) IMACC 2009. LNCS, vol. 5921, pp. 153\u2013175. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10868-6_10"},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Freitas, L., et al.: Homomorphic sortition - secret leader election for blockchain (2022). https:\/\/doi.org\/10.48550\/ARXIV.2206.11519, https:\/\/arxiv.org\/abs\/2206.11519","DOI":"10.48550\/ARXIV.2206.11519"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-030-16458-4_5","volume-title":"Codes, Cryptology and Information Security","author":"M Hell","year":"2019","unstructured":"Hell, M., Johansson, T., Meier, W., S\u00f6nnerup, J., Yoshida, H.: An AEAD variant of the grain stream cipher. In: Carlet, C., Guilley, S., Nitaj, A., Souidi, E.M. (eds.) C2SI 2019. LNCS, vol. 11445, pp. 55\u201371. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16458-4_5"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/11496618_24","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"S Hirose","year":"2005","unstructured":"Hirose, S.: Provably secure double-block-length hash functions in a black-box model. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 330\u2013342. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496618_24"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-030-65277-7_3","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2020","author":"C Hoffmann","year":"2020","unstructured":"Hoffmann, C., M\u00e9aux, P., Ricosset, T.: Transciphering, using FiLIP and TFHE for an efficient delegation of computation. In: Bhargavan, K., Oswald, E., Prabhakaran, M. (eds.) INDOCRYPT 2020. LNCS, vol. 12578, pp. 39\u201361. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65277-7_3"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-28914-9_17","volume-title":"Theory of Cryptography","author":"D Jetchev","year":"2012","unstructured":"Jetchev, D., \u00d6zen, O., Stam, M.: Collisions are not incidental: a compression function exploiting discrete geometry. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 303\u2013320. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_17"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-47555-9_5","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 92","author":"X Lai","year":"1993","unstructured":"Lai, X., Massey, J.L.: Hash functions based on block ciphers. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 55\u201370. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-47555-9_5"},{"key":"6_CR29","unstructured":"Lee, J., Kwon, D.: The security of Abreast-DM in the ideal cipher model. Cryptology ePrint Archive, Paper 2009\/225 (2009). https:\/\/eprint.iacr.org\/2009\/225"},{"key":"6_CR30","unstructured":"Lei, D., Lin, D., Chao, L., Feng, K., Qu, L.: The design principle of hash function with Merkle-Damg\u00e5rd construction. Cryptology ePrint Archive, Paper 2006\/135 (2006). https:\/\/eprint.iacr.org\/2006\/135"},{"key":"6_CR31","doi-asserted-by":"publisher","unstructured":"Luby, M.: Pseudorandomness and Cryptographic Applications (1996). https:\/\/doi.org\/10.2307\/j.ctvs32rpn","DOI":"10.2307\/j.ctvs32rpn"},{"key":"6_CR32","unstructured":"Mennink, B.: On the collision and preimage security of MDC-4 in the ideal cipher model. Cryptology ePrint Archive, Paper 2012\/113 (2012). https:\/\/eprint.iacr.org\/2012\/113"},{"key":"6_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/0-387-34805-0_40","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: One way hash functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 428\u2013446. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_40"},{"key":"6_CR34","doi-asserted-by":"publisher","unstructured":"Preneel, B.: MDC-2 and MDC-4. In: van Tilborg, H.C.A., Jajodia, S. (eds.) Encyclopedia of Cryptography and Security, pp. 771\u2013772. Springer, Boston, MA (2011). https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_596","DOI":"10.1007\/978-1-4419-5906-5_596"},{"key":"6_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-48329-2_31","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"B Preneel","year":"1994","unstructured":"Preneel, B., Govaerts, R., Vandewalle, J.: Hash functions based on block ciphers: a synthetic approach. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 368\u2013378. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_31"},{"key":"6_CR36","unstructured":"Quero, N.: Etude des fonctions de hachage homomorphes pour un protocole d\u2019\u00e9lection secr\u00e8te pour la blockchain (2022). Internship report. REF: LIST\/DSCIN\/21-0189\/NQ"},{"key":"6_CR37","unstructured":"de Souza, L.F., Tucci Piergiovanni, S., Sirdey, R., Stan, O., Quero, N., Kuznetsov, P.: Randsolomon: optimally resilient multi-party random number generation protocol. CoRR abs\/2109.04911 (2021). https:\/\/arxiv.org\/abs\/2109.04911"},{"key":"6_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-22792-9_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"J Guo","year":"2011","unstructured":"Guo, J., Peyrin, T., Poschmann, A.: The PHOTON family of lightweight hash functions. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 222\u2013239. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_13"}],"container-title":["Lecture Notes in Computer Science","Foundations and Practice of Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30122-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T07:08:33Z","timestamp":1680246513000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30122-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031301216","9783031301223"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30122-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FPS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Foundations and Practice of Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fps2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.fps-2022.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}