暂无分享,去创建一个
[1] Daniel Davis Wood,et al. ETHEREUM: A SECURE DECENTRALISED GENERALISED TRANSACTION LEDGER , 2014 .
[2] Prateek Saxena,et al. A Secure Sharding Protocol For Open Blockchains , 2016, CCS.
[3] Miguel Correia,et al. Minimal Byzantine Fault Tolerance , 2008 .
[4] Michael Dahlin,et al. Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults , 2009, NSDI.
[5] Vincent Gramoli,et al. The Balance Attack or Why Forkable Blockchains are Ill-Suited for Consortium , 2017, 2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN).
[6] Ethan Buchman,et al. Tendermint: Byzantine Fault Tolerance in the Age of Blockchains , 2016 .
[7] Satoshi Nakamoto. Bitcoin : A Peer-to-Peer Electronic Cash System , 2009 .
[8] Kartik Nayak,et al. Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus , 2016, OPODIS.
[9] Miguel Correia,et al. Solving vector consensus with a wormhole , 2005, IEEE Transactions on Parallel and Distributed Systems.
[10] Ramakrishna Kotla,et al. Zyzzyva , 2007, SOSP.
[11] K. Marzullo,et al. Towards Low Latency State Machine Replication for Uncivil Wide-area Networks , 2009 .
[12] Nancy A. Lynch,et al. Consensus in the presence of partial synchrony , 1988, JACM.
[13] Jonathan Kirsch,et al. Scaling Byzantine Fault-Tolerant Replication toWide Area Networks , 2006, International Conference on Dependable Systems and Networks (DSN'06).
[14] Marko Vukolic,et al. The Next 700 BFT Protocols , 2015, ACM Trans. Comput. Syst..
[15] Vivien Quéma,et al. RBFT: Redundant Byzantine Fault Tolerance , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.
[16] Alysson Bessani,et al. A Byzantine Fault-Tolerant Ordering Service for the Hyperledger Fabric Blockchain Platform , 2017, 2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN).
[17] Vincent Gramoli,et al. ComChain: Bridging the Gap Between Public and Consortium Blockchains , 2018, 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData).
[18] Bryan Ford,et al. OmniLedger: A Secure, Scale-Out, Decentralized Ledger , 2017, IACR Cryptol. ePrint Arch..
[19] Scott Shenker,et al. Attested append-only memory: making adversaries stick to their word , 2007, SOSP.
[20] Michel Raynal,et al. (Leader/Randomization/Signature)-free Byzantine Consensus for Consortium Blockchains , 2017, ArXiv.
[21] Michel Raynal,et al. DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains , 2018, 2018 IEEE 17th International Symposium on Network Computing and Applications (NCA).
[22] Johannes Behl,et al. Hybrids on Steroids: SGX-Based High Performance BFT , 2017, EuroSys.
[23] Miguel Correia,et al. EBAWA: Efficient Byzantine Agreement for Wide-Area Networks , 2010, 2010 IEEE 12th International Symposium on High Assurance Systems Engineering.
[24] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[25] Marko Vukolic,et al. Hyperledger fabric: a distributed operating system for permissioned blockchains , 2018, EuroSys.
[26] Miguel Castro,et al. Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.
[27] Jean-Philippe Martin,et al. Fast Byzantine Consensus , 2006, IEEE Transactions on Dependable and Secure Computing.
[28] Vincent Gramoli,et al. Impact of Man-In-The-Middle Attacks on Ethereum , 2018, 2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS).
[29] 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.
[30] André Schiper,et al. A Leader-Free Byzantine Consensus Algorithm , 2010, ICDCN.
[31] Silvio Micali,et al. Algorand: Scaling Byzantine Agreements for Cryptocurrencies , 2017, IACR Cryptol. ePrint Arch..
[32] Elaine Shi,et al. The Honey Badger of BFT Protocols , 2016, CCS.
[33] Achour Mostéfaoui,et al. Signature-free asynchronous byzantine consensus with t < n/3 and o(n2) messages , 2014, PODC.
[34] Marko Vukolic,et al. The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication , 2015, iNetSeC.
[35] Achour Mostéfaoui,et al. Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time , 2015, J. ACM.
[36] Tal Rabin,et al. Asynchronous secure computations with optimal resilience (extended abstract) , 1994, PODC '94.