{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:35:31Z","timestamp":1773246931437,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":68,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,15]],"date-time":"2018-10-15T00:00:00Z","timestamp":1539561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"AFOSR Award","award":["FA9550-17-1-0069"],"award-info":[{"award-number":["FA9550-17-1-0069"]}]},{"name":"ERC grant","award":["742754"],"award-info":[{"award-number":["742754"]}]},{"name":"ERC grant","award":["724307"],"award-info":[{"award-number":["724307"]}]},{"name":"ISF grant","award":["1861\/16"],"award-info":[{"award-number":["1861\/16"]}]},{"name":"ISF grant","award":["1709\/14"],"award-info":[{"award-number":["1709\/14"]}]},{"name":"ISF grant","award":["1638\/15"],"award-info":[{"award-number":["1638\/15"]}]},{"name":"grant from the Ministry of Science and Technology Israel and Department of Science and Technology Government of India"},{"name":"GU Cyber Center grant"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,15]]},"DOI":"10.1145\/3243734.3243868","type":"proceedings-article","created":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T17:38:33Z","timestamp":1539711513000},"page":"896-912","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":157,"title":["Compressing Vector OLE"],"prefix":"10.1145","author":[{"given":"Elette","family":"Boyle","sequence":"first","affiliation":[{"name":"IDC, Herzliya, Israel"}]},{"given":"Geoffroy","family":"Couteau","sequence":"additional","affiliation":[{"name":"KIT, Karlsruhe, Germany"}]},{"given":"Niv","family":"Gilboa","sequence":"additional","affiliation":[{"name":"Ben Gurion University, Ben Gurion, Israel"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2018,10,15]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Ciphers for MPC and FHE. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 430--454","author":"Albrecht Martin R","year":"2015","unstructured":"Martin R Albrecht , Christian Rechberger , Thomas Schneider , Tyge Tiessen , and Michael Zohner . 2015 . Ciphers for MPC and FHE. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 430--454 . Martin R Albrecht, Christian Rechberger, Thomas Schneider, Tyge Tiessen, and Michael Zohner. 2015. Ciphers for MPC and FHE. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 430--454."},{"key":"e_1_3_2_2_2_1","volume-title":"44th","author":"Alekhnovich Michael","unstructured":"Michael Alekhnovich . 2003. More on Average Case vs Approximation Complexity . In 44th FOCS. IEEE Computer Society Press , 298--307. Michael Alekhnovich. 2003. More on Average Case vs Approximation Complexity. In 44th FOCS. IEEE Computer Society Press, 298--307."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214050"},{"key":"e_1_3_2_2_4_1","volume-title":"Yuval Ishai, Michael Nielsen, and Lior Zichron.","author":"Applebaum Benny","year":"2017","unstructured":"Benny Applebaum , Ivan Damgr ard , Yuval Ishai, Michael Nielsen, and Lior Zichron. 2017 . Secure Arithmetic Computation with Constant Computational Overhead (LNCS ). Springer , Heidelberg, 223--254. Benny Applebaum, Ivan Damgr ard, Yuval Ishai, Michael Nielsen, and Lior Zichron. 2017. Secure Arithmetic Computation with Constant Computational Overhead (LNCS ). Springer, Heidelberg, 223--254."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.40"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897554"},{"key":"e_1_3_2_2_7_1","first-page":"66","article-title":"Learning Parities with Structured Noise","volume":"17","author":"Arora Sanjeev","year":"2010","unstructured":"Sanjeev Arora and Rong Ge . 2010 . Learning Parities with Structured Noise .. In Electronic Colloquium on Computational Complexity (ECCC) , Vol. 17. 66 . Sanjeev Arora and Rong Ge. 2010. Learning Parities with Structured Noise.. In Electronic Colloquium on Computational Complexity (ECCC), Vol. 17. 66.","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"e_1_3_2_2_9_1","volume-title":"CRYPTO'91 (LNCS )","author":"Beaver Donald","unstructured":"Donald Beaver . 1992. Efficient Multiparty Protocols Using Circuit Randomization . In CRYPTO'91 (LNCS ) , Joan Feigenbaum (Ed.), Vol. 576 . Springer , Heidelberg , 420--432. Donald Beaver. 1992. Efficient Multiparty Protocols Using Circuit Randomization. In CRYPTO'91 (LNCS ), Joan Feigenbaum (Ed.), Vol. 576. Springer, Heidelberg, 420--432."},{"key":"e_1_3_2_2_10_1","volume-title":"CRYPTO'95 (LNCS ),","author":"Beaver Donald","unstructured":"Donald Beaver . 1995. Precomputing Oblivious Transfer . In CRYPTO'95 (LNCS ), , Don Coppersmith (Ed.), Vol. 963 . Springer , Heidelberg , 97--109. Donald Beaver. 1995. Precomputing Oblivious Transfer. In CRYPTO'95 (LNCS ),, Don Coppersmith (Ed.), Vol. 963. Springer, Heidelberg, 97--109."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"e_1_3_2_2_12_1","volume-title":"Semi-homomorphic Encryption and Multiparty Computation. In EUROCRYPT 2011 (LNCS ),, Kenneth G. Paterson (Ed.)","volume":"6632","author":"Bendlin Rikke","year":"2011","unstructured":"Rikke Bendlin , Ivan Damg\u00e5rd , Claudio Orlandi , and Sarah Zakarias . 2011 . Semi-homomorphic Encryption and Multiparty Computation. In EUROCRYPT 2011 (LNCS ),, Kenneth G. Paterson (Ed.) , Vol. 6632 . Springer, Heidelberg, 169--188. Rikke Bendlin, Ivan Damg\u00e5rd, Claudio Orlandi, and Sarah Zakarias. 2011. Semi-homomorphic Encryption and Multiparty Computation. In EUROCRYPT 2011 (LNCS ),, Kenneth G. Paterson (Ed.), Vol. 6632. Springer, Heidelberg, 169--188."},{"key":"e_1_3_2_2_13_1","volume-title":"Smaller Decoding Exponents: Ball-Collision Decoding. In CRYPTO 2011 (LNCS ), Phillip Rogaway (Ed.)","volume":"6841","author":"Bernstein Daniel J.","year":"2011","unstructured":"Daniel J. Bernstein , Tanja Lange , and Christiane Peters . 2011 . Smaller Decoding Exponents: Ball-Collision Decoding. In CRYPTO 2011 (LNCS ), Phillip Rogaway (Ed.) , Vol. 6841 . Springer, Heidelberg, 743--760. Daniel J. Bernstein, Tanja Lange, and Christiane Peters. 2011. Smaller Decoding Exponents: Ball-Collision Decoding. In CRYPTO 2011 (LNCS ), Phillip Rogaway (Ed.), Vol. 6841. Springer, Heidelberg, 743--760."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335355"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134107"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_12"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978429"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Niv Gilboa and Yuval Ishai. 2017. Group-Based Secure Computation: Optimizing Rounds Communication and Computation. In Eurocrypt'17. 163--193.  Elette Boyle Niv Gilboa and Yuval Ishai. 2017. Group-Based Secure Computation: Optimizing Rounds Communication and Computation. In Eurocrypt'17. 163--193.","DOI":"10.1007\/978-3-319-56614-6_6"},{"key":"e_1_3_2_2_20_1","volume-title":"Efficient Designated-Verifier Non-interactive Zero-Knowledge Proofs of Knowledge. In EUROCRYPT","author":"Chaidos Pyrros","year":"2018","unstructured":"Pyrros Chaidos and Geoffroy Couteau . 2018 . Efficient Designated-Verifier Non-interactive Zero-Knowledge Proofs of Knowledge. In EUROCRYPT 2018, Part III. 193--221. Pyrros Chaidos and Geoffroy Couteau. 2018. Efficient Designated-Verifier Non-interactive Zero-Knowledge Proofs of Knowledge. In EUROCRYPT 2018, Part III. 193--221."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Melissa Chase Yevgeniy Dodis Yuval Ishai Daniel Kraschewski Tianren Liu Rafail Ostrovsky and Vinod Vaikuntanathan. 2018. Reusable Non-Interactive Secure Computation. Manuscript.  Melissa Chase Yevgeniy Dodis Yuval Ishai Daniel Kraschewski Tianren Liu Rafail Ostrovsky and Vinod Vaikuntanathan. 2018. Reusable Non-Interactive Secure Computation. Manuscript.","DOI":"10.1007\/978-3-030-26954-8_15"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96881-0_26"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_19"},{"key":"e_1_3_2_2_24_1","volume-title":"International Conference on the Theory and Applications of Cryptographic Techniques","author":"Cramer Ronald","year":"2003","unstructured":"Ronald Cramer , Serge Fehr , Yuval Ishai , and Eyal Kushilevitz . 2003 . Efficient Multi-party Computation over Rings. In Advances in Cryptology - EUROCRYPT 2003 , International Conference on the Theory and Applications of Cryptographic Techniques , Warsaw, Poland, May 4--8 , 2003, Proceedings. 596--613. Ronald Cramer, Serge Fehr, Yuval Ishai, and Eyal Kushilevitz. 2003. Efficient Multi-party Computation over Rings. In Advances in Cryptology - EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4--8, 2003, Proceedings. 596--613."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53015-3_4"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133967"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134024"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554815"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2016.21"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Andre Esser Robert K\u00fcbler and Alexander May. 2017. LPN Decoded (LNCS ). Springer Heidelberg 486--514.  Andre Esser Robert K\u00fcbler and Alexander May. 2017. LPN Decoded (LNCS ). Springer Heidelberg 486--514.","DOI":"10.1007\/978-3-319-63715-0_17"},{"key":"e_1_3_2_2_32_1","volume-title":"Proceedings. 381--399","author":"Fazio Nelly","unstructured":"Nelly Fazio , Rosario Gennaro , Tahereh Jafarikhah , and William E . Skeith III. 2017. Homomorphic Secret Sharing from Paillier Encryption. In Provable Security - 11th International Conference, ProvSec 2017, Xi'an, China, October 23--25, 2017 , Proceedings. 381--399 . Nelly Fazio, Rosario Gennaro, Tahereh Jafarikhah, and William E. Skeith III. 2017. Homomorphic Secret Sharing from Paillier Encryption. In Provable Security - 11th International Conference, ProvSec 2017, Xi'an, China, October 23--25, 2017, Proceedings. 381--399."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_6"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro Craig Gentry Bryan Parno and Mariana Raykova. 2013. Quadratic Span Programs and Succinct NIZKs without PCPs. In EUROCRYPT. 626--645.  Rosario Gennaro Craig Gentry Bryan Parno and Mariana Raykova. 2013. Quadratic Span Programs and Succinct NIZKs without PCPs. In EUROCRYPT. 626--645.","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"e_1_3_2_2_36_1","volume-title":"Jesper Buus Nielsen, and Tobias Nilges","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 ASIACRYPT 2017, Part I (LNCS ). Springer , Heidelberg, 629--659. Satrajit Ghosh, Jesper Buus Nielsen, and Tobias Nilges. 2017. Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead. In ASIACRYPT 2017, Part I (LNCS ). Springer, Heidelberg, 629--659."},{"key":"e_1_3_2_2_37_1","first-page":"1064","article-title":"An Algebraic Approach to Maliciously Secure Private Set Intersection","volume":"2017","author":"Ghosh Satrajit","year":"2017","unstructured":"Satrajit Ghosh and Tobias Nilges . 2017 . An Algebraic Approach to Maliciously Secure Private Set Intersection . IACR Cryptology ePrint Archive , Vol. 2017 (2017), 1064 . http:\/\/eprint.iacr.org\/2017\/1064 Satrajit Ghosh and Tobias Nilges. 2017. An Algebraic Approach to Maliciously Secure Private Set Intersection. IACR Cryptology ePrint Archive, Vol. 2017 (2017), 1064. http:\/\/eprint.iacr.org\/2017\/1064","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_38_1","volume-title":"CRYPTO'99 (LNCS ),, Michael J","author":"Gilboa Niv","unstructured":"Niv Gilboa . 1999. Two Party RSA Key Generation . In CRYPTO'99 (LNCS ),, Michael J . Wiener (Ed.), Vol. 1666 . Springer , Heidelberg , 116--129. Niv Gilboa. 1999. Two Party RSA Key Generation. In CRYPTO'99 (LNCS ),, Michael J. Wiener (Ed.), Vol. 1666. Springer, Heidelberg, 116--129."},{"key":"e_1_3_2_2_39_1","volume-title":"CRYPTO'99 (LNCS ),, Michael J","author":"Gilboa Niv","unstructured":"Niv Gilboa and Yuval Ishai . 1999. Compressing Cryptographic Resources . In CRYPTO'99 (LNCS ),, Michael J . Wiener (Ed.), Vol. 1666 . Springer , Heidelberg , 591--608. Niv Gilboa and Yuval Ishai. 1999. Compressing Cryptographic Resources. In CRYPTO'99 (LNCS ),, Michael J. Wiener (Ed.), Vol. 1666. Springer, Heidelberg, 591--608."},{"key":"e_1_3_2_2_40_1","volume-title":"Distributed Point Functions and Their Applications. In EUROCRYPT 2014 (LNCS ),, Phong Q. Nguyen and Elisabeth Oswald (Eds.)","volume":"8441","author":"Gilboa Niv","year":"2014","unstructured":"Niv Gilboa and Yuval Ishai . 2014 . Distributed Point Functions and Their Applications. In EUROCRYPT 2014 (LNCS ),, Phong Q. Nguyen and Elisabeth Oswald (Eds.) , Vol. 8441 . Springer, Heidelberg, 640--658. Niv Gilboa and Yuval Ishai. 2014. Distributed Point Functions and Their Applications. In EUROCRYPT 2014 (LNCS ),, Phong Q. Nguyen and Elisabeth Oswald (Eds.), Vol. 8441. Springer, Heidelberg, 640--658."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-002-0169-0"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840760"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Carmit Hazay Emmanuela Orsini Peter Scholl and Eduardo Soria-Vazquez. 2018. TinyKeys: A New Approach to Efficient Multi-Party Computation. In CRYPTO.  Carmit Hazay Emmanuela Orsini Peter Scholl and Eduardo Soria-Vazquez. 2018. TinyKeys: A New Approach to Efficient Multi-Party Computation. In CRYPTO.","DOI":"10.1007\/978-3-319-96878-0_1"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_24"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.10"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374438"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/080725398"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_18"},{"key":"e_1_3_2_2_53_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 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. 1651--1669. https:\/\/www.usenix.org\/conference\/usenixsecurity18\/presentation\/juvekar Chiraag Juvekar, Vinod Vaikuntanathan, and Anantha 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. 1651--1669. https:\/\/www.usenix.org\/conference\/usenixsecurity18\/presentation\/juvekar"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62215"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63521"},{"key":"e_1_3_2_2_56_1","volume-title":"2012 International Symposium on. IEEE, 16--20","author":"Kobayashi Kazuki","year":"2012","unstructured":"Kazuki Kobayashi and Tomoharu Shibuya . 2012 . Generalization of Lu's linear time encoding algorithm for LDPC codes. In Information Theory and its Applications (ISITA) , 2012 International Symposium on. IEEE, 16--20 . Kazuki Kobayashi and Tomoharu Shibuya. 2012. Generalization of Lu's linear time encoding algorithm for LDPC codes. In Information Theory and its Applications (ISITA), 2012 International Symposium on. IEEE, 16--20."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034823"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_32"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_6"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_9"},{"key":"e_1_3_2_2_61_1","volume-title":"SecureML: A System for Scalable Privacy-Preserving Machine Learning. In 2017 IEEE Symposium on Security and Privacy, SP 2017","author":"Mohassel Payman","year":"2017","unstructured":"Payman Mohassel and Yupeng Zhang . 2017 . SecureML: A System for Scalable Privacy-Preserving Machine Learning. In 2017 IEEE Symposium on Security and Privacy, SP 2017 , San Jose, CA, USA, May 22--26 , 2017. 19--38. Payman Mohassel and Yupeng Zhang. 2017. SecureML: A System for Scalable Privacy-Preserving Machine Learning. In 2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22--26, 2017. 19--38."},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704383633"},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057777"},{"key":"e_1_3_2_2_64_1","volume-title":"USENIX Security Symposium. 297--314","author":"Rindal Peter","year":"2016","unstructured":"Peter Rindal and Mike Rosulek . 2016 . Faster Malicious 2-Party Secure Computation with Online\/Offline Dual Execution .. In USENIX Security Symposium. 297--314 . Peter Rindal and Mike Rosulek. 2016. Faster Malicious 2-Party Secure Computation with Online\/Offline Dual Execution.. In USENIX Security Symposium. 297--314."},{"key":"e_1_3_2_2_65_1","volume-title":"Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs (LNCS )","author":"Scholl Peter","unstructured":"Peter Scholl . 2018. Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs (LNCS ) . Springer , Heidelberg , 554--583. Peter Scholl. 2018. Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs (LNCS ). Springer, Heidelberg, 554--583."},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556668"},{"key":"e_1_3_2_2_67_1","volume-title":"International Colloquium on Coding Theory and Applications","author":"Stern Jacques","unstructured":"Jacques Stern . 1988. A method for finding codewords of small weight . In International Colloquium on Coding Theory and Applications . Springer , 106--113. Jacques Stern. 1988. A method for finding codewords of small weight. In International Colloquium on Coding Theory and Applications. Springer, 106--113."},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2009.3.13"},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29360-8_10"},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134053"}],"event":{"name":"CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security","location":"Toronto Canada","acronym":"CCS '18","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3243868","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243734.3243868","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:47Z","timestamp":1750208267000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3243868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,15]]},"references-count":68,"alternative-id":["10.1145\/3243734.3243868","10.1145\/3243734"],"URL":"https:\/\/doi.org\/10.1145\/3243734.3243868","relation":{},"subject":[],"published":{"date-parts":[[2018,10,15]]},"assertion":[{"value":"2018-10-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}