HydRand: Practical Continuous Distributed Randomness
暂无分享,去创建一个
Edgar R. Weippl | Aljosha Judmayer | Nicholas Stifter | Philipp Schindler | Aljosha Judmayer | Nicholas Stifter | E. Weippl | Philipp Schindler
[1] Joseph Bonneau,et al. Proofs-of-delay and randomness beacons in Ethereum , 2017 .
[2] Dan Boneh,et al. Verifiable Delay Functions , 2018, IACR Cryptol. ePrint Arch..
[3] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[4] Jeremy Clark,et al. On Bitcoin as a public randomness source , 2015, IACR Cryptol. ePrint Arch..
[5] Michael O. Rabin,et al. Transaction Protection by Beacons , 1983, J. Comput. Syst. Sci..
[6] Aggelos Kiayias,et al. Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol , 2017, CRYPTO.
[7] Nancy A. Lynch,et al. Consensus in the presence of partial synchrony , 1988, JACM.
[8] Nick Mathewson,et al. Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.
[9] Emin Gün Sirer,et al. Herbivore: A Scalable and Efficient Protocol for Anonymous Communication , 2003 .
[10] Arjen K. Lenstra,et al. A random zoo: sloth, unicorn, and trx , 2015, IACR Cryptol. ePrint Arch..
[11] David Wolinsky,et al. Keeping Authorities "Honest or Bust" with Decentralized Witness Cosigning , 2015, 2016 IEEE Symposium on Security and Privacy (SP).
[12] Marcos K. Aguilera,et al. The correctness proof of Ben-Or’s randomized consensus algorithm , 2012, Distributed Computing.
[13] Ralph C. Merkle,et al. A Digital Signature Based on a Conventional Encryption Function , 1987, CRYPTO.
[14] Michael J. Fischer,et al. Scalable Bias-Resistant Distributed Randomness , 2017, 2017 IEEE Symposium on Security and Privacy (SP).
[15] David Wolinsky,et al. Dissent in Numbers: Making Strong Anonymity Scale , 2012, OSDI.
[16] Benjamin Wesolowski,et al. Efficient Verifiable Delay Functions , 2019, Journal of Cryptology.
[17] Manuel Blum,et al. Coin flipping by telephone a protocol for solving impossible problems , 1983, SIGA.
[18] Tanja Lange,et al. Dual EC: A Standardized Back Door , 2015, The New Codebreakers.
[19] Michael O. Rabin,et al. Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[20] Krzysztof Pietrzak,et al. Simple Verifiable Delay Functions , 2018, IACR Cryptol. ePrint Arch..
[21] Aggelos Kiayias,et al. Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake protocol , 2017, IACR Cryptol. ePrint Arch..
[22] Danny Dolev,et al. On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[23] Elaine Shi,et al. Snow White: Provably Secure Proofs of Stake , 2016, IACR Cryptol. ePrint Arch..
[24] Massimo Bartoletti,et al. A Survey of Attacks on Ethereum Smart Contracts (SoK) , 2017, POST.
[25] Rob Jansen,et al. A TorPath to TorCoin: Proof-of-Bandwidth Altcoins for Compensating Relays , 2014 .
[26] Elaine Shi,et al. On Scaling Decentralized Blockchains - (A Position Paper) , 2016, Financial Cryptography Workshops.
[27] Victor Shoup,et al. Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography , 2000, Journal of Cryptology.
[28] Nickolai Zeldovich,et al. Vuvuzela: scalable private messaging resistant to traffic analysis , 2015, SOSP.
[29] Silvio Micali,et al. Algorand: Scaling Byzantine Agreements for Cryptocurrencies , 2017, IACR Cryptol. ePrint Arch..
[30] Hovav Shacham,et al. Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.
[31] S. Micali. Byzantine Agreement , Made Trivial , 2017 .
[32] Ben Adida,et al. Helios: Web-based Open-Audit Voting , 2008, USENIX Security Symposium.
[33] Sarah Meiklejohn,et al. Winning the Caucus Race: Continuous Leader Election via Public Randomness , 2018, ArXiv.
[34] Berry Schoenmakers,et al. A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic , 1999, CRYPTO.
[35] Dan Boneh,et al. A Survey of Two Verifiable Delay Functions , 2018, IACR Cryptol. ePrint Arch..
[36] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[37] Hovav Shacham,et al. Short Signatures from the Weil Pairing , 2001, J. Cryptol..
[38] Dominic Williams,et al. DFINITY Technology Overview Series, Consensus System , 2018, ArXiv.
[39] Ignacio Cascudo,et al. SCRAPE: Scalable Randomness Attested by Public Entities , 2017, IACR Cryptol. ePrint Arch..
[40] Tancrède Lepoint,et al. Trap Me If You Can - Million Dollar Curve , 2015, IACR Cryptol. ePrint Arch..
[41] Kartik Nayak,et al. Efficient Synchronous Byzantine Consensus , 2017, 1704.02397.