{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T17:30:46Z","timestamp":1777570246133,"version":"3.51.4"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031346705","type":"print"},{"value":"9783031346712","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-34671-2_9","type":"book-chapter","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T23:02:58Z","timestamp":1687302178000},"page":"117-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Building Blocks for\u00a0LSTM Homomorphic Evaluation with\u00a0TFHE"],"prefix":"10.1007","author":[{"given":"Daphn\u00e9","family":"Trama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Emmanuel","family":"Clet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aymen","family":"Boudguiga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renaud","family":"Sirdey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,21]]},"reference":[{"key":"9_CR1","unstructured":"Aharoni, E., et al.: Tile tensors: a versatile data structure with descriptive shapes for homomorphic encryption. CoRR abs\/2011.01805 (2020). arXiv:2011.01805"},{"key":"9_CR2","unstructured":"Bourse, F., Minelli, M., Minihold, M., Paillier, P.: Fast homomorphic evaluation of deep discretized neural networks. Technical Report Report 2017\/1114, IACR Cryptology ePrint Archive (2017). https:\/\/hal.science\/hal-01665330"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology - CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology - CRYPTO 2012, pp. 868\u2013886. Springer, Berlin (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 309\u2013325. ITCS \u201912, Association for Computing Machinery, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"key":"9_CR5","unstructured":"Carpov, S., Izabach\u00e8ne, M., Mollimard, V.: New techniques for multi-value input homomorphic evaluation and applications. Cryptology ePrint Archive, Paper 2018\/622 (2018). https:\/\/eprint.iacr.org\/2018\/622"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Chabanne, H., Lescuyer, R., Milgram, J., Morel, C., Prouff, E.: Recognition over encrypted faces: 4th International Conference, MSPN 2018, Paris (2019)","DOI":"10.1007\/978-3-030-03101-5_16"},{"key":"9_CR7","unstructured":"Chabanne, H., de Wargny, A., Milgram, J., Morel, C., Prouff, E.: Privacy-preserving classification on deep neural network. Cryptology ePrint Archive, Report 2017\/035 (2017)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers (2017)","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"9_CR9","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption library (2016). https:\/\/tfhe.github.io\/tfhe\/"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Chillotti, I., Joye, M., Paillier, P.: Programmable bootstrapping enables efficient homomorphic inference of deep neural networks. Cryptology ePrint Archive, Paper 2021\/091 (2021). https:\/\/doi.org\/10.1007\/978-3-030-78086-91, https:\/\/eprint.iacr.org\/2021\/091","DOI":"10.1007\/978-3-030-78086-91"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-78086-9_1","volume-title":"Cyber Security Cryptography and Machine Learning","author":"I Chillotti","year":"2021","unstructured":"Chillotti, I., Joye, M., Paillier, P.: Programmable bootstrapping enables efficient homomorphic inference of deep neural networks. In: Dolev, S., Margalit, O., Pinkas, B., Schwarzmann, A. (eds.) Cyber Security Cryptography and Machine Learning, pp. 1\u201319. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78086-9_1"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Chillotti, I., Ligier, D., Orfila, J.B., Tap, S.: Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE. Cryptology ePrint Archive, Report 2021\/729 (2021), https:\/\/ia.cr\/2021\/729","DOI":"10.1007\/978-3-030-92078-4_23"},{"key":"9_CR13","unstructured":"Clet, P.E., Zuber, M., Boudguiga, A., Sirdey, R., Gouy-Pailler, C.: Putting up the swiss army knife of homomorphic calculations by means of tfhe functional bootstrapping. Cryptology ePrint Archive, Paper 2022\/149 (2022). https:\/\/eprint.iacr.org\/2022\/149"},{"key":"9_CR14","unstructured":"Dowlin, N., Gilad-Bachrach, R., Laine, K., Lauter, K., Naehrig, M., Wernsing, J.: Cryptonets: applying neural networks to encrypted data with high throughput and accuracy (2016), https:\/\/www.microsoft.com\/en-us\/research\/publication\/cryptonets-applying-neural-networks-to-encrypted-data-with-high-throughput-and-accuracy\/"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Dua, M., Yadav, R., Mamgai, D., Brodiya, S.: An improved RNN-LSTM based novel approach for sheet music generation (2020). https:\/\/doi.org\/10.1016\/j.procs.2020.04.049","DOI":"10.1016\/j.procs.2020.04.049"},{"key":"9_CR16","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012). https:\/\/ia.cr\/2012\/144"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Guimar\u00e3es, A., Borin, E., Aranha, D.F.: Revisiting the functional bootstrap in TFHE. IACR Transactions on Cryptographic Hardware and Embedded Systems 2021(2), 229\u2013253 (2021). 10.46586\/tches.v2021.i2.229-253","DOI":"10.46586\/tches.v2021.i2.229-253"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Hochreiter, Jurgen, S.: Long short-term memory. Neural computation 9(8), 1735\u20131780 (1997)","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-030-31578-8_2","volume-title":"Cryptology and Network Security","author":"M Izabach\u00e8ne","year":"2019","unstructured":"Izabach\u00e8ne, M., Sirdey, R., Zuber, M.: Practical fully homomorphic encryption for fully masked neural networks. In: Mu, Y., Deng, R.H., Huang, X. (eds.) Cryptology and Network Security, pp. 24\u201336. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31578-8_2"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Jang, J., et al.: Privacy-preserving deep sequential model with matrix homomorphic encryption. In: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security, pp. 377\u2013391. ASIA CCS \u201922, Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3488932.3523253","DOI":"10.1145\/3488932.3523253"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Kim, M., Song, Y., Wang, S., Xia, Y., Jiang, X.: Secure logistic regression based on homomorphic encryption: design and evaluation. In: JMIR Medical Informatics (2018)","DOI":"10.2196\/preprints.8805"},{"key":"9_CR22","unstructured":"Kluczniak, K., Schild, L.: FDFB: full domain functional bootstrapping towards practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2021\/1135 (2021). https:\/\/ia.cr\/2021\/1135"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Lev, G., Sadeh, G., Klein, B., Wolf, L.: RNN fisher vectors for action recognition and image annotation (2015)","DOI":"10.1007\/978-3-319-46466-4_50"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Madi, A., Sirdey, R., Stan, O.: Computing neural networks with homomorphic encryption and verifiable computing. In: ACNS Workshops (2020)","DOI":"10.1007\/978-3-030-61638-0_17"},{"key":"9_CR25","unstructured":"OPenAI: Chatgpt: optimizing language models for dialogue (2022). https:\/\/openai.com\/blog\/chatgpt\/"},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"132084","DOI":"10.1109\/ACCESS.2021.3114581","volume":"9","author":"J Paul","year":"2021","unstructured":"Paul, J., Annamalai, M.S.M.S., Ming, W., Badawi, A.A., Veeravalli, B., Aung, K.M.M.: Privacy-preserving collective learning with homomorphic encryption. IEEE Access 9, 132084\u2013132096 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3114581","journal-title":"IEEE Access"},{"key":"9_CR27","unstructured":"Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with clip latents. arXiv:2204.06125"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Syed, S.A., Rashid, M., Hussain, S., Zahid, H.: Comparative analysis of CNN and RNN for voice pathology detection. BioMed Research International 2021 (2021)","DOI":"10.1155\/2021\/6635964"},{"key":"9_CR29","unstructured":"Woodbridge, J., Anderson, H.S., Ahuja, A., Grant, D.: Predicting domain genreation algorithms with long short-term memory networks (2016)"},{"key":"9_CR30","unstructured":"Yang, Z., Xie, X., Shen, H., Chen, S., Zhou, J.: Tota: fully homomorphic encryption with smaller parameters and stronger security. Cryptology ePrint Archive, Report 2021\/1347 (2021). https:\/\/ia.cr\/2021\/1347"}],"container-title":["Lecture Notes in Computer Science","Cyber Security, Cryptology, and Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34671-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:19:36Z","timestamp":1710332376000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34671-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031346705","9783031346712"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34671-2_9","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":"21 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSCML","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Cyber Security, Cryptology, and Machine Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Be'er Sheva","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cscml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cscml.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70","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":"21","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":"15","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":"30% - 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":"4","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":"5","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)"}}]}}