{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:49:48Z","timestamp":1770900588914,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,19]],"date-time":"2023-11-19T00:00:00Z","timestamp":1700352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,19]]},"DOI":"10.1145\/3689945.3694808","type":"proceedings-article","created":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T18:23:11Z","timestamp":1732040591000},"page":"43-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Oraqle: A Depth-Aware Secure Computation Compiler"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3979-9740","authenticated-orcid":false,"given":"Jelle","family":"Vos","sequence":"first","affiliation":[{"name":"Delft University of Technology, Delft, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3612-1934","authenticated-orcid":false,"given":"Mauro","family":"Conti","sequence":"additional","affiliation":[{"name":"University of Padua & Delft University of Technology, Padua, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8932-4703","authenticated-orcid":false,"given":"Zekeriya","family":"Erkin","sequence":"additional","affiliation":[{"name":"Delft University of Technology, Delft, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,11,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--40186--3_15"},{"key":"e_1_3_2_1_2_1","unstructured":"Gilles Audemard and Laurent Simon. 2024. Glucose SAT Solver. https:\/\/github.com\/audemard\/glucose. Accessed: 2024-07--27."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--32009--5_50"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--78825--8_23"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00145-019-09319-X"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3474366.3486929"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454050"},{"key":"e_1_3_2_1_9_1","unstructured":"Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. (2012) 144. http:\/\/eprint.iacr.org\/2012\/144"},{"key":"e_1_3_2_1_10_1","volume-title":"HEIR: A compiler for homomorphic encryption. https:\/\/github.com\/google\/heir. Accessed: 2024-07--25.","year":"2024","unstructured":"Google. 2024. HEIR: A compiler for homomorphic encryption. https:\/\/github.com\/google\/heir. Accessed: 2024-07--25."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2023-0075"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2312.14250"},{"key":"e_1_3_2_1_13_1","unstructured":"Shai Halevi and Victor Shoup. 2020. Design and implementation of HElib: a homomorphic encryption library. IACR Cryptol. ePrint Arch. (2020) 1481. https:\/\/eprint.iacr.org\/2020\/1481"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","unstructured":"Alexey Ignatiev Antonio Morgado and Joao Marques-Silva. 2018. PySAT: A Python Toolkit for Prototyping with SAT Oracles. In SAT. 428--437. https:\/\/doi.org\/10.1007\/978--3--319--94144--8_26","DOI":"10.1007\/978--3--319--94144--8_26"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385996"},{"key":"e_1_3_2_1_16_1","unstructured":"Johannes Mono Chiara Marcolla Georg Land Tim G\u00fcneysu and Najwa Aaraj. 2022. Finding and Evaluating Parameters for BGV. Cryptology ePrint Archive Paper 2022\/706. https:\/\/eprint.iacr.org\/2022\/706 https:\/\/eprint.iacr.org\/2022\/706."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--10428--7_41"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202007"},{"key":"e_1_3_2_1_19_1","volume-title":"HECO: Fully Homomorphic Encryption Compiler. In 32nd USENIX Security Symposium, USENIX Security 2023","author":"Viand Alexander","year":"2023","unstructured":"Alexander Viand, Patrick Jattke, Miro Haller, and Anwar Hithnawi. 2023. HECO: Fully Homomorphic Encryption Compiler. In 32nd USENIX Security Symposium, USENIX Security 2023, Anaheim, CA, USA, August 9--11, 2023, Joseph A. Calandrino and Carmela Troncoso (Eds.). USENIX Association, 4715--4732. https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/viand"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00068"},{"key":"e_1_3_2_1_21_1","unstructured":"Jelle Vos Mauro Conti and Zekeriya Erkin. 2024. Depth-Aware Arithmetization of Common Primitives in Prime Fields. Cryptology ePrint Archive."},{"key":"e_1_3_2_1_22_1","unstructured":"Mingfei Yu and Giovanni De Micheli. 2024. Expediting Homomorphic Computation via Multiplicative Complexity-aware Multiplicative Depth Minimization. Cryptology ePrint Archive Paper 2024\/1015. https:\/\/eprint.iacr.org\/2024\/1015 https:\/\/eprint.iacr.org\/2024\/1015."}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 12th Workshop on Encrypted Computing & Applied Homomorphic Cryptography"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689945.3694808","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3689945.3694808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T18:43:32Z","timestamp":1755974612000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689945.3694808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,19]]},"references-count":22,"alternative-id":["10.1145\/3689945.3694808","10.1145\/3689945"],"URL":"https:\/\/doi.org\/10.1145\/3689945.3694808","relation":{},"subject":[],"published":{"date-parts":[[2023,11,19]]},"assertion":[{"value":"2024-11-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}