Algorand: A secure and efficient distributed ledger

被引:164
作者
Chen, Jing [1 ]
Micali, Silvio [2 ]
机构
[1] SUNY Stony Brook, Comp Sci Dept, Stony Brook, NY 11794 USA
[2] MIT, CSAIL, 77 Massachusetts Ave, Cambridge, MA 02139 USA
关键词
Public ledger; Blockchain; Byzantine agreement; Distributed computation; Cryptographic self-selection; Permissionless system; BYZANTINE; AGREEMENT;
D O I
10.1016/j.tcs.2019.02.001
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A distributed ledger is a tamperproof sequence of data that can be publicly accessed and augmented by everyone, without being maintained by a centralized party. Distributed ledgers stand to revolutionize the way a modern society operates. They can secure all kinds of traditional transactions, such as payments, asset transfers and titles, in the exact order in which the transactions occur; and enable totally new transactions, such as cryptocurrencies and smart contracts. They can remove intermediaries and usher in a new paradigm for trust. As currently implemented, however, distributed ledgers scale poorly and cannot achieve their enormous potential. In this paper we propose Algorand, an alternative, secure and efficient distributed ledger. Algorand is permissionless and works in a highly asynchronous environment. Unlike prior implementations of distributed ledgers based on "proof of work," Algorand dispenses with "miners" and requires only a negligible amount of computation. Moreover, its transaction history "forks" only with negligible probability: that is, Algorand guarantees the finality of a transaction the moment the transaction enters the ledger. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:155 / 183
页数:29
相关论文
共 40 条
[1]  
[Anonymous], 2006, Foundations of Cryptography: Volume 1, Basic Tools
[2]  
Ben-Or M., 1983, P 2 ANN ACM S PRINC, P27
[3]  
Bitcoin S. Nakamoto, 2008, CISC VIS NETW IND GL
[4]  
Bubna S., 2017, BITCOIN MINING NOW C
[5]   Practical byzantine fault tolerance and proactive recovery [J].
Castro, M ;
Liskov, B .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2002, 20 (04) :398-461
[6]  
Chaum D., 2012, RANDOM SAMPLE ELECTI
[7]  
Chen J., 2017, TECHNICAL REPORT
[8]  
CHOR B, 1989, ADV COMPUTING RES, V5, P443
[9]  
Clark J., 2009, MUCH ACTUAL MONEY IS
[10]   Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain [J].
David, Bernardo ;
Gazi, Peter ;
Kiayias, Aggelos ;
Russell, Alexander .
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT II, 2018, 10821 :66-98