{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T17:00:37Z","timestamp":1787936437572,"version":"build-2784847793"},"publisher-location":"New York, NY, USA","reference-count":69,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2805\/21"],"award-info":[{"award-number":["2805\/21"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["742754"],"award-info":[{"award-number":["742754"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR00112020023"],"award-info":[{"award-number":["HR00112020023"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CNS-2154149"],"award-info":[{"award-number":["CNS-2154149"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585127","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"1553-1566","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Succinct Computational Secret Sharing"],"prefix":"10.1145","author":[{"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amos","family":"Beimel","sequence":"additional","affiliation":[{"name":"Ben-Gurion University of the Negev, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[{"name":"Technion, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[{"name":"Technion, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianren","family":"Liu","sequence":"additional","affiliation":[{"name":"Peking University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vinod","family":"Vaikuntanathan","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06944-4_27"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44987-6_8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_15"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384293"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2022.8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/130929643"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84252-9_21"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_31"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050058"},{"key":"e_1_3_2_1_10_1","volume-title":"The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs. In TCC 2020 (LNCS","volume":"529","author":"Beimel Amos","year":"2020","unstructured":"Amos Beimel and Oriol Farr\u00e0s . 2020 . The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs. In TCC 2020 (LNCS , Vol. 12552). Springer, 499\u2013 529 . Amos Beimel and Oriol Farr\u00e0s. 2020. The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs. In TCC 2020 (LNCS, Vol. 12552). Springer, 499\u2013529."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9195-8"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102412868"},{"key":"e_1_3_2_1_13_1","volume-title":"On the Cryptographic Complexity of the Worst Functions. In TCC 2014 (LNCS","volume":"342","author":"Beimel Amos","year":"2014","unstructured":"Amos Beimel , Yuval Ishai , Ranjit Kumaresan , and Eyal Kushilevitz . 2014 . On the Cryptographic Complexity of the Worst Functions. In TCC 2014 (LNCS , Vol. 8349). Springer, 317\u2013 342 . Amos Beimel, Yuval Ishai, Ranjit Kumaresan, and Eyal Kushilevitz. 2014. On the Cryptographic Complexity of the Worst Functions. In TCC 2014 (LNCS, Vol. 8349). Springer, 317\u2013342."},{"key":"e_1_3_2_1_14_1","volume-title":"CCS","author":"Bellare Mihir","year":"2007","unstructured":"Mihir Bellare and Phillip Rogaway . 2007 . Robust computational secret sharing and a unified account of classical secret-sharing goals . In CCS 2017. ACM, 172\u2013184. Mihir Bellare and Phillip Rogaway. 2007. Robust computational secret sharing and a unified account of classical secret-sharing goals. In CCS 2017. ACM, 172\u2013184."},{"key":"e_1_3_2_1_15_1","volume-title":"Generalized Secret Sharing and Monotone Functions. In CRYPTO 1988 (LNCS","volume":"35","author":"Benaloh Josh Cohen","year":"1990","unstructured":"Josh Cohen Benaloh and Jerry Leichter . 1990 . Generalized Secret Sharing and Monotone Functions. In CRYPTO 1988 (LNCS , Vol. 403). Springer, 27\u2013 35 . Josh Cohen Benaloh and Jerry Leichter. 1990. Generalized Secret Sharing and Monotone Functions. In CRYPTO 1988 (LNCS, Vol. 403). Springer, 27\u201335."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1050963"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008216403325"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_16"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196772"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02451112"},{"key":"e_1_3_2_1_24_1","volume-title":"5th IMA Conference (LNCS","volume":"198","author":"Cachin Christian","year":"1995","unstructured":"Christian Cachin . 1995 . On-Line Secret Sharing. In Cryptography and Coding , 5th IMA Conference (LNCS , Vol. 1025). Springer, 190\u2013 198 . Christian Cachin. 1995. On-Line Secret Sharing. In Cryptography and Coding, 5th IMA Conference (LNCS, Vol. 1025). Springer, 190\u2013198."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00198463"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63715-0_2"},{"key":"e_1_3_2_1_27_1","first-page":"3","article-title":"The dealer\u2019s random bits in perfect secret sharing schemes. Studia Sci","volume":"32","author":"Csirmaz L\u00e1szl\u00f3","year":"1996","unstructured":"L\u00e1szl\u00f3 Csirmaz . 1996 . The dealer\u2019s random bits in perfect secret sharing schemes. Studia Sci . Math. Hungar. , 32 , 3 \u2013 4 (1996), 429\u2013437. L\u00e1szl\u00f3 Csirmaz. 1996. The dealer\u2019s random bits in perfect secret sharing schemes. Studia Sci. Math. Hungar., 32, 3\u20134 (1996), 429\u2013437.","journal-title":"Math. Hungar."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900029"},{"key":"e_1_3_2_1_29_1","unstructured":"L\u00e1szl\u00f3 Csirmaz. 2005. Secret sharing schemes on graphs. Cryptology ePrint Archive.  eprint.iacr.org\/ \t\t\t\t  L\u00e1szl\u00f3 Csirmaz. 2005. Secret sharing schemes on graphs. Cryptology ePrint Archive.  eprint.iacr.org\/"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-009-9304-0"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9888-2"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2236958"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_1"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00124-0"},{"key":"e_1_3_2_1_35_1","volume-title":"Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. In EUROCRYPT 2018 (LNCS). Springer-Verlag, 597\u2013621","author":"Farr\u00e0s Oriol","year":"2018","unstructured":"Oriol Farr\u00e0s , Tarik Kaced , Sebasti\u00e0 Mart\u00edn , and Carles Padr\u00f3 . 2018 . Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. In EUROCRYPT 2018 (LNCS). Springer-Verlag, 597\u2013621 . Oriol Farr\u00e0s, Tarik Kaced, Sebasti\u00e0 Mart\u00edn, and Carles Padr\u00f3. 2018. Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. In EUROCRYPT 2018 (LNCS). Springer-Verlag, 597\u2013621."},{"key":"e_1_3_2_1_36_1","volume-title":"19th STOC. 427\u2013437.","author":"Feldman Paul","unstructured":"Paul Feldman . 1987. A Practical Scheme for Non-interactive Verifiable Secret Sharing . In 19th STOC. 427\u2013437. Paul Feldman. 1987. A Practical Scheme for Non-interactive Verifiable Secret Sharing. In 19th STOC. 427\u2013437."},{"key":"e_1_3_2_1_37_1","volume-title":"Broadcast Encryption. In CRYPTO 1993 (LNCS","volume":"491","author":"Fiat Amos","year":"1994","unstructured":"Amos Fiat and Moni Naor . 1994 . Broadcast Encryption. In CRYPTO 1993 (LNCS , Vol. 773). Springer, 480\u2013 491 . Amos Fiat and Moni Naor. 1994. Broadcast Encryption. In CRYPTO 1993 (LNCS, Vol. 773). Springer, 480\u2013491."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_7"},{"key":"e_1_3_2_1_39_1","volume-title":"Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption. In CRYPTO 2015 (LNCS","volume":"502","author":"Gay Romain","year":"2015","unstructured":"Romain Gay , Iordanis Kerenidis , and Hoeteck Wee . 2015 . Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption. In CRYPTO 2015 (LNCS , Vol. 9216). Springer, 485\u2013 502 . Romain Gay, Iordanis Kerenidis, and Hoeteck Wee. 2015. Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption. In CRYPTO 2015 (LNCS, Vol. 9216). Springer, 485\u2013502."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1689"},{"key":"e_1_3_2_1_41_1","volume-title":"The Foundations of Cryptography - Volume 1: Basic Techniques","author":"Goldreich Oded","unstructured":"Oded Goldreich . 2001. The Foundations of Cryptography - Volume 1: Basic Techniques . Cambridge University Press . Oded Goldreich. 2001. The Foundations of Cryptography - Volume 1: Basic Techniques. Cambridge University Press."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840760"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688105"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46497-7_26"},{"key":"e_1_3_2_1_47_1","volume-title":"41st ICALP. 650\u2013662.","author":"Ishai Yuval","unstructured":"Yuval Ishai and Hoeteck Wee . 2014. Partial Garbling Schemes and Their Applications . In 41st ICALP. 650\u2013662. Yuval Ishai and Hoeteck Wee. 2014. Partial Garbling Schemes and Their Applications. In 41st ICALP. 650\u2013662."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02620229"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06944-4_23"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336536"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056621"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-015-9226-0"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746614"},{"key":"e_1_3_2_1_54_1","volume-title":"Secret Sharing Made Short. In CRYPTO 1993 (LNCS","volume":"146","author":"Krawczyk Hugo","year":"1994","unstructured":"Hugo Krawczyk . 1994 . Secret Sharing Made Short. In CRYPTO 1993 (LNCS , Vol. 773). Springer, 136\u2013 146 . Hugo Krawczyk. 1994. Secret Sharing Made Short. In CRYPTO 1993 (LNCS, Vol. 773). Springer, 136\u2013146."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57990-6_28"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188936"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_25"},{"key":"e_1_3_2_1_58_1","volume-title":"Towards Breaking the Exponential Barrier for General Secret Sharing. In EUROCRYPT 2018 (LNCS). Springer, 758\u2013790","author":"Liu Tianren","year":"2018","unstructured":"Tianren Liu , Vinod Vaikuntanathan , and Hoteck Wee . 2018 . Towards Breaking the Exponential Barrier for General Secret Sharing. In EUROCRYPT 2018 (LNCS). Springer, 758\u2013790 . Tianren Liu, Vinod Vaikuntanathan, and Hoteck Wee. 2018. Towards Breaking the Exponential Barrier for General Secret Sharing. In EUROCRYPT 2018 (LNCS). Springer, 758\u2013790."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2669940"},{"key":"e_1_3_2_1_60_1","volume-title":"Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In CRYPTO 1991 (LNCS","volume":"140","author":"Pedersen Torben P.","year":"1991","unstructured":"Torben P. Pedersen . 1991 . Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In CRYPTO 1991 (LNCS , Vol. 576). Springer, 129\u2013 140 . Torben P. Pedersen. 1991. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In CRYPTO 1991 (LNCS, Vol. 576). Springer, 129\u2013140."},{"key":"e_1_3_2_1_61_1","volume-title":"47th STOC. 1246\u20131255.","author":"Pitassi Toniann","unstructured":"Toniann Pitassi and Robert Robere . 2017. Strongly exponential lower bounds for monotone computation . In 47th STOC. 1246\u20131255. Toniann Pitassi and Robert Robere. 2017. Strongly exponential lower bounds for monotone computation. In 47th STOC. 1246\u20131255."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00086"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_64_1","volume-title":"Secret Sharing in Graph-Based Prohibited Structures. In INFOCOM","author":"Sun Hung-Min","year":"1997","unstructured":"Hung-Min Sun and Shiuh-Pyng Shieh . 1997 . Secret Sharing in Graph-Based Prohibited Structures. In INFOCOM 1997. 718\u2013724. Hung-Min Sun and Shiuh-Pyng Shieh. 1997. Secret Sharing in Graph-Based Prohibited Structures. In INFOCOM 1997. 718\u2013724."},{"key":"e_1_3_2_1_65_1","volume-title":"Indocrypt 2003 (LNCS","volume":"176","author":"Vaikuntanathan Vinod","year":"2003","unstructured":"Vinod Vaikuntanathan , Arvind Narayanan , Kannan Srinathan , C. Pandu Rangan , and Kwangjo Kim . 2003 . On the Power of Computational Secret Sharing . In Indocrypt 2003 (LNCS , Vol. 2904). Springer, 162\u2013 176 . Vinod Vaikuntanathan, Arvind Narayanan, Kannan Srinathan, C. Pandu Rangan, and Kwangjo Kim. 2003. On the Power of Computational Secret Sharing. In Indocrypt 2003 (LNCS, Vol. 2904). Springer, 162\u2013176."},{"key":"e_1_3_2_1_66_1","volume-title":"Secret Sharing and Statistical Zero Knowledge. In ASIACRYPT","author":"Vaikuntanathan Vinod","year":"2015","unstructured":"Vinod Vaikuntanathan and Prashant Nalini Vasudevan . 2015 . Secret Sharing and Statistical Zero Knowledge. In ASIACRYPT 2015. 656\u2013680. Vinod Vaikuntanathan and Prashant Nalini Vasudevan. 2015. Secret Sharing and Statistical Zero Knowledge. In ASIACRYPT 2015. 656\u2013680."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01398012"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54242-8_26"},{"key":"e_1_3_2_1_69_1","volume-title":"Oberwolfach and DIMACS workshops","author":"Chi-Chih Yao Andrew","year":"1989","unstructured":"Andrew Chi-Chih Yao . 1989 . Unpublished manuscript . Presented at Oberwolfach and DIMACS workshops Andrew Chi-Chih Yao. 1989. Unpublished manuscript. Presented at Oberwolfach and DIMACS workshops"}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","location":"Orlando FL USA","acronym":"STOC '23","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585127","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585127","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:27Z","timestamp":1750295847000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":69,"alternative-id":["10.1145\/3564246.3585127","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585127","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}