[1] |
NAKAMOTO S . Bitcoin:a peer-to-peer electronic cash system[R]. 2008.
|
[2] |
LAMPORT L . The part-time parliament[J]. ACM Transactions on Computer Systems (TOCS), 1998,16(2): 133-169.
|
[3] |
LAMPORT L . Paxos made simple[J]. ACM Sigact News, 2001,32(4): 18-25.
|
[4] |
LAMPORT L , SHOSTAK R , PEASE M . The Byzantine generals problem[J]. ACM Transactions on Programming Languages and Systems (TOPLAS), 1982,4(3): 382-401.
|
[5] |
CASTRO M , LISKOV B . Practical Byzantine fault tolerance[C]// OSDI. 1999: 173-186.
|
[6] |
WOOD G . Ethereum:a secure decentralised generalised transaction ledger[J]. Ethereum Project Yellow Paper, 2014,151: 1-32.
|
[7] |
KIAYIAS A , RUSSELL A , DAVID B ,et al. Ouroboros:a provably secure proof-of-stake blockchain protocol[C]// Annual International Cryptology Conference. 2017: 357-388.
|
[8] |
DAVID B , GA?I P , KIAYIAS A ,et al. Ouroboros praos:an adaptively-secure,semi-synchronous proof-of-stake blockchain[C]// Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2018: 66-98.
|
[9] |
BENTOV I , PASS R , SHI E . Snow white:provably secure proofs of stake[J]. IACR Cryptology ePrint Archive, 2016: 919.
|
[10] |
EYAL I , GENCER A E , SIRER E G ,et al. Bitcoin-ng:a scalable blockchain protocol[C]// 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 16). 2016: 45-59.
|
[11] |
KOKORIS-KOGIAS E , JOVANOVIC P , GASSER L ,et al. Omniledger:a secure,scale-out,decentralized ledger via sharding[C]// 2018 IEEE Symposium on Security and Privacy (SP). 2018: 583-598.
|
[12] |
ZAMANI M , MOVAHEDI M , RAYKOVA M . Rapidchain:scaling blockchain via full sharding[C]// 2018 ACM SIGSAC Conference on Computer and Communications Security. 2018: 931-948.
|
[13] |
WANG J , WANG H . Monoxide:scale out blockchains with asynchronous consensus zones[C]// 16th USENIX Symposium on Networked Systems Design and Implementation (NSDI 19). 2019: 95-112.
|
[14] |
MILLER A , XIA Y , CROMAN K ,et al. The honey badger of BFT protocols[C]// 2016 ACM SIGSAC Conference on Computer and Communications Security. 2016: 31-42.
|
[15] |
郭兵勇, 李新宇 . 一个高传输效率的多值拜占庭共识方案[J]. 密码学报, 2018,5(5): 516-528.
|
|
GUO B Y , LI X Y . Multi-valued Byzantine consensus scheme with high transmission efficiency[J]. Journal of Cryptologic Research, 2018,5(5): 516-528.
|
[16] |
DWORK C , LYNCH N , STOCKMEYER L . Consensus in the presence of partial synchrony[J]. Journal of the ACM (JACM), 1988,35(2): 288-323.
|
[17] |
BRACHA G . Asynchronous Byzantine agreement protocols[J]. Information and Computation, 1987,75(2): 130-143.
|
[18] |
HENDRICKS J , GANGER G R , REITER M K . Verifying distributed erasure-coded data[C]// The 26th Annual ACM Symposium on Principles of Distributed Computing. 2007: 139-146.
|
[19] |
DUAN S , REITER M K , ZHANG H . BEAT:asynchronous BFT made practical[C]// 2018 ACM SIGSAC Conference on Computer and Communications Security. 2018: 2028-2041.
|
[20] |
CACHIN C , TESSARO S . Asynchronous verifiable information dispersal[C]// 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05). 2005: 191-201.
|
[21] |
REED I S , SOLOMON G . Polynomial codes over certain finite fields[J]. Journal of the Society for Industrial and Applied Mathematics, 1960,8(2): 300-304.
|