{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:42:49Z","timestamp":1780069369455,"version":"3.54.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3133956.3134107","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"2105-2122","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":88,"title":["Homomorphic Secret Sharing"],"prefix":"10.1145","author":[{"given":"Elette","family":"Boyle","sequence":"first","affiliation":[{"name":"IDC, Herzliya, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Geoffroy","family":"Couteau","sequence":"additional","affiliation":[{"name":"\u00c9cole Normale Sup\u00e9rieure, CNRS, PSL Research University, INRIA, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Niv","family":"Gilboa","sequence":"additional","affiliation":[{"name":"Ben Gurion University, Beer-Sheva, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[{"name":"Technion and UCLA, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michele","family":"Orr\u00f9","sequence":"additional","affiliation":[{"name":"\u00c9cole Normale Sup\u00e9rieure, CNRS, PSL Research University, INRIA, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/120884857"},{"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. 2017. Secure Arithmetic Computation with Constant Computational Overhead Crypto'17. 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 and Shachar Lovett 2016. Algebraic attacks against random local functions and their countermeasures STOC. 1087--1100.","DOI":"10.1145\/2897518.2897554"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_31"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44750-4_8"},{"key":"e_1_3_2_2_6_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.","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_7_1","volume-title":"Cryptographic Capsules: A Disjunctive Primative for Interactive Protocols CRYPTO. 213--222.","author":"Benaloh Josh Cohen","year":"1986","unstructured":"Josh Cohen Benaloh. 1986. Cryptographic Capsules: A Disjunctive Primative for Interactive Protocols CRYPTO. 213--222."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Josh Cohen Benaloh. 1986. Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing CRYPTO. 251--260.","DOI":"10.1007\/3-540-47721-7_19"},{"key":"e_1_3_2_2_9_1","volume-title":"Semi-homomorphic Encryption and Multiparty Computation EUROCRYPT","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 EUROCRYPT 2011, Vol. Vol. 6632. 169--188."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","unstructured":"E. Boyle N. Gilboa and Y. Ishai 2015. Function Secret Sharing. In EUROCRYPT. 337--367. 10.1007\/978-3-662-46803-6_12","DOI":"10.1007\/978-3-662-46803-6_12"},{"key":"e_1_3_2_2_11_1","volume-title":"Breaking the Circuit Size Barrier for Secure Computation Under DDH CRYPTO. 509--539. Full version: IACR Cryptology ePrint Archive 2016: 585","author":"Boyle Elette","year":"2016","unstructured":"Elette Boyle, Niv Gilboa, and Yuval Ishai 2016. Breaking the Circuit Size Barrier for Secure Computation Under DDH CRYPTO. 509--539. Full version: IACR Cryptology ePrint Archive 2016: 585 (2016)."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Niv Gilboa and Yuval Ishai 2016. Function Secret Sharing: Improvements and Extensions ACM CCS. 1292--1303.","DOI":"10.1145\/2976749.2978429"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Niv Gilboa and Yuval Ishai 2017. Group-Based Secure Computation: Optimizing Rounds Communication and Computation Eurocrypt'17. 163--193.","DOI":"10.1007\/978-3-319-56614-6_6"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_24"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/120868669"},{"key":"e_1_3_2_2_16_1","volume-title":"Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information CRYPTO'97","volume":"1294","author":"Canetti Ran","year":"1997","unstructured":"Ran Canetti. 1997. Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information CRYPTO'97, Vol. Vol. 1294. 455--469."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"David Chaum Claude Cr\u00e9peau and Ivan Damg\u00e5rd. 1988. Multiparty Unconditionally Secure Protocols (Extended Abstract) STOC. 11--19.","DOI":"10.1145\/62212.62214"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Ilaria Chillotti Nicolas Gama Mariya Georgieva and Malika Izabach\u00e8ne 2016. Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds Asiacrypt'16. 3--33.","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200059"},{"key":"e_1_3_2_2_21_1","volume-title":"Michael Nielsen, and Samuel Ranellucci","author":"Damg\u00e5rd Ivan","year":"2017","unstructured":"Ivan Damg\u00e5rd, Jesper Buus Nielsen, Michael Nielsen, and Samuel Ranellucci 2017. Gate-scrambling Revisited - or: The TinyTable protocol for 2-Party Secure Computation. Crypto'17 (2017)."},{"key":"e_1_3_2_2_22_1","volume-title":"Smart, and Sarah Zakarias","author":"Damg\u00e5rd Ivan","year":"2012","unstructured":"Ivan Damg\u00e5rd, Valerio Pastro, Nigel P. Smart, and Sarah Zakarias 2012. Multiparty Computation from Somewhat Homomorphic Encryption CRYPTO 2012, Vol. Vol. 7417. 643--662."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","unstructured":"Yevgeniy Dodis Shai Halevi Ron D. Rothblum and Daniel Wichs 2016. Spooky Encryption and Its Applications. In CRYPTO. 93--122. 10.1007\/978-3-662-53015-3_4","DOI":"10.1007\/978-3-662-53015-3_4"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"L\u00e9o Ducas and Daniele Micciancio 2015. FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second EUROCRYPT. 617--640.","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Sanjam Garg Craig Gentry Shai Halevi and Mariana Raykova 2014. Two-Round Secure MPC from Indistinguishability Obfuscation TCC. 74--94.","DOI":"10.1007\/978-3-642-54242-8_4"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Craig Gentry. 2009. Fully homomorphic encryption using ideal lattices. STOC. 169--178.","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Craig Gentry Amit Sahai and Brent Waters 2013. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler Asymptotically-Faster Attribute-Based. In Crypto'13. 75--92.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"e_1_3_2_2_28_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. IACR Cryptology ePrint Archive (2017), 409."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48405-1_8"},{"key":"e_1_3_2_2_30_1","volume-title":"Distributed Point Functions and Their Applications EUROCRYPT","volume":"8441","author":"Gilboa Niv","year":"2014","unstructured":"Niv Gilboa and Yuval Ishai 2014. Distributed Point Functions and Their Applications EUROCRYPT 2014, Vol. Vol. 8441. 640--658."},{"key":"e_1_3_2_2_31_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 STOC. 218--229.","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","unstructured":"Shai Halevi and Victor Shoup 2015. Bootstrapping for HElib. In EUROCRYPT. 641--670. https:\/\/doi.org\/10.1007\/978-3-662-46800-5_25","DOI":"10.1007\/978-3-662-46800-5_25"},{"key":"e_1_3_2_2_33_1","volume-title":"On the Power of Correlated Randomness in Secure Computation TCC","volume":"7785","author":"Ishai Yuval","year":"2013","unstructured":"Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Claudio Orlandi, and Anat Paskin-Cherniavsky. 2013. On the Power of Correlated Randomness in Secure Computation TCC 2013, Vol. Vol. 7785. 600--620."},{"key":"e_1_3_2_2_34_1","volume-title":"Cryptography with constant computational overhead. 40th ACM STOC, bibfieldeditor","author":"Ishai Yuval","unstructured":"Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai 2008. Cryptography with constant computational overhead. 40th ACM STOC, bibfieldeditorRichard E. Ladner and Cynthia Dwork (Eds.). ACM Press, 433--442."},{"key":"e_1_3_2_2_35_1","volume-title":"Secure Arithmetic Computation with No Honest Majority TCC'09","author":"Ishai Yuval","year":"2009","unstructured":"Yuval Ishai, Manoj Prabhakaran, and Amit Sahai. 2009. Secure Arithmetic Computation with No Honest Majority TCC'09. 294--314."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978357"},{"key":"e_1_3_2_2_37_1","volume-title":"Improved OT Extension for Transferring Short Secrets CRYPTO","volume":"8043","author":"Kolesnikov Vladimir","year":"2013","unstructured":"Vladimir Kolesnikov and Ranjit Kumaresan 2013. Improved OT Extension for Transferring Short Secrets CRYPTO 2013, Part II, Vol. Vol. 8043. 54--70."},{"key":"e_1_3_2_2_38_1","volume-title":"Computationally-Private Information Retrieval 38th FOCS. 364--373.","author":"Kushilevitz Eyal","unstructured":"Eyal Kushilevitz and Rafail Ostrovsky 1997. Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval 38th FOCS. 364--373."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704383633"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_14"},{"key":"e_1_3_2_2_42_1","volume-title":"Dertouzos","author":"Rivest Ronald L.","year":"1978","unstructured":"Ronald L. Rivest, Len Adleman, and Michael L. Dertouzos. 1978. On data banks and privacy homomorphisms. Foundations of secure computation (Workshop, Georgia Inst. Tech., Atlanta, Ga., 1977). Academic, New York, 169--179."},{"key":"e_1_3_2_2_43_1","unstructured":"SECG 2010. SEC 2: Recommended Elliptic Curve Domain Parameters Version 2. http:\/\/www.secg.org. (2010)."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract) FOCS. 162--167.","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","location":"Dallas Texas USA","acronym":"CCS '17","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134107","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T19:35:04Z","timestamp":1750966504000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134107"}},"subtitle":["Optimizations and Applications"],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":45,"alternative-id":["10.1145\/3133956.3134107","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3134107","relation":{},"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"2017-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}