Lever: Breaking the Shackles of Scalable On-chain Validation
暂无分享,去创建一个
[1] Michael J. Fischer,et al. Scalable Bias-Resistant Distributed Randomness , 2017, 2017 IEEE Symposium on Security and Privacy (SP).
[2] F. Bolle,et al. Not efficient but payoff dominant: Experimental investigations of equilibrium play in binary threshold public good games , 2016 .
[3] Howard Kunreuther,et al. Punishment and Cooperation in Stochastic Social Dilemmas , 2012 .
[4] Daniel Davis Wood,et al. ETHEREUM: A SECURE DECENTRALISED GENERALISED TRANSACTION LEDGER , 2014 .
[5] Jared Saia,et al. Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary , 2010, PODC.
[6] Prateek Saxena,et al. A Secure Sharding Protocol For Open Blockchains , 2016, CCS.
[7] Stefan Dziembowski,et al. General State Channel Networks , 2018, CCS.
[8] Abhi Shelat,et al. Doubly-Efficient zkSNARKs Without Trusted Setup , 2018, 2018 IEEE Symposium on Security and Privacy (SP).
[9] Theo Offerman,et al. Public good provision and public bad prevention: the effect of framing , 1998 .
[10] Andrew Miller,et al. Pisa: Arbitration Outsourcing for State Channels , 2019, IACR Cryptol. ePrint Arch..
[11] Miguel Oom Temudo de Castro,et al. Practical Byzantine fault tolerance , 1999, OSDI '99.
[12] Tatsuya Sasaki,et al. Rewards and the evolution of cooperation in public good games , 2013, Biology Letters.
[13] Mohammad Hossein Manshaei,et al. A Game-Theoretic Analysis of Shard-Based Permissionless Blockchains , 2018, IEEE Access.
[14] Sarah Meiklejohn,et al. Betting on Blockchain Consensus with Fantomette , 2018, ArXiv.
[15] George Danezis,et al. Consensus in the Age of Blockchains , 2017, ArXiv.
[16] M. Archetti,et al. Review: Game theory of public goods in one-shot social dilemmas without assortment. , 2012, Journal of theoretical biology.
[17] Nikita Borisov,et al. SmartCast: An Incentive Compatible Consensus Protocol Using Smart Contracts , 2017, Financial Cryptography Workshops.
[18] Jae Kwon,et al. Tendermint : Consensus without Mining , 2014 .
[19] Long Wang,et al. Emergence of social cooperation in threshold public goods games with collective risk. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.
[20] Zekeriya Erkin,et al. A Scale-Out Blockchain for Value Transfer with Spontaneous Sharding , 2018, 2018 Crypto Valley Conference on Blockchain Technology (CVCBT).
[21] Paulo Esteves-Verissimo,et al. RepuCoin: Your Reputation Is Your Power , 2019, IEEE Transactions on Computers.
[22] Satoshi Nakamoto. Bitcoin : A Peer-to-Peer Electronic Cash System , 2009 .
[23] Michael Dahlin,et al. BAR primer , 2008, 2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN).
[24] Mark Bickford,et al. Nysiad: Practical Protocol Transformation to Tolerate Byzantine Failures , 2008, NSDI.
[25] Hao Wang,et al. Monoxide: Scale out Blockchains with Asynchronous Consensus Zones , 2019, NSDI.
[26] Bryan Ford,et al. Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing , 2016, USENIX Security Symposium.
[27] Silvio Micali,et al. Algorand: Scaling Byzantine Agreements for Cryptocurrencies , 2017, IACR Cryptol. ePrint Arch..
[28] Ittai Abraham,et al. Distributed computing meets game theory: combining insights from two fields , 2011, SIGA.
[29] Ran Canetti,et al. Toward a Game Theoretic View of Secure Computation , 2011, Journal of Cryptology.
[30] Paul Feldman,et al. A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[31] Elaine Shi,et al. FruitChains: A Fair Blockchain , 2017, IACR Cryptol. ePrint Arch..
[32] Kartik Nayak,et al. Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus , 2016, OPODIS.
[33] Marcin Andrychowicz,et al. PoW-Based Distributed Cryptography with No Trusted Setup , 2015, CRYPTO.
[34] Jonathan Katz,et al. Byzantine Agreement with a Rational Adversary , 2012, ICALP.
[35] L. Felkins. The Social Dilemmas , 2015 .
[36] Iddo Bentov,et al. How to Use Bitcoin to Design Fair Protocols , 2014, CRYPTO.
[37] Michael Dahlin,et al. BAR fault tolerance for cooperative services , 2005, SOSP '05.
[38] Vitalik Buterin,et al. Casper the Friendly Finality Gadget , 2017, ArXiv.
[39] Sanjay Jain,et al. How to verify computation with a rational network , 2016, ArXiv.
[40] Elaine Shi,et al. The Honey Badger of BFT Protocols , 2016, CCS.
[41] Joseph Y. Halpern,et al. Game theory with costly computation: formulation and application to protocol security , 2010, ICS.
[42] Dan Boneh,et al. Verifiable Delay Functions , 2018, IACR Cryptol. ePrint Arch..
[43] Mariana Raykova,et al. RapidChain: Scaling Blockchain via Full Sharding , 2018, CCS.
[44] Eli Ben-Sasson,et al. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture , 2014, USENIX Security Symposium.
[45] Kartik Nayak,et al. Practical Synchronous Byzantine Consensus , 2017, IACR Cryptol. ePrint Arch..
[46] Philipp Jovanovic,et al. OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding , 2018, 2018 IEEE Symposium on Security and Privacy (SP).
[47] Emin Gün Sirer,et al. Bitcoin-NG: A Scalable Blockchain Protocol , 2015, NSDI.
[48] Jason Teutsch,et al. Demystifying Incentives in the Consensus Computer , 2015, CCS.
[49] Karl-Martin Ehrhart,et al. Voting on contributions to a threshold public goods game: An experimental investigation , 2014 .
[50] George Danezis,et al. Chainspace: A Sharded Smart Contracts Platform , 2017, NDSS.
[51] Stefan Tai,et al. On or Off the Blockchain? Insights on Off-Chaining Computation and Data , 2017, ESOCC.
[52] Iddo Bentov,et al. Amortizing Secure Computation with Penalties , 2016, CCS.
[53] Kartik Nayak,et al. Solidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus , 2016, ArXiv.
[54] Elaine Shi,et al. Hybrid Consensus: Efficient Consensus in the Permissionless Model , 2016, DISC.
[55] L. Putterman,et al. Who to punish? Individual decisions and majority rule in mitigating the free rider problem , 2009 .
[56] J. Harsanyi. A new theory of equilibrium selection for games with complete information , 1995 .
[57] Sourav Das,et al. YODA: Enabling computationally intensive contracts on blockchains with Byzantine and Selfish nodes , 2019, NDSS.
[58] Andreas Haeberlen,et al. The Case for Byzantine Fault Detection , 2006, HotDep.
[59] S. Matthew Weinberg,et al. Arbitrum: Scalable, private smart contracts , 2018, USENIX Security Symposium.
[60] Changyu Dong,et al. Betrayal, Distrust, and Rationality: Smart Counter-Collusion Contracts for Verifiable Cloud Computing , 2017, CCS.
[61] Jason Teutsch,et al. A scalable verification solution for blockchains , 2019, ArXiv.
[62] Iddo Bentov,et al. Proof of Activity: Extending Bitcoin's Proof of Work via Proof of Stake [Extended Abstract]y , 2014, PERV.
[63] Ueli Maurer,et al. But Why does it Work? A Rational Protocol Design Treatment of Bitcoin , 2018, IACR Cryptol. ePrint Arch..