{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:17:19Z","timestamp":1766441839434,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3765225","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:32:38Z","timestamp":1763854358000},"page":"2249-2263","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["From OT to OLE with Subquadratic Communication"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-0409-2132","authenticated-orcid":false,"given":"Jack","family":"Doerner","sequence":"first","affiliation":[{"name":"University of Virginia, Charlottesville, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3167-3294","authenticated-orcid":false,"given":"Iftach","family":"Haitner","sequence":"additional","affiliation":[{"name":"Stellar Development Foundation, San Francisco, USA and Tel Aviv University, Tel Aviv, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4096-6305","authenticated-orcid":false,"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel and Amazon Web Services, Inc., Seattle, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9818-456X","authenticated-orcid":false,"given":"Nikolaos","family":"Makriyannis","sequence":"additional","affiliation":[{"name":"Fireblocks, New York, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Two-Round 2PC ECDSA at the Cost of 1 OLE. IACR Cryptol. ePrint Arch. (2024)","author":"Adjedj Michael","year":"1950","unstructured":"Michael Adjedj, Constantin Blokh, Geoffroy Couteau, Antoine Joux, and Nikolaos Makriyannis. 2024. Two-Round 2PC ECDSA at the Cost of 1 OLE. IACR Cryptol. ePrint Arch. (2024), 1950. https:\/\/eprint.iacr.org\/2024\/1950"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_26"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57990-6_7"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/646756.705383"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237996"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-96-0938-3_3"},{"key":"e_1_3_2_1_7_1","volume-title":"USA","author":"Boyle Elette","year":"2019","unstructured":"Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl. 2019. Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. In Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part III."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58751-1_4"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_11_1","volume-title":"Universally Composable Security: A New Paradigm for Cryptographic Protocols. In Annual Symposium on Foundations of Computer Science (FOCS). 136-145","author":"Canetti Ran","year":"2001","unstructured":"Ran Canetti. 2001. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In Annual Symposium on Foundations of Computer Science (FOCS). 136-145."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3423367"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45388-6_10"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-96-0888-1_7"},{"key":"e_1_3_2_1_16_1","volume-title":"On the Randomness of Legendre and Jacobi Sequences. In Annual International Cryptology Conference (CRYPTO), Shafi Goldwasser (Ed.). 163-172","author":"Damgard Ivan","year":"1988","unstructured":"Ivan Damgard. 1988. On the Randomness of Legendre and Jacobi Sequences. In Annual International Cryptology Conference (CRYPTO), Shafi Goldwasser (Ed.). 163-172."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06944-4_11"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3474366.3486928"},{"key":"e_1_3_2_1_19_1","unstructured":"Leo de Castro Duhyeong Kim Miran Kim Keewoo Lee Seonhong Min and Yongsoo Song. 2024. More Efficient Lattice-based OLE from Circuit-private Linear HE with Polynomial Overhead. Cryptology ePrint Archive Paper 2024\/1534. https:\/\/eprint.iacr.org\/2024\/1534"},{"volume-title":"Proceedings of the 39th IEEE Symposium on Security and Privacy (S&P).","author":"Doerner Jack","key":"e_1_3_2_1_20_1","unstructured":"Jack Doerner, Yashvanth Kondi, Eysa Lee, and abhi shelat. 2018. Secure Two-party Threshold ECDSA from ECDSA Assumptions. In Proceedings of the 39th IEEE Symposium on Security and Privacy (S&P)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00024"},{"volume-title":"Proceedings of the 45th IEEE Symposium on Security and Privacy (S&P).","author":"Doerner Jack","key":"e_1_3_2_1_22_1","unstructured":"Jack Doerner, Yashvanth Kondi, Eysa Lee, and abhi shelat. 2024. Threshold ECDSA in Three Rounds. In Proceedings of the 45th IEEE Symposium on Security and Privacy (S&P)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46215.2023.10179470"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32284-6_7"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243859"},{"key":"e_1_3_2_1_27_1","first-page":"629","article-title":"Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead","author":"Ghosh Satrajit","year":"2017","unstructured":"Satrajit Ghosh, Jesper Buus Nielsen, and Tobias Nilges. 2017. Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead. In Annual International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT). 629-659.","journal-title":"Annual International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT)."},{"key":"e_1_3_2_1_28_1","volume-title":"Two Party RSA Key Generation. In Annual International Cryptology Conference (CRYPTO). 116-129","author":"Gilboa Niv","year":"1999","unstructured":"Niv Gilboa. 1999. Two Party RSA Key Generation. In Annual International Cryptology Conference (CRYPTO). 116-129."},{"key":"e_1_3_2_1_29_1","volume-title":"Annual ACM Symposium on Theory of Computing (STOC). 218-229","author":"Goldreich Oded","year":"1987","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 Annual ACM Symposium on Theory of Computing (STOC). 218-229."},{"key":"e_1_3_2_1_30_1","unstructured":"Iftach Haitner Yehuda Lindell Ariel Nof and Samuel Ranellucci. 2023. Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody. Cryptology ePrint Archive Paper 2018\/987 Version 20230529:135032. https:\/\/eprint.iacr.org\/archive\/2018\/987\/20230529:135032"},{"key":"e_1_3_2_1_31_1","volume-title":"Highly Efficient OT-Based Multiplication Protocols. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). 180-209","author":"Haitner Iftach","year":"2022","unstructured":"Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, and Eliad Tsfadia. 2022. Highly Efficient OT-Based Multiplication Protocols. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). 180-209."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3505584"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354258"},{"key":"e_1_3_2_1_34_1","unstructured":"Carmit Hazay and Yehuda Lindell. 2009. Efficient Oblivious Polynomial Evaluation with Simulation-Based Security. Cryptology ePrint Archive Paper 2009\/459. https:\/\/eprint.iacr.org\/2009\/459"},{"key":"e_1_3_2_1_35_1","volume-title":"23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings.","author":"Ishai Yuval","year":"2003","unstructured":"Yuval Ishai, Joe Kilian, Kobbi Nissim, and Erez Petrank. 2003. Extending Oblivious Transfers Efficiently. In Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20465-4_23"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_18"},{"key":"e_1_3_2_1_39_1","volume-title":"GAZELLE: A Low Latency Framework for Secure Neural Network Inference. In 27th USENIX Security Symposium, USENIX Security 2018","author":"Juvekar Chiraag","year":"2018","unstructured":"Chiraag Juvekar, Vinod Vaikuntanathan, and Anantha P. Chandrakasan. 2018. GAZELLE: A Low Latency Framework for Secure Neural Network Inference. In 27th USENIX Security Symposium, USENIX Security 2018, Baltimore, MD, USA, August 15-17, 2018, William Enck and Adrienne Porter Felt (Eds.). USENIX Association, 1651-1669. https:\/\/www.usenix.org\/conference\/usenixsecurity18\/presentation\/juvekar"},{"key":"e_1_3_2_1_40_1","volume-title":"USA","author":"Keller Marcel","year":"2015","unstructured":"Marcel Keller, Emmanuela Orsini, and Peter Scholl. 2015. Actively Secure OT Extension with Optimal Overhead. In Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part I."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978357"},{"key":"e_1_3_2_1_42_1","volume-title":"Founding Cryptography on Oblivious Transfer. In Annual ACM Symposium on Theory of Computing (STOC). 20-31","author":"Kilian Joe","year":"1988","unstructured":"Joe Kilian. 1988. Founding Cryptography on Oblivious Transfer. In Annual ACM Symposium on Theory of Computing (STOC). 20-31."},{"key":"e_1_3_2_1_43_1","unstructured":"Vladimir Kolesnikov Stanislav Peceny Srinivasan Raghuraman and Peter Rindal. 2025. Stationary Syndrome Decoding for Improved PCGs. IACR Cryptol. ePrint Arch. (2025) 295. https:\/\/eprint.iacr.org\/2025\/295"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/090755886"},{"key":"e_1_3_2_1_45_1","volume-title":"Efficient Pseudorandom Correlation Generators for Any Finite Field. IACR Cryptol. ePrint Arch. (2025), 169. https:\/\/eprint.iacr.org\/2025\/169 To appear in Eurocrypt","author":"Li Zhe","year":"2025","unstructured":"Zhe Li, Chaoping Xing, Yizhou Yao, and Chen Yuan. 2025. Efficient Pseudorandom Correlation Generators for Any Finite Field. IACR Cryptol. ePrint Arch. (2025), 169. https:\/\/eprint.iacr.org\/2025\/169 To appear in Eurocrypt 2025."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63715-0_21"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704383633"},{"key":"e_1_3_2_1_48_1","unstructured":"M. O. Rabin. 1981. How to Exchange Secrets by Oblivious Transfer. TR-81 Harvard."},{"key":"e_1_3_2_1_49_1","volume-title":"CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part IV.","author":"Raghuraman Srinivasan","year":"2023","unstructured":"Srinivasan Raghuraman, Peter Rindal, and Titouan Tanguy. 2023. Expand-Convolute Codes for Pseudorandom Correlation Generators from LPN. In Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part IV."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/0219064"},{"key":"e_1_3_2_1_51_1","first-page":"64","article-title":"Approximate formulas for some functions of prime numbers","volume":"6","author":"Barkley Rosser J","year":"1962","unstructured":"J Barkley Rosser and Lowell Schoenfeld. 1962. Approximate formulas for some functions of prime numbers. Illinois Journal of Mathematics, Vol. 6, 1 (1962), 64-94.","journal-title":"Illinois Journal of Mathematics"},{"key":"e_1_3_2_1_52_1","volume-title":"CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part I.","author":"Roy Lawrence","year":"2022","unstructured":"Lawrence Roy. 2022. SoftSpokenOT: Quieter OT Extension from Small-Field Silent VOLE in the Minicrypt Model. In Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part I."},{"volume-title":"A computational introduction to number theory and algebra","author":"Shoup Victor","key":"e_1_3_2_1_53_1","unstructured":"Victor Shoup. 2006. A computational introduction to number theory and algebra. Cambridge University Press."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417276"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP61157.2025.00116"}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Taipei Taiwan","acronym":"CCS '25"},"container-title":["Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3765225","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:14:01Z","timestamp":1766441641000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3765225"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":55,"alternative-id":["10.1145\/3719027.3765225","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3765225","relation":{},"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"2025-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}