暂无分享,去创建一个
ALGORAND is a celebrated public ledger technology designed by Dr. Micali and his collaborators. By the end of year 2018, it has raised US$64 million in funding from venture capital firms. In this paper, we identify several design flaws of the ALGORAND protocol. In particular, we show that the claimed (proved) fork-free property is not true and several assumptions in ALGORAND are not realistic in practice. The ALGORAND wiki page this https URL claims that ``the probability of a fork in the protocol is estimated at 1/1,000,000,000 and therefore blocks can be considered final upon validation''. However, our first attack in this paper shows that a malicious adversary who controls less than 1/3 of the users (or money units) could fork the ALGORAND chain very easily. Our second attack shows that a malicious adversary could use a bribery attack to fork the ALGORAND chain very easily also. Furthermore, we show that the celebrated Byzantine Agreement component in ALGORAND is not necessary. The Byzantine Agreement is the most expensive part and one of the most innovative parts in the ALGORAND protocol. It is used to avoid forks in ALGORAND. We show that a simple majority vote could be used to achieve the same property that Byzantine Agreement achieves in ALGORAND under the same network assumption.
[1] David Chaum,et al. Blind Signatures for Untraceable Payments , 1982, CRYPTO.
[2] Aggelos Kiayias,et al. Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol , 2017, CRYPTO.
[3] Amos Fiat,et al. Untraceable Electronic Cash , 1990, CRYPTO.
[4] Silvio Micali,et al. Algorand: Scaling Byzantine Agreements for Cryptocurrencies , 2017, IACR Cryptol. ePrint Arch..
[5] Elaine Shi,et al. The Sleepy Model of Consensus , 2017, ASIACRYPT.