Snow White: Provably Secure Proofs of Stake
暂无分享,去创建一个
Elaine Shi | Rafael Pass | Iddo Bentov | E. Shi | R. Pass | Iddo Bentov
[1] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[2] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[3] Leslie Lamport,et al. The Weak Byzantine Generals Problem , 1983, JACM.
[4] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[5] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1983, PODS '83.
[6] Sam Toueg,et al. Asynchronous consensus and broadcast protocols , 1985, JACM.
[7] Nancy A. Lynch,et al. Consensus in the presence of partial synchrony , 1988, JACM.
[8] Silvio Micali,et al. An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997, SIAM J. Comput..
[9] Miguel Oom Temudo de Castro,et al. Practical Byzantine fault tolerance , 1999, OSDI '99.
[10] Victor Shoup,et al. Secure and Efficient Asynchronous Broadcast Protocols , 2001, CRYPTO.
[11] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[12] Ran Canetti,et al. Universal Composition with Joint State , 2003, CRYPTO.
[13] Roy Friedman,et al. Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems , 2004, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004..
[14] Jonathan Katz,et al. On expected constant-round protocols for Byzantine agreement , 2006, J. Comput. Syst. Sci..
[15] Jean-Philippe Martin,et al. Fast Byzantine Consensus , 2006, IEEE Transactions on Dependable and Secure Computing.
[16] Leslie Lamport,et al. Fast Paxos , 2006, Distributed Computing.
[17] Ran Canetti,et al. Universally Composable Security with Global Setup , 2007, TCC.
[18] Robbert van Renesse,et al. Bosco: One-Step Byzantine Asynchronous Consensus , 2008, DISC.
[19] Leslie Lamport,et al. Vertical paxos and primary-backup replication , 2009, PODC '09.
[20] Yehuda Lindell,et al. Secure Computation Without Authentication , 2005, Journal of Cryptology.
[21] Sunny King,et al. PPCoin: Peer-to-Peer Crypto-Currency with Proof-of-Stake , 2012 .
[22] Alysson Neves Bessani,et al. State Machine Replication for the Masses with BFT-SMART , 2014, 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks.
[23] Iddo Bentov,et al. Proof of Activity: Extending Bitcoin's Proof of Work via Proof of Stake [Extended Abstract]y , 2014, PERV.
[24] Jae Kwon,et al. Tendermint : Consensus without Mining , 2014 .
[25] Aggelos Kiayias,et al. Speed-Security Tradeoffs in Blockchain Protocols , 2015, IACR Cryptol. ePrint Arch..
[26] Aggelos Kiayias,et al. The Bitcoin Backbone Protocol: Analysis and Applications , 2015, EUROCRYPT.
[27] A. Poelstra. Distributed Consensus from Proof of Stake is Impossible , 2015 .
[28] Abhi Shelat,et al. Analysis of the Blockchain Protocol in Asynchronous Networks , 2017, EUROCRYPT.
[29] Elaine Shi,et al. FruitChains: A Fair Blockchain , 2017, IACR Cryptol. ePrint Arch..
[30] Aggelos Kiayias,et al. Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol , 2017, CRYPTO.
[31] Dahlia Malkhi,et al. Flexible Paxos: Quorum Intersection Revisited , 2016, OPODIS.
[32] Silvio Micali,et al. ALGORAND: The Efficient and Democratic Ledger , 2016, ArXiv.
[33] Elaine Shi,et al. On Scaling Decentralized Blockchains - (A Position Paper) , 2016, Financial Cryptography Workshops.
[34] Elaine Shi,et al. The Honey Badger of BFT Protocols , 2016, CCS.
[35] Ariel Gabizon,et al. Cryptocurrencies Without Proof of Work , 2014, Financial Cryptography Workshops.
[36] Elaine Shi,et al. The Sleepy Model of Consensus , 2017, ASIACRYPT.
[37] Elaine Shi,et al. Hybrid Consensus: Efficient Consensus in the Permissionless Model , 2016, DISC.
[38] Emin Gün Sirer,et al. Majority is not enough , 2013, Financial Cryptography.