{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T06:59:31Z","timestamp":1777964371618,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":45,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819609345","type":"print"},{"value":"9789819609352","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0935-2_10","type":"book-chapter","created":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T18:01:28Z","timestamp":1733680888000},"page":"302-334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["HELIOPOLIS: Verifiable Computation over\u00a0Homomorphically Encrypted Data from\u00a0Interactive Oracle Proofs is Practical"],"prefix":"10.1007","author":[{"given":"Diego F.","family":"Aranha","sequence":"first","affiliation":[]},{"given":"Anamaria","family":"Costache","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Guimar\u00e3es","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Soria-Vazquez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Ahmad Al\u00a0Badawi, Jack Bates, Flavio Bergamaschi, David\u00a0Bruce Cousins, Saroja Erabelli, Nicholas Genise, Shai Halevi, Hamish Hunt, Andrey Kim, Yongwoo Lee, Zeyu Liu, Daniele Micciancio, Ian Quah, Yuriy Polyakov, Saraswathy R.V., Kurt Rohloff, Jonathan Saylor, Dmitriy Suponitsky, Matthew Triplett, Vinod Vaikuntanathan, and Vincent Zucca. OpenFHE: Open-Source Fully Homomorphic Encryption Library. In Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, WAHC\u201922, page 53-63, New York, NY, USA, 2022. Association for Computing Machinery.","DOI":"10.1145\/3560827.3563379"},{"key":"10_CR2","unstructured":"Diego\u00a0F. Aranha, Anamaria Costache, Antonio Guimar\u00e3es, and Eduardo Soria-Vazquez. HELIOPOLIS: Verifiable computation over homomorphically encrypted data from interactive oracle proofs is practical. Cryptology ePrint Archive, Paper 2023\/1949, 2023."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Gal Arnon, Alessandro Chiesa, and Eylon Yogev. IOPs with inverse polynomial soundness error. Cryptology ePrint Archive, 2023.","DOI":"10.1109\/FOCS57990.2023.00050"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Nuttapong Attrapadung, Goichiro Hanaoaka, Ryo Hiromasa, Yoshihiro Koseki, Takahiro Matsuda, Yutaro Nishida, Yusuke Sakai, Jacob C.\u00a0N. Schuldt, and Satoshi Yasuda. Privacy-preserving verifiable CNNs. In Christina P\u00f6pper and Lejla Batina, editors, Applied Cryptography and Network Security, pages 373\u2013402, Cham, 2024. Springer Nature Switzerland.","DOI":"10.1007\/978-3-031-54773-7_15"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Martin\u00a0R Albrecht, Rachel Player, and Sam Scott. On the concrete hardness of learning with errors. Journal of Mathematical Cryptology, 9(3):169\u2013203, 2015.","DOI":"10.1515\/jmc-2015-0016"},{"key":"10_CR6","unstructured":"Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. Fast reed-solomon interactive oracle proofs of proximity. In Ioannis Chatzigiannakis, Christos Kaklamanis, D\u00e1niel Marx, and Donald Sannella, editors, ICALP 2018, volume 107 of LIPIcs, pages 14:1\u201314:17. Schloss Dagstuhl, July 2018."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Fabian Boemer, Anamaria Costache, Rosario Cammarota, and Casimir Wierzynski. nGraph-HE2: A high-throughput framework for neural network inference on encrypted data. In Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography, pages 45\u201356, 2019.","DOI":"10.1145\/3338469.3358944"},{"key":"10_CR8","series-title":"Part II, volume 12711 of LNCS","first-page":"528","volume-title":"PKC 2021","author":"Alexandre Bois","year":"2021","unstructured":"Alexandre Bois, Ignacio Cascudo, Dario Fiore, and Dongwoo Kim. Flexible and efficient verifiable computation on encrypted data. In Juan Garay, editor, PKC\u00a02021, Part\u00a0II, volume 12711 of LNCS, pages 528\u2013558. Springer, Heidelberg, May 2021."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, and Shubhangi Saraf. Proximity gaps for reed-solomon codes. In 61st FOCS, pages 900\u2013909. IEEE Computer Society Press, November 2020.","DOI":"10.1109\/FOCS46700.2020.00088"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, and Nicholas\u00a0P. Ward. Aurora: Transparent succinct arguments for R1CS. In Yuval Ishai and Vincent Rijmen, editors, EUROCRYPT\u00a02019, Part\u00a0I, volume 11476 of LNCS, pages 103\u2013128. Springer, Heidelberg, May 2019.","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, and Nicholas Spooner. Interactive oracle proofs. In Martin Hirt and Adam\u00a0D. Smith, editors, TCC\u00a02016-B, Part\u00a0II, volume 9986 of LNCS, pages 31\u201360. Springer, Heidelberg, October\u00a0\/\u00a0November 2016.","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"10_CR12","unstructured":"Alon Brutzkus, Ran Gilad-Bachrach, and Oren Elisha. Low latency privacy preserving inference. In International Conference on Machine Learning, pages 812\u2013821. PMLR, 2019."},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Alexander\u00a0R. Block, Albert Garreta, Jonathan Katz, Justin Thaler, Pratyush\u00a0Ranjan Tiwari, and Micha\u0142 Zaj\u0105c. Fiat-Shamir Security of FRI and Related SNARKs. In Jian Guo and Ron Steinfeld, editors, Advances in Cryptology \u2013 ASIACRYPT 2023, pages 3\u201340, Singapore, 2023. Springer Nature Singapore.","DOI":"10.1007\/978-981-99-8724-5_1"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. (Leveled) fully homomorphic encryption without bootstrapping. In Shafi Goldwasser, editor, ITCS 2012, pages 309\u2013325. ACM, January 2012.","DOI":"10.1145\/2090236.2090262"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Fabian Boemer, Sejun Kim, Gelila Seifu, Fillipe D.M.\u00a0de Souza, and Vinodh Gopal. Intel HEXL: Accelerating Homomorphic Encryption with Intel AVX512-IFMA52. In Proceedings of the 9th on Workshop on Encrypted Computing & Applied Homomorphic Cryptography, WAHC \u201921, page 57-62, New York, NY, USA, 2021. Association for Computing Machinery.","DOI":"10.1145\/3474366.3486926"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Florian Bourse, Michele Minelli, Matthias Minihold, and Pascal Paillier. Fast homomorphic evaluation of deep discretized neural networks. In Hovav Shacham and Alexandra Boldyreva, editors, CRYPTO\u00a02018, Part\u00a0III, volume 10993 of LNCS, pages 483\u2013512. Springer, Heidelberg, August 2018.","DOI":"10.1007\/978-3-319-96878-0_17"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Zvika Brakerski. Fully homomorphic encryption without modulus switching from classical GapSVP. In Reihaneh Safavi-Naini and Ran Canetti, editors, CRYPTO\u00a02012, volume 7417 of LNCS, pages 868\u2013886. Springer, Heidelberg, August 2012.","DOI":"10.1007\/978-3-642-32009-5_50"},{"issue":"2","key":"10_CR18","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Zvika Brakerski","year":"2014","unstructured":"Zvika Brakerski and Vinod Vaikuntanathan. Efficient fully homomorphic encryption from (standard) LWE. SIAM Journal on computing, 43(2):831\u2013871, 2014.","journal-title":"SIAM Journal on computing"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy\u00a0N. Rothblum, Ron\u00a0D. Rothblum, and Daniel Wichs. Fiat-Shamir: from practice to theory. In Moses Charikar and Edith Cohen, editors, 51st ACM STOC, pages 1082\u20131090. ACM Press, June 2019.","DOI":"10.1145\/3313276.3316380"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Ran Canetti, Asaf Cohen, and Yehuda Lindell. A simpler variant of universally composable security for standard multiparty computation. In Rosario Gennaro and Matthew J.\u00a0B. Robshaw, editors, CRYPTO\u00a02015, Part\u00a0II, volume 9216 of LNCS, pages 3\u201322. Springer, Heidelberg, August 2015.","DOI":"10.1007\/978-3-662-48000-7_1"},{"key":"10_CR21","unstructured":"Eleanor Chu and Alan George. Inside the FFT Black Box: Serial and Parallel Fast Fourier Transform Algorithms. CRC Press, November 1999. Google-Books-ID: 30S3kRiX4xgC."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabach\u00e8ne. TFHE: Fast fully homomorphic encryption over the torus. Journal of Cryptology, 33(1):34\u201391, January 2020.","DOI":"10.1007\/s00145-019-09319-x"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Jung\u00a0Hee Cheon, Andrey Kim, Miran Kim, and Yong\u00a0Soo Song. Homomorphic encryption for arithmetic of approximate numbers. In Tsuyoshi Takagi and Thomas Peyrin, editors, ASIACRYPT\u00a02017, Part\u00a0I, volume 10624 of LNCS, pages 409\u2013437. Springer, Heidelberg, December 2017.","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, and Samuel Tap. Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE. In Mehdi Tibouchi and Huaxiong Wang, editors, ASIACRYPT\u00a02021, Part\u00a0III, volume 13092 of LNCS, pages 670\u2013699. Springer, Heidelberg, December 2021.","DOI":"10.1007\/978-3-030-92078-4_23"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Alessandro Chiesa, Peter Manohar, and Nicholas Spooner. Succinct arguments in the quantum random oracle model. In Dennis Hofheinz and Alon Rosen, editors, TCC\u00a02019, Part\u00a0II, volume 11892 of LNCS, pages 1\u201329. Springer, Heidelberg, December 2019.","DOI":"10.1007\/978-3-030-36033-7_1"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Alessandro Chiesa, Dev Ojha, and Nicholas Spooner. Fractal: Post-quantum and transparent recursive proofs from holography. In Anne Canteaut and Yuval Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0I, volume 12105 of LNCS, pages 769\u2013793. Springer, Heidelberg, May 2020.","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Benjamin\u00a0R Curtis and Rachel Player. On the feasibility and impact of standardising sparse-secret LWE parameter sets for homomorphic encryption. In Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography, pages 1\u201310, 2019.","DOI":"10.1145\/3338469.3358940"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Dana Dachman-Soled, L\u00e9o Ducas, Huijing Gong, and M\u00e9lissa Rossi. LWE with side information: Attacks and concrete security estimation. In Daniele Micciancio and Thomas Ristenpart, editors, CRYPTO\u00a02020, Part\u00a0II, volume 12171 of LNCS, pages 329\u2013358. Springer, Heidelberg, August 2020.","DOI":"10.1007\/978-3-030-56880-1_12"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd, Valerio Pastro, Nigel\u00a0P. Smart, and Sarah Zakarias. Multiparty computation from somewhat homomorphic encryption. In Reihaneh Safavi-Naini and Ran Canetti, editors, CRYPTO\u00a02012, volume 7417 of LNCS, pages 643\u2013662. Springer, Heidelberg, August 2012.","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Dario Fiore, Rosario Gennaro, and Valerio Pastro. Efficiently verifiable computation on encrypted data. In Gail-Joon Ahn, Moti Yung, and Ninghui Li, editors, ACM CCS 2014, pages 844\u2013855. ACM Press, November 2014.","DOI":"10.1145\/2660267.2660366"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Dario Fiore, Anca Nitulescu, and David Pointcheval. Boosting verifiable computation on encrypted data. In Aggelos Kiayias, Markulf Kohlweiss, Petros Wallden, and Vassilis Zikas, editors, PKC\u00a02020, Part\u00a0II, volume 12111 of LNCS, pages 124\u2013154. Springer, Heidelberg, May 2020.","DOI":"10.1007\/978-3-030-45388-6_5"},{"key":"10_CR32","unstructured":"Junfeng Fan and Frederik Vercauteren. Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144, 2012. https:\/\/eprint.iacr.org\/2012\/144."},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Antonio Guimar\u00e3es, Edson Borin, and Diego\u00a0F. Aranha. MOSFHET: Optimized Software for FHE over the Torus. Journal of Cryptographic Engineering, July 2024.","DOI":"10.1007\/s13389-024-00359-z"},{"key":"10_CR34","unstructured":"Craig Gentry. A fully homomorphic encryption scheme. PhD thesis, Stanford University, 2009. crypto.stanford.edu\/craig."},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Craig Gentry. Fully homomorphic encryption using ideal lattices. In Michael Mitzenmacher, editor, 41st ACM STOC, pages 169\u2013178. ACM Press, May\u00a0\/\u00a0June 2009.","DOI":"10.1145\/1536414.1536440"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro, Craig Gentry, and Bryan Parno. Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In Tal Rabin, editor, CRYPTO\u00a02010, volume 6223 of LNCS, pages 465\u2013482. Springer, Heidelberg, August 2010.","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"10_CR37","unstructured":"Sanjam Garg, Aarushi Goel, and Mingyuan Wang. How to prove statements obliviously? Cryptology ePrint Archive, Paper 2023\/1609, 2023. https:\/\/eprint.iacr.org\/2023\/1609."},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or A completeness theorem for protocols with honest majority. In Alfred Aho, editor, 19th ACM STOC, pages 218\u2013229. ACM Press, May 1987.","DOI":"10.1145\/28395.28420"},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"Chaya Ganesh, Anca Nitulescu, and Eduardo Soria-Vazquez. Rinocchio: SNARKs for ring arithmetic. Journal of Cryptology, 36(4):41, October 2023.","DOI":"10.1007\/s00145-023-09481-3"},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"Antonio Guimar\u00e3es, Hilder V.\u00a0L. Pereira, and Barry van Leeuwen. Amortized bootstrapping revisited: Simpler, asymptotically-faster, implemented. In Jian Guo and Ron Steinfeld, editors, Advances in Cryptology \u2013 ASIACRYPT 2023, pages 3\u201335, Singapore, 2023. Springer Nature Singapore.","DOI":"10.1007\/978-981-99-8736-8_1"},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Sergey Gorbunov, Vinod Vaikuntanathan, and Daniel Wichs. Leveled fully homomorphic signatures from standard lattices. In Rocco\u00a0A. Servedio and Ronitt Rubinfeld, editors, 47th ACM STOC, pages 469\u2013477. ACM Press, June 2015.","DOI":"10.1145\/2746539.2746576"},{"key":"10_CR42","unstructured":"Ulrich Hab\u00f6ck. A summary on the fri low degree test. Cryptology ePrint Archive, Paper 2022\/1216, 2022. https:\/\/eprint.iacr.org\/2022\/1216."},{"key":"10_CR43","unstructured":"Shai Halevi and Victor Shoup. Design and implementation of HElib: a homomorphic encryption library. Cryptology ePrint Archive, Report 2020\/1481, 2020. https:\/\/eprint.iacr.org\/2020\/1481."},{"key":"10_CR44","unstructured":"Szepieniec et\u00a0al. Anatomy of a stark - tutorial for starks with supporting code in python, November 2021. https:\/\/github.com\/aszepieniec\/stark-anatomy"},{"issue":"1","key":"10_CR45","first-page":"57","volume":"71","author":"Nigel P Smart","year":"2014","unstructured":"Nigel\u00a0P. Smart and Frederik Vercauteren. Fully homomorphic SIMD operations. DCC, 71(1):57\u201381, 2014.","journal-title":"Fully homomorphic SIMD operations. DCC"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0935-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T18:02:31Z","timestamp":1733680951000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0935-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,9]]},"ISBN":["9789819609345","9789819609352"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0935-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,9]]},"assertion":[{"value":"9 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}