2026-09-20T23:11:38Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/110720 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Byzantine faulty operation recovery and cost analysis of SPURT: A distributed randomness beacon text Ren, Ling Krishnan, Vinith 2021-09-17T02:34:42Z 2021-09-17T02:34:42Z 2023-09-17T02:34:57Z 2021-04-23 2021-05 A reliable source of randomness plays an integral part in the design of many cryptographic, security, and distributed system protocols. Yet, existing constructions of distributed random beacons still have limitations such as strong setup or network assumptions, and high computational and communication costs. SPURT a novel efficient distributed randomness beacon protocol does not require any trusted or expensive setup and is secure against a malicious adversary that controls up to one-third of the nodes in a partially synchronous network. One crucial property that SPURT guarantees is unpredictability, which ensures that every honest party is able to recover the random beacon value either before or soon (3 single trip message delays) after the adversary recovers it. This thesis presents the recovery mechanisms that let SPURT provide the above guarantee even in the presence of a malicious leader. We implement SPURT and evaluate it using a network of up to 128 nodes running in geographically distributed AWS instances. Analysis and experiments demonstrated that SPURT offers very high throughput, while only incurring reasonable overhead costs from the recovery mechanisms. Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2023-05-01 The student, Vinith Krishnan, accepted the attached license on 2021-04-21 at 17:08. The student, Vinith Krishnan, submitted this Thesis for approval on 2021-04-21 at 17:15. This Thesis was approved for publication on 2021-04-23 at 16:46. DSpace SAF Submission Ingestion Package generated from Vireo submission #16480 on 2021-09-16 at 17:04:30 Made available in DSpace on 2021-09-17T02:34:42Z (GMT). No. of bitstreams: 2 KRISHNAN-THESIS-2021.pdf: 634412 bytes, checksum: 74ca5ba6aca2738a27085a4c579de072 (MD5) LICENSE.txt: 4212 bytes, checksum: c878f79dc3986ec827dbbec9c8c27670 (MD5) Previous issue date: 2021-04-23 Embargo set by: Seth Robbins for item 118563 Lift date: 2023-09-17T02:34:57Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system U of I Only application/pdf http://hdl.handle.net/2142/110720 en Copyright 2021 Vinith Krishnan Applied Cryptography, Randomness, Consensus Thesis Computer Science Computer Science University of Illinois at Urbana-Champaign Thesis M.S.