{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:01:46Z","timestamp":1777964506889,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC","award":["742754 (NTSC)"],"award-info":[{"award-number":["742754 (NTSC)"]}]},{"name":"European Research Council under the ERC consolidators","award":["615172 (HIPS)"],"award-info":[{"award-number":["615172 (HIPS)"]}]},{"name":"ISF","award":["1316\/18"],"award-info":[{"award-number":["1316\/18"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3354258","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"327-344","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["LevioSA"],"prefix":"10.1145","author":[{"given":"Carmit","family":"Hazay","sequence":"first","affiliation":[{"name":"Bar-Ilan University, Ramat-Gan, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Marcedone","sequence":"additional","affiliation":[{"name":"Keybase Inc, New-York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[{"name":"University of Rochester, Rochester, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Benny Applebaum Ivan Damg\u00e5rd Yuval Ishai Michael Nielsen and Lior Zichron. 2017a. Secure Arithmetic Computation with Constant Computational Overhead. In CRYPTO. 223--254.  Benny Applebaum Ivan Damg\u00e5rd Yuval Ishai Michael Nielsen and Lior Zichron. 2017a. Secure Arithmetic Computation with Constant Computational Overhead. In CRYPTO. 223--254.","DOI":"10.1007\/978-3-319-63688-7_8"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Benny Applebaum Ivan Damg\u00e5rd Yuval Ishai Michael Nielsen and Lior Zichron. 2017b. Secure Arithmetic Computation with Constant Computational Overhead. In CRYPTO. 223--254.  Benny Applebaum Ivan Damg\u00e5rd Yuval Ishai Michael Nielsen and Lior Zichron. 2017b. Secure Arithmetic Computation with Constant Computational Overhead. In CRYPTO. 223--254.","DOI":"10.1007\/978-3-319-63688-7_8"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or Shafi Goldwasser and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In STOC. 1--10.  Michael Ben-Or Shafi Goldwasser and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In STOC. 1--10.","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Rikke Bendlin Ivan Damg\u00e5rd Claudio Orlandi and Sarah Zakarias. 2011. Semi-homomorphic Encryption and Multiparty Computation. In EUROCRYPT. 169--188.  Rikke Bendlin Ivan Damg\u00e5rd Claudio Orlandi and Sarah Zakarias. 2011. Semi-homomorphic Encryption and Multiparty Computation. In EUROCRYPT. 169--188.","DOI":"10.1007\/978-3-642-20465-4_11"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Fabrice Benhamouda Akshay Degwekar Yuval Ishai and Tal Rabin. 2018. On the Local Leakage Resilience of Linear Secret Sharing Schemes. In Advances CRYPTO. 531--561.  Fabrice Benhamouda Akshay Degwekar Yuval Ishai and Tal Rabin. 2018. On the Local Leakage Resilience of Linear Secret Sharing Schemes. In Advances CRYPTO. 531--561.","DOI":"10.1007\/978-3-319-96884-1_18"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502094"},{"key":"e_1_3_2_2_8_1","volume-title":"Wright","author":"Canetti Ran","year":"2001"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Melissa Chase David Derler Steven Goldfeder Claudio Orlandi Sebastian Ramacher Christian Rechberger Daniel Slamanig and Greg Zaverucha. 2017. Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives. In CCS. 1825--1842.  Melissa Chase David Derler Steven Goldfeder Claudio Orlandi Sebastian Ramacher Christian Rechberger Daniel Slamanig and Greg Zaverucha. 2017. Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives. In CCS. 1825--1842.","DOI":"10.1145\/3133956.3133997"},{"key":"e_1_3_2_2_10_1","volume-title":"Jesper Buus Nielsen, and Tomas Toft","author":"Damg\u00e5rd Ivan","year":"2006"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Yuval Ishai. 2005. Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. In CRYPTO. 378--394.  Ivan Damg\u00e5rd and Yuval Ishai. 2005. Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. In CRYPTO. 378--394.","DOI":"10.1007\/11535218_23"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Yuval Ishai. 2006. Scalable Secure Multiparty Computation. In CRYPTO. 501--520.  Ivan Damg\u00e5rd and Yuval Ishai. 2006. Scalable Secure Multiparty Computation. In CRYPTO. 501--520.","DOI":"10.1007\/11818175_30"},{"key":"e_1_3_2_2_13_1","volume-title":"Smart, and Sarah Zakarias","author":"Damg\u00e5rd Ivan","year":"2012"},{"key":"e_1_3_2_2_14_1","unstructured":"Leo de Castro Chiraag Juvekar and Vinod Vaikuntanathan. [n.d.]. Lightweight OLE implementation based on the LWE Assumption. Personal Communication.  Leo de Castro Chiraag Juvekar and Vinod Vaikuntanathan. [n.d.]. Lightweight OLE implementation based on the LWE Assumption. Personal Communication."},{"key":"e_1_3_2_2_15_1","volume-title":"Tobias Nilges, and Roberto Trifiletti.","author":"Nico D\u00f6","year":"2017"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-018-9284-1"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Zekeriya Erkin Martin Franz Jorge Guajardo Stefan Katzenbeisser Inald Lagendijk and Tomas Toft. 2009. Privacy-Preserving Face Recognition. In PETS. 235--253.  Zekeriya Erkin Martin Franz Jorge Guajardo Stefan Katzenbeisser Inald Lagendijk and Tomas Toft. 2009. Privacy-Preserving Face Recognition. In PETS. 235--253.","DOI":"10.1007\/978-3-642-03168-7_14"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Yair Frankel Philip D. MacKenzie and Moti Yung. 1998. Robust Efficient Distributed RSA-Key Generation. In STOC. 663--672.  Yair Frankel Philip D. MacKenzie and Moti Yung. 1998. Robust Efficient Distributed RSA-Key Generation. In STOC. 663--672.","DOI":"10.1145\/276698.276882"},{"key":"e_1_3_2_2_19_1","volume-title":"Franklin and Moti Yung","author":"Matthew","year":"1992"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Tore Kasper Frederiksen Benny Pinkas and Avishay Yanai. 2018. Committed MPC - Maliciously Secure Multiparty Computation from Homomorphic Commitments. In PKC. 587--619.  Tore Kasper Frederiksen Benny Pinkas and Avishay Yanai. 2018. Committed MPC - Maliciously Secure Multiparty Computation from Homomorphic Commitments. In PKC. 587--619.","DOI":"10.1007\/978-3-319-76578-5_20"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Daniel Genkin Yuval Ishai Manoj Prabhakaran Amit Sahai and Eran Tromer. 2014. Circuits resilient to additive attacks with applications to secure computation. In STOC. 495--504.  Daniel Genkin Yuval Ishai Manoj Prabhakaran Amit Sahai and Eran Tromer. 2014. Circuits resilient to additive attacks with applications to secure computation. In STOC. 495--504.","DOI":"10.1145\/2591796.2591861"},{"key":"e_1_3_2_2_22_1","unstructured":"Zahra Ghodsi Tianyu Gu and Siddharth Garg. 2017. SafetyNets: Verifiable Execution of Deep Neural Networks on an Untrusted Cloud. In NIPS. 4675--4684.  Zahra Ghodsi Tianyu Gu and Siddharth Garg. 2017. SafetyNets: Verifiable Execution of Deep Neural Networks on an Untrusted Cloud. In NIPS. 4675--4684."},{"key":"e_1_3_2_2_23_1","volume-title":"Jesper Buus Nielsen, and Tobias Nilges","author":"Ghosh Satrajit","year":"2017"},{"key":"e_1_3_2_2_24_1","unstructured":"Irene Giacomelli Jesper Madsen and Claudio Orlandi. 2016. ZKBoo: Faster Zero-Knowledge for Boolean Circuits. In USENIX. 1069--1083.  Irene Giacomelli Jesper Madsen and Claudio Orlandi. 2016. ZKBoo: Faster Zero-Knowledge for Boolean Circuits. In USENIX. 1069--1083."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Niv Gilboa. 1999. Two Party RSA Key Generation. In CRYPTO. 116--129.  Niv Gilboa. 1999. Two Party RSA Key Generation. In CRYPTO. 116--129.","DOI":"10.1007\/3-540-48405-1_8"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich Silvio Micali and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In STOC. 218--229.  Oded Goldreich Silvio Micali and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In STOC. 218--229.","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_27_1","volume-title":"Efficient Secure Two-Party Protocols - Techniques and Constructions","author":"Hazay Carmit"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Eyal Kushilevitz Rafail Ostrovsky Manoj Prabhakaran Amit Sahai and J\u00fc rg Wullschleger. 2011. Constant-Rate Oblivious Transfer from Noisy Channels. In CRYPTO. 667--684.  Yuval Ishai Eyal Kushilevitz Rafail Ostrovsky Manoj Prabhakaran Amit Sahai and J\u00fc rg Wullschleger. 2011. Constant-Rate Oblivious Transfer from Noisy Channels. In CRYPTO. 667--684.","DOI":"10.1007\/978-3-642-22792-9_38"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/080725398"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Manoj Prabhakaran and Amit Sahai. 2008. Founding Cryptography on Oblivious Transfer - Efficiently. In CRYPTO. 572--591.  Yuval Ishai Manoj Prabhakaran and Amit Sahai. 2008. Founding Cryptography on Oblivious Transfer - Efficiently. In CRYPTO. 572--591.","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Manoj Prabhakaran and Amit Sahai. 2009b. Secure Arithmetic Computation with No Honest Majority. In TCC. 294--314.  Yuval Ishai Manoj Prabhakaran and Amit Sahai. 2009b. Secure Arithmetic Computation with No Honest Majority. In TCC. 294--314.","DOI":"10.1007\/978-3-642-00457-5_18"},{"key":"e_1_3_2_2_33_1","volume-title":"GAZELLE: A Low Latency Framework for Secure Neural Network Inference. In USENIX. 1651--1669.","author":"Juvekar Chiraag","year":"2018"},{"key":"e_1_3_2_2_34_1","first-page":"475","article-title":"Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures","volume":"2018","author":"Katz Jonathan","year":"2018","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978357"},{"key":"e_1_3_2_2_36_1","volume-title":"Overdrive: Making SPDZ Great Again. In EUROCRYPT. 158--189.","author":"Keller Marcel","year":"2018"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Joe Kilian. 1988. Founding Cryptography on Oblivious Transfer. In STOC. 20--31.  Joe Kilian. 1988. Founding Cryptography on Oblivious Transfer. In STOC. 20--31.","DOI":"10.1145\/62212.62215"},{"key":"e_1_3_2_2_38_1","volume-title":"Fooling End-To-End Speaker Verification With Adversarial Examples. In IEEE International Conference on Acoustics, Speech and Signal Processing. 1962--1966","author":"Kreuk Felix","year":"2018"},{"key":"e_1_3_2_2_39_1","unstructured":"Benjamin Kreuter Abhi Shelat and Chih-Hao Shen. 2012. Billion-Gate Secure Computation with Malicious Adversaries. In USENIX. 285--300.  Benjamin Kreuter Abhi Shelat and Chih-Hao Shen. 2012. Billion-Gate Secure Computation with Malicious Adversaries. In USENIX. 285--300."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell Eli Oxman and Benny Pinkas. 2011. The IPS Compiler: Optimizations Variants and Concrete Efficiency. In CRYPTO. 259--276.  Yehuda Lindell Eli Oxman and Benny Pinkas. 2011. The IPS Compiler: Optimizations Variants and Concrete Efficiency. In CRYPTO. 259--276.","DOI":"10.1007\/978-3-642-22792-9_15"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-001-0019-2"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell and Benny Pinkas. 2007. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. In EUROCRYPT. 52--78.  Yehuda Lindell and Benny Pinkas. 2007. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. In EUROCRYPT. 52--78.","DOI":"10.1007\/978-3-540-72540-4_4"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Jian Liu Mika Juuti Yao Lu and N. Asokan. 2017. Oblivious Neural Network Predictions via MiniONN Transformations. In CCS. 619--631.  Jian Liu Mika Juuti Yao Lu and N. Asokan. 2017. Oblivious Neural Network Predictions via MiniONN Transformations. In CCS. 619--631.","DOI":"10.1145\/3133956.3134056"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky Chris Peikert and Oded Regev. 2010. On Ideal Lattices and Learning with Errors over Rings. In EUROCRYPT. 1--23.  Vadim Lyubashevsky Chris Peikert and Oded Regev. 2010. On Ideal Lattices and Learning with Errors over Rings. In EUROCRYPT. 1--23.","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Ueli M. Maurer Krzysztof Pietrzak and Renato Renner. 2007. Indistinguishability Amplification. In CRYPTO. 130--149.  Ueli M. Maurer Krzysztof Pietrzak and Renato Renner. 2007. Indistinguishability Amplification. In CRYPTO. 130--149.","DOI":"10.1007\/978-3-540-74143-5_8"},{"key":"e_1_3_2_2_46_1","volume-title":"Franklin","author":"Mohassel Payman","year":"2006"},{"key":"e_1_3_2_2_47_1","first-page":"403","article-title":"ABY3: A Mixed Protocol Framework for Machine Learning","volume":"2018","author":"Mohassel Payman","year":"2018","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_48_1","volume-title":"SecureML: A System for Scalable Privacy-Preserving Machine Learning. In IEEE Symposium on Security and Privacy. 19--38","author":"Mohassel Payman","year":"2017"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"crossref","unstructured":"Moni Naor and Benny Pinkas. 1999. Oblivious Transfer and Polynomial Evaluation. In STOC. 245--254.  Moni Naor and Benny Pinkas. 1999. Oblivious Transfer and Polynomial Evaluation. In STOC. 245--254.","DOI":"10.1145\/301250.301312"},{"key":"e_1_3_2_2_50_1","volume-title":"Claudio Orlandi, and Sai Sheshank Burra.","author":"Nielsen Jesper Buus","year":"2012"},{"key":"e_1_3_2_2_51_1","unstructured":"OSU-Crypto. 2013. libOTe. https:\/\/github.com\/osu-crypto\/libOTe .  OSU-Crypto. 2013. libOTe. https:\/\/github.com\/osu-crypto\/libOTe ."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"crossref","unstructured":"Guillaume Poupard and Jacques Stern. 1998. Generation of Shared RSA Keys by Two Parties. In ASIACRYPT. 11--24.  Guillaume Poupard and Jacques Stern. 1998. Generation of Shared RSA Keys by Two Parties. In ASIACRYPT. 11--24.","DOI":"10.1007\/3-540-49649-1_2"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196494.3196522"},{"key":"e_1_3_2_2_54_1","unstructured":"P. Rindal. 2013. Cryptotools. https:\/\/github.com\/ladnir\/cryptoTools .  P. Rindal. 2013. Cryptotools. https:\/\/github.com\/ladnir\/cryptoTools ."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_2_56_1","unstructured":"Victor Shoup. [n.d.]. NTL Library. http:\/\/www.shoup.net\/ntl\/.  Victor Shoup. [n.d.]. NTL Library. http:\/\/www.shoup.net\/ntl\/."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2016.7727230"},{"key":"e_1_3_2_2_58_1","volume-title":"SEALion: a Framework for Neural Network Inference on Encrypted Data. CoRR","author":"van Elsloo Tim","year":"2019"},{"key":"e_1_3_2_2_59_1","first-page":"442","article-title":"SecureNN: Efficient and Private Neural Network Training","volume":"2018","author":"Wagh Sameer","year":"2018","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Samuel Ranellucci and Jonathan Katz. 2017. Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation. In CCS. 21--37.  Xiao Wang Samuel Ranellucci and Jonathan Katz. 2017. Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation. In CCS. 21--37.","DOI":"10.1145\/3133956.3134053"},{"key":"e_1_3_2_2_61_1","unstructured":"Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract). In FOCS. 162--167.  Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract). In FOCS. 162--167."}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","location":"London United Kingdom","acronym":"CCS '19","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354258","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3354258","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:32Z","timestamp":1750203872000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354258"}},"subtitle":["Lightweight Secure Arithmetic Computation"],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":60,"alternative-id":["10.1145\/3319535.3354258","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3354258","relation":{},"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"2019-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}