{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T04:03:41Z","timestamp":1780545821213,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":71,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"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":[[2024,12,2]]},"DOI":"10.1145\/3658644.3670379","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"3065-3079","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Efficient Secret Sharing for Large-Scale Applications"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-4521-462X","authenticated-orcid":false,"given":"Sarvar","family":"Patel","sequence":"first","affiliation":[{"name":"Google, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6579-4807","authenticated-orcid":false,"given":"Giuseppe","family":"Persiano","sequence":"additional","affiliation":[{"name":"Universita' di Salerno &amp; Google, Salerno, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5499-4951","authenticated-orcid":false,"given":"Joon Young","family":"Seo","sequence":"additional","affiliation":[{"name":"Google, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4997-6307","authenticated-orcid":false,"given":"Kevin","family":"Yeo","sequence":"additional","affiliation":[{"name":"Google &amp; Columbia University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"CRYPTO","author":"Abraham Ittai","year":"2023","unstructured":"Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, and Gilad Stern. 2023. Bingo: Adaptively secure packed asynchronous verifiable secret sharing and asynchronous distributed key generation. In CRYPTO 2023."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38557-5_8"},{"key":"e_1_3_2_1_3_1","volume-title":"2nd Conference on Information-Theoretic Cryptography (ITC","author":"Ball Marshall","year":"2021","unstructured":"Marshall Ball, Alper \u00c7akan, and Tal Malkin. 2021. Linear threshold secret-sharing with binary reconstruction. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_4_1","volume-title":"Kevin Lewi, Ladi de Naurois, Valeria Nicolaenko, Arnab Roy, and Alberto Sonnino.","author":"Beaver Donald","year":"2021","unstructured":"Donald Beaver, Konstantinos Chalkias, Mahimna Kelkar, Lefteris Kokoris Kogias, Kevin Lewi, Ladi de Naurois, Valeria Nicolaenko, Arnab Roy, and Alberto Sonnino. 2021. STROBE: Stake-based Threshold Random Beacons. Cryptology ePrint Archive, Paper 2021\/1643. https:\/\/eprint.iacr.org\/2021\/1643"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417885"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315268"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484574"},{"key":"e_1_3_2_1_9_1","volume-title":"Joon Young Seo, and Kevin Yeo","author":"Bienstock Alexander","year":"2023","unstructured":"Alexander Bienstock, Sarvar Patel, Joon Young Seo, and Kevin Yeo. 2023. Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps. In USENIX Security 23. USENIX Association, Anaheim, CA, 301--318."},{"key":"e_1_3_2_1_10_1","volume-title":"Joon Young Seo, and Kevin Yeo","author":"Bienstock Alexander","year":"2024","unstructured":"Alexander Bienstock, Sarvar Patel, Joon Young Seo, and Kevin Yeo. 2024. Batch PIR and Labeled PSI with Oblivious Ciphertext Compression. In USENIX Security."},{"key":"e_1_3_2_1_11_1","unstructured":"Bitcoin Armory [n. d.]. https:\/\/btcarmory.com\/."},{"key":"e_1_3_2_1_12_1","volume-title":"International Workshop on. IEEE Computer Society.","author":"Blakley George Robert","year":"1979","unstructured":"George Robert Blakley. 1979. Safeguarding cryptographic keys. In Managing Requirements Knowledge, International Workshop on. IEEE Computer Society."},{"key":"e_1_3_2_1_13_1","volume-title":"Security of Ramp Schemes. In CRYPTO'84 (LNCS","volume":"268","author":"Blakley G. R.","year":"1984","unstructured":"G. R. Blakley and Catherine Meadows. 1984. Security of Ramp Schemes. In CRYPTO'84 (LNCS, Vol. 196), G. R. Blakley and David Chaum (Eds.). Springer, Heidelberg, 242--268."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--662--53015--3_21"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of machine learning and systems 1","author":"Bonawitz Keith","year":"2019","unstructured":"Keith Bonawitz, Hubert Eichner, Wolfgang Grieskamp, Dzmitry Huba, Alex Ingerman, Vladimir Ivanov, Chloe Kiddon, Jakub Konecny, Stefano Mazzocchi, Brendan McMahan, et al. 2019. Towards federated learning at scale: System design. Proceedings of machine learning and systems 1 (2019), 374--388."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80029-2"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0318-0"},{"key":"e_1_3_2_1_19_1","unstructured":"Jan Camenisch Manu Drijvers Timo Hanke Yvonne-Anne Pignolet Victor Shoup and Dominic Williams. 2021. Internet Computer Consensus. Cryptology ePrint Archive Paper 2021\/632. https:\/\/eprint.iacr.org\/2021\/632"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264504"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61204-1_27"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031--22963--3_22"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48965-0_28"},{"key":"e_1_3_2_1_25_1","volume-title":"SoK: Distributed Randomness Beacons. In 2023 IEEE Symposium on Security and Privacy (SP).","author":"Choi Kevin","year":"2023","unstructured":"Kevin Choi, Aathira Manoj, and Joseph Bonneau. 2023. SoK: Distributed Randomness Beacons. In 2023 IEEE Symposium on Security and Privacy (SP)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.64"},{"key":"e_1_3_2_1_27_1","volume-title":"Optimally-resilient unconditionally-secure asynchronous multi-party computation revisited. Cryptology ePrint Archive","author":"Choudhury Ashish","year":"2020","unstructured":"Ashish Choudhury. 2020. Optimally-resilient unconditionally-secure asynchronous multi-party computation revisited. Cryptology ePrint Archive (2020)."},{"key":"e_1_3_2_1_28_1","unstructured":"Cloudflare Randomness Beacon [n. d.]. https:\/\/developers.cloudflare.com\/randomness-beacon\/."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_11"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833580"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--78375--8_3"},{"key":"e_1_3_2_1_32_1","volume-title":"ESA","author":"Dietzfelbinger Martin","year":"2019","unstructured":"Martin Dietzfelbinger and Stefan Walzer. 2019. Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications. In ESA 2019."},{"key":"e_1_3_2_1_33_1","volume-title":"Ribbon filter: practically smaller than Bloom and Xor. arXiv preprint arXiv:2103.02515","author":"Dillinger Peter C","year":"2021","unstructured":"Peter C Dillinger and Stefan Walzer. 2021. Ribbon filter: practically smaller than Bloom and Xor. arXiv preprint arXiv:2103.02515 (2021)."},{"key":"e_1_3_2_1_34_1","unstructured":"Distributed Verifiable Random Functions: an Enabler of Decentralized Random Beacons [n. d.]. https:\/\/github.com\/fetchai\/research-dvrf."},{"key":"e_1_3_2_1_35_1","unstructured":"Drand: Distributed randomness beacon [n. d.]. https:\/\/drand.love."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554815"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_2_1_38_1","unstructured":"Federated Compute Platform [n. d.]. https:\/\/github.com\/google\/federated-compute."},{"key":"e_1_3_2_1_39_1","unstructured":"Federated Learning Blog [n. d.]. Federated Learning: Collaborative Machine Learning without Centralized Training Data. https:\/\/ai.googleblog.com\/2017\/04\/federated-learning-collaborative.html."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.4"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129780"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP51992.2021.00017"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--84245--1_14"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120248"},{"key":"e_1_3_2_1_45_1","volume-title":"Non-interactive distributed key generation and key resharing. Cryptology ePrint Archive","author":"Groth Jens","year":"2021","unstructured":"Jens Groth. 2021. Non-interactive distributed key generation and key resharing. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_46_1","volume-title":"Dfinity technology overview series, consensus system. arXiv preprint arXiv:1805.04548","author":"Hanke Timo","year":"2018","unstructured":"Timo Hanke, Mahnush Movahedi, and Dominic Williams. 2018. Dfinity technology overview series, consensus system. arXiv preprint arXiv:1805.04548 (2018)."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2020-0033"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--48329--2_12"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85886-7_31"},{"key":"e_1_3_2_1_51_1","volume-title":"Secret Sharing on Superconcentrator. arXiv preprint arXiv:2302.04482","author":"Yuan Li.","year":"2023","unstructured":"Yuan Li. 2023. Secret Sharing on Superconcentrator. arXiv preprint arXiv:2302.04482 (2023)."},{"key":"e_1_3_2_1_52_1","unstructured":"libff: C library for Finite Fields and Elliptic Curves [n. d.]. https:\/\/github.com\/scipr-lab\/libff."},{"key":"e_1_3_2_1_53_1","unstructured":"libpolycrypto [n. d.]. https:\/\/github.com\/alinush\/libpolycrypto."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2019.53"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"e_1_3_2_1_56_1","volume-title":"On the Security of KZG Commitment for VSS. In ACM CCS","author":"Momose Atsuki","year":"2023","unstructured":"Atsuki Momose, Sourav Das, and Ling Ren. 2023. On the Security of KZG Commitment for VSS. In ACM CCS 2023."},{"key":"e_1_3_2_1_57_1","unstructured":"Multi-Party Threshold Signature Scheme [n. d.]. https:\/\/github.com\/bnb-chain\/tss-lib."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57220-1_52"},{"key":"e_1_3_2_1_59_1","unstructured":"Origins of drand [n. d.]. https:\/\/drand.love\/about\/#origins-of-drand."},{"key":"e_1_3_2_1_60_1","volume-title":"Joon Young Seo, and Kevin Yeo","author":"Patel Sarvar","year":"2023","unstructured":"Sarvar Patel, Joon Young Seo, and Kevin Yeo. 2023. Don't be Dense: Efficient Keyword PIR for Sparse Databases. In USENIX Security 2023."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--46766--1_9"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90042-9"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73014"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560658"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00003"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_68_1","unstructured":"Shamir Seals [n. d.]. https:\/\/developer.hashicorp.com\/vault\/docs\/concepts\/seal#shamir-seals."},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.45"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00059"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.131"}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670379","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3670379","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:11:12Z","timestamp":1755843072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":71,"alternative-id":["10.1145\/3658644.3670379","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3670379","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}