Securing Blockchain Shards By Using Learning Based Reputation and Verifiable Random Functions
暂无分享,去创建一个
[1] George Danezis,et al. Centrally Banked Cryptocurrencies , 2015, NDSS.
[2] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.
[3] Pieter Wuille,et al. Enabling Blockchain Innovations with Pegged Sidechains , 2014 .
[4] Christian Decker,et al. A Fast and Scalable Payment Network with Bitcoin Duplex Micropayment Channels , 2015, SSS.
[5] Emin Gün Sirer,et al. Bitcoin-NG: A Scalable Blockchain Protocol , 2015, NSDI.
[6] Prateek Saxena,et al. A Secure Sharding Protocol For Open Blockchains , 2016, CCS.
[7] Silvio Micali,et al. Verifiable random functions , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[8] Yevgeniy Dodis,et al. A Verifiable Random Function with Short Proofs and Keys , 2005, Public Key Cryptography.
[9] Elaine Shi,et al. Hybrid Consensus: Efficient Consensus in the Permissionless Model , 2016, DISC.
[10] Jae Kwon,et al. Tendermint : Consensus without Mining , 2014 .
[11] Elaine Shi,et al. The Honey Badger of BFT Protocols , 2016, CCS.
[12] MultiVAC : A High-Throughput Flexible Public Blockchain Based on Trusted Sharding Computation , 2018 .
[13] Miguel Oom Temudo de Castro,et al. Practical Byzantine fault tolerance , 1999, OSDI '99.
[14] Emin Gün Sirer,et al. Service-Oriented Sharding with Aspen , 2016, ArXiv.
[15] Hayri Sever,et al. Creating consensus group using online learning based reputation in blockchain networks , 2019, Pervasive Mob. Comput..