{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:25:22Z","timestamp":1742952322263,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031780226"},{"type":"electronic","value":"9783031780233"}],"license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-78023-3_16","type":"book-chapter","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T10:51:09Z","timestamp":1733136669000},"page":"485-516","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributing Keys and\u00a0Random Secrets with\u00a0Constant Complexity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4792-369X","authenticated-orcid":false,"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9053-3024","authenticated-orcid":false,"given":"Benny","family":"Pinkas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Kachlon, E.: Sampling graphs without forbidden subgraphs and unbalanced expanders with negligible error. SIAM J. Comput. 52(6), 1321\u20131368 (2023). https:\/\/doi.org\/10.1137\/22M1484134https:\/\/doi.org\/10.1137\/22m1484134","DOI":"10.1137\/22M1484134"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Nir, O., Pinkas, B.: How to recover a secret with o(n) additions. In: Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part I, pp. 236\u2013262 (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_8","DOI":"10.1007\/978-3-031-38557-5_8"},{"key":"16_CR3","unstructured":"Applebaum, B., Pinkas, B.: Distributing keys and random secrets with constant complexity. Cryptology ePrint Archive, Paper 2024\/876 (2024). https:\/\/eprint.iacr.org\/2024\/876"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Bacho, R., Lenzen, C., Loss, J., Ochsenreither, S., Papachristoudis, D.: GRandLine: adaptively secure DKG and randomness beacon with (log-)quadratic communication complexity. Cryptology ePrint Archive, Paper 2023\/1887 (2023). https:\/\/doi.org\/10.1145\/3658644.3690287, https:\/\/eprint.iacr.org\/2023\/1887","DOI":"10.1145\/3658644.3690287"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Theory of Cryptography Conference, TCC 2008. LNCS, vol.\u00a04948, pp. 213\u2013230. Springer (2008)","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Bogdanov, A., Guo, S., Komargodski, I.: Threshold secret sharing requires a linear-size alphabet. Theory Comput. 16, 1\u201318 (2020). https:\/\/doi.org\/10.4086\/TOC.2020.V016A002, https:\/\/doi.org\/10.4086\/toc.2020.v016a002","DOI":"10.4086\/TOC.2020.V016A002"},{"key":"16_CR7","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5), 28:1\u201328:94 (2020). https:\/\/doi.org\/10.1145\/3402457","DOI":"10.1145\/3402457"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive security for threshold cryptosystems. In: CRYPTO \u201999. LNCS, vol.\u00a01666, pp. 98\u2013115. Springer (1999)","DOI":"10.1007\/3-540-48405-1_7"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Capalbo, M.R., Reingold, O., Vadhan, S.P., Wigderson, A.: Randomness conductors and constant-degree lossless expanders. In: Reif, J.H. (ed.) Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montr\u00e9al, Qu\u00e9bec, Canada, pp. 659\u2013668. ACM (2002)","DOI":"10.1145\/509907.510003"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Cascudo, I., David, B.: Publicly verifiable secret sharing over class groups and applications to DKG and YOSO. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-58740-5_8"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Cramer, R., Damg\u00e5rd, I.B., D\u00f6ttling, N., Fehr, S., Spini, G.: Linear Secret sharing schemes from error correcting codes and universal hash functions. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 313\u2013336. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_11","DOI":"10.1007\/978-3-662-46803-6_11"},{"key":"16_CR12","unstructured":"Das, S., Pinkas, B., Tomescu, A., Xiang, Z.: Distributed randomness using weighted VRFs. Cryptology ePrint Archive, Paper 2024\/198 (2024). https:\/\/eprint.iacr.org\/2024\/198, https:\/\/eprint.iacr.org\/2024\/198"},{"key":"16_CR13","unstructured":"DKGPG developers: DKGPG: Distributed Key Generation for Pretty Good Privacy (PGP) (2017). https:\/\/www.nongnu.org\/dkgpg\/ Accessed 14 Feb 2024"},{"key":"16_CR14","unstructured":"drand: drand: Distributed Randomness Beacon Service (2020). https:\/\/github.com\/drand\/drand. Accessed 14 Feb 2024"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"Fitzi, M., Hirt, M., Maurer, U.M.: Trading correctness for privacy in unconditional multi-party computation (extended abstract). In: Krawczyk, H. (ed.) Advances in Cryptology - CRYPTO \u201998, 18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 23-27, 1998, Proceedings. Lecture Notes in Computer Science, vol.\u00a01462, pp. 121\u2013136. Springer (1998). https:\/\/doi.org\/10.1007\/BFB0055724","DOI":"10.1007\/BFB0055724"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Fouque, P.A., Stern, J.: One round threshold discrete-log key generation without private channels. In: International Workshop on Public Key Cryptography, pp. 300\u2013316. Springer (2001)","DOI":"10.1007\/3-540-44586-2_22"},{"issue":"1","key":"16_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"RG Gallager","year":"1962","unstructured":"Gallager, R.G.: Low-density parity-check codes. IRE Trans. Inf. Theory 8(1), 21\u201328 (1962)","journal-title":"IRE Trans. Inf. Theory"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure applications of pedersen\u2019s distributed key generation protocol. In: Topics in Cryptology - CT-RSA 2003, The Cryptographers\u2019 Track at the RSA Conference 2003. LNCS, vol.\u00a02612, pp. 373\u2013390. Springer (2003)","DOI":"10.1007\/3-540-36563-X_26"},{"key":"16_CR19","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. J. Cryptol. 20(1), 51\u201383 (2007). https:\/\/doi.org\/10.1007\/S00145-006-0347-3","DOI":"10.1007\/S00145-006-0347-3"},{"key":"16_CR20","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 2: Basic Applications. Cambridge University Press (2004). https:\/\/doi.org\/10.1017\/CBO9780511721656","DOI":"10.1017\/CBO9780511721656"},{"key":"16_CR21","unstructured":"Groth, J.: Non-interactive distributed key generation and key resharing. Cryptology ePrint Arch. (2021)"},{"key":"16_CR22","unstructured":"Groth, J., Shoup, V.: Design and analysis of a distributed ECDSA signing service. Cryptology ePrint Archive, Paper 2022\/506 (2022). https:\/\/eprint.iacr.org\/2022\/506"},{"key":"16_CR23","doi-asserted-by":"publisher","unstructured":"Gurkan, K., Jovanovic, P., Maller, M., Meiklejohn, S., Stern, G., Tomescu, A.: Aggregatable distributed key generation. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 147\u2013176. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_6","DOI":"10.1007\/978-3-030-77870-5_6"},{"issue":"4","key":"16_CR24","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999). https:\/\/doi.org\/10.1137\/S0097539793244708","journal-title":"SIAM J. Comput."},{"key":"16_CR25","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Ostrovsky, R., Zikas, V.: Secure multi-party computation with identifiable abort. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 369\u2013386. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_21","DOI":"10.1007\/978-3-662-44381-1_21"},{"key":"16_CR26","unstructured":"Kate, A., Mangipudi, E.V., Mukherjee, P., Saleem, H., Thyagarajan, S.A.K.: Non-interactive VSS using class groups and application to DKG. Cryptology ePrint Arch. (2023)"},{"key":"16_CR27","unstructured":"Katz, J.: Round optimal robust distributed key generation. IACR Cryptol. ePrint Arch. 2023, 1094 (2023). https:\/\/eprint.iacr.org\/2023\/1094"},{"key":"16_CR28","doi-asserted-by":"publisher","unstructured":"Katz, J., Ostrovsky, R., Rabin, M.O.: Identity-based zero knowledge. In: Blundo, C., Cimato, S. (eds.) Security in Communication Networks, 4th International Conference, SCN 2004, Amalfi, Italy, September 8-10, 2004, Revised Selected Papers. Lecture Notes in Computer Science, vol.\u00a03352, pp. 180\u2013192. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-30598-9_13","DOI":"10.1007\/978-3-540-30598-9_13"},{"key":"16_CR29","unstructured":"Komlo, C., Goldberg, I., Stebila, D.: A formal treatment of distributed key generation, and new constructions. IACR Cryptol. ePrint Arch. 292 (2023). https:\/\/eprint.iacr.org\/2023\/292"},{"key":"16_CR30","doi-asserted-by":"publisher","unstructured":"Mosheiff, J., Resch, N., Ron-Zewi, N., Silas, S., Wootters, M.: LDPC codes achieve list decoding capacity. In: Irani, S. (ed.) 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pp. 458\u2013469. IEEE (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00050","DOI":"10.1109\/FOCS46700.2020.00050"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Naor, M.: Bit commitment using pseudo-randomness. In: CRYPTO \u201989. LNCS, vol.\u00a0435, pp. 128\u2013136. Springer (1989)","DOI":"10.1007\/0-387-34805-0_13"},{"key":"16_CR32","unstructured":"Orbs-Network: DKG-on-EVM: A Distributed Key Generation Protocol for Ethereum Virtual Machine (2018). https:\/\/github.com\/orbs-network\/dkg-on-evm. Accessed 14 Feb (2024)"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: CRYPTO \u201991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer (1991)","DOI":"10.1007\/3-540-46766-1_9"},{"key":"16_CR34","doi-asserted-by":"publisher","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust non-interactive zero knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 566\u2013598. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_33","DOI":"10.1007\/3-540-44647-8_33"},{"key":"16_CR35","unstructured":"Schindler, P.: ethDKG: an Ethereum-based DKG Implementation (2020). https:\/\/github.com\/PhilippSchindler\/ethdkg Accessed 14 Feb 2024"},{"key":"16_CR36","unstructured":"Schindler, P., Judmayer, A., Stifter, N., Weippl, E.: EthDKG: distributed key generation with ethereum smart contracts. Cryptology ePrint Archive, Paper 2019\/985 (2019). https:\/\/eprint.iacr.org\/2019\/985"},{"issue":"11","key":"16_CR37","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"16_CR38","unstructured":"Shrestha, N., Bhat, A., Kate, A., Nayak, K.: Synchronous distributed key generation without broadcasts. IACR Cryptol. ePrint Arch. 1635 (2021). https:\/\/eprint.iacr.org\/2021\/1635"},{"key":"16_CR39","unstructured":"Stamer, H.: Gnosis DKG: A Distributed Key Generation Library (2018). https:\/\/github.com\/gnosis\/dkg. Accessed 14 Feb 2024"},{"key":"16_CR40","doi-asserted-by":"publisher","unstructured":"Vadhan, S.P.: Pseudorandomness. Found. Trends Theor. Comput. Sci. 7(1-3), 1\u2013336 (2012). https:\/\/doi.org\/10.1561\/0400000010","DOI":"10.1561\/0400000010"},{"key":"16_CR41","unstructured":"Zichron, L.: Locally Computable Arithmetic Pseudorandom Generators. Master thesis, Tel Aviv University (2017). https:\/\/www.bennyapplebaum.sites.tau.ac.il\/_files\/ugd\/f706bf_501515c9cd7744c498935684bd1648a2.pdf"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78023-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T11:05:31Z","timestamp":1733137531000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78023-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"ISBN":["9783031780226","9783031780233"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78023-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,3]]},"assertion":[{"value":"3 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}