{"scopus_import":"1","publisher":"Usenix","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-11-26T23:00:55Z","oa":1,"oa_version":"Published Version","status":"public","quality_controlled":"1","title":"Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling","date_updated":"2023-11-28T09:17:38Z","article_processing_charge":"No","month":"08","day":"15","file":[{"relation":"main_file","checksum":"1a730765930138e23c6efd2575872641","content_type":"application/pdf","file_name":"2023_USENIX_Das.pdf","access_level":"open_access","creator":"dernst","date_updated":"2023-11-28T09:14:34Z","file_id":"14621","success":1,"date_created":"2023-11-28T09:14:34Z","file_size":704331}],"type":"conference","abstract":[{"lang":"eng","text":"Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems without a trusted party. DKG is an essential building block to many decentralized protocols such as randomness beacons, threshold signatures, Byzantine consensus, and multiparty computation. While significant progress has been made recently, existing asynchronous DKG constructions are inefficient when the reconstruction threshold is larger than one-third of the total nodes. In this paper, we present a simple and concretely efficient asynchronous DKG (ADKG) protocol among n = 3t + 1 nodes that can tolerate up to t malicious nodes and support any reconstruction threshold ℓ ≥ t. Our protocol has an expected O(κn3) communication cost, where κ is the security parameter, and only assumes the hardness of the Discrete Logarithm. The\r\ncore ingredient of our ADKG protocol is an asynchronous protocol to secret share a random polynomial of degree ℓ ≥ t, which has other applications, such as asynchronous proactive secret sharing and asynchronous multiparty computation. We implement our high-threshold ADKG protocol and evaluate it using a network of up to 128 geographically distributed nodes. Our evaluation shows that our high-threshold ADKG protocol reduces the running time by 90% and bandwidth usage by 80% over the state-of-the-art."}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2022/1389"}],"department":[{"_id":"ElKo"}],"date_published":"2023-08-15T00:00:00Z","publication_status":"published","year":"2023","volume":8,"intvolume":"         8","ddc":["000"],"project":[{"_id":"34a4ce89-11ca-11ed-8bc3-8cc37fb6e11f","name":"Secure Network and Hardware for Efficient Blockchains","grant_number":"F8512"}],"file_date_updated":"2023-11-28T09:14:34Z","acknowledgement":"The authors would like to thank Amit Agarwal, Andrew Miller, and Tom Yurek for the helpful discussions related to the paper. This work is funded in part by a VMware early career faculty grant, a Chainlink Labs Ph.D. fellowship, the National Science Foundation, and the Austrian Science Fund (FWF) F8512-N.","publication_identifier":{"isbn":["9781713879497"]},"page":"5359-5376","has_accepted_license":"1","publication":"32nd USENIX Security Symposium","author":[{"last_name":"Das","first_name":"Sourav","full_name":"Das, Sourav"},{"last_name":"Xiang","first_name":"Zhuolun","full_name":"Xiang, Zhuolun"},{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","full_name":"Kokoris Kogias, Eleftherios","last_name":"Kokoris Kogias","first_name":"Eleftherios"},{"full_name":"Ren, Ling","first_name":"Ling","last_name":"Ren"}],"language":[{"iso":"eng"}],"_id":"14609","citation":{"apa":"Das, S., Xiang, Z., Kokoris Kogias, E., &#38; Ren, L. (2023). Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling. In <i>32nd USENIX Security Symposium</i> (Vol. 8, pp. 5359–5376). Anaheim, CA, United States: Usenix.","chicago":"Das, Sourav, Zhuolun Xiang, Eleftherios Kokoris Kogias, and Ling Ren. “Practical Asynchronous High-Threshold Distributed Key Generation and Distributed Polynomial Sampling.” In <i>32nd USENIX Security Symposium</i>, 8:5359–76. Usenix, 2023.","ista":"Das S, Xiang Z, Kokoris Kogias E, Ren L. 2023. Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling. 32nd USENIX Security Symposium. USENIX Security Symposium vol. 8, 5359–5376.","ama":"Das S, Xiang Z, Kokoris Kogias E, Ren L. Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling. In: <i>32nd USENIX Security Symposium</i>. Vol 8. Usenix; 2023:5359-5376.","short":"S. Das, Z. Xiang, E. Kokoris Kogias, L. Ren, in:, 32nd USENIX Security Symposium, Usenix, 2023, pp. 5359–5376.","mla":"Das, Sourav, et al. “Practical Asynchronous High-Threshold Distributed Key Generation and Distributed Polynomial Sampling.” <i>32nd USENIX Security Symposium</i>, vol. 8, Usenix, 2023, pp. 5359–76.","ieee":"S. Das, Z. Xiang, E. Kokoris Kogias, and L. Ren, “Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling,” in <i>32nd USENIX Security Symposium</i>, Anaheim, CA, United States, 2023, vol. 8, pp. 5359–5376."},"conference":{"start_date":"2023-08-09","name":"USENIX Security Symposium","end_date":"2023-08-11","location":"Anaheim, CA, United States"}}