Analysis of the blockchain protocol in asynchronous networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 10211 LNCS, Issue , 2017, Pages 643-673

  Pass, Rafael ^a   Seeman, Lior ^b   Shelat, Abhi ^c  

^a Cornell Tech ^*  (United States)

^b UBER TECHNOLOGIES INC   (United States)

^c NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCKCHAIN; COMPUTATION THEORY; CRIME; CRYPTOGRAPHY;

ADAPTIVE CORRUPTIONS; ASYNCHRONOUS NETWORKS; CONSENSUS PROTOCOLS; INDEPENDENT CONTRIBUTIONS; PROTOCOL EXECUTION; SECURITY PROPERTIES; SIMPLIFYING ASSUMPTIONS; TYPICAL APPLICATION;

INTERNET PROTOCOLS;

EID: 85018718419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-56614-6_22     Document Type: Conference Paper

References (39)

1. [AJK05] Aspnes, J., Jackson, C., Krishnamurthy, A.: Exposing computationally challenged byzantine impostors (2005)
2. Barak, B., Canetti, R., Lindell, Y., Pass, R., Rabin, T.: Secure computation without authentication. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 361–377. Springer, Heidelberg (2005). doi:10.1007/11535218_22
3. [BK14] Bentov, I., Kumaresan, R.: How to use bitcoin to design fair protocols. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 421–439. Springer, Heidelberg (2014). doi:10.1007/978-3-662-44381-1_24
4. Blockchain.info. Hash rate for blockchain, February 2016. https://blockchain.info/charts/hash-rate
5. BTProof. https://www.btproof.com
6. Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000/067 (2000). http://eprint.iacr.org/2000/067
7. [CL99] Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: OSDI 1999 (1999)
8. [CLLM12] Chung, K.-M., Lam, H., Liu, Z., Mitzenmacher, M.: Chernoff-hoeffding bounds for markov chains: generalized and simplified. In: 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, 29th February–3rd March 2012, Paris, France, pp. 124–135 (2012)
9. [CSWH00] Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: a distributed anonymous information storage and retrieval system. In: Proceedings of the ICSI Workshop on Design Issues in Anonymity and Unobservability (2000)
10. [DLN02] Karger, D., Liben-Nowell, D., Balakrishnan, H.: Analysis of the evolution of peer-to-peer systems. In: PODC 2002 (2002)
11. [DW13] Decker, C., Wattenhofer, R.: Information propagation in the bitcoin network. In: IEEE International Conference on Peer-to-Peer Computing, pp. 1–10 (2013)
12. [DR01] Druschel, P., Rowstron, A.: Past: persistent and anonymous storage in a peer-to-peer networking environment. In: HotOS 2001, pp. 65–70 (2001)
13. [DLS88] Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM (JACM) 35(2), 288–323 (1988)
14. [DN92] Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139–147. Springer, Heidelberg (1993). doi:10.1007/3-540-48071-4_10
15. [ES14] Eyal, I., Sirer, E.G.: Majority is not enough: bitcoin mining is vulnerable. In: Christin, N., Safavi-Naini, R. (eds.) FC 2014. LNCS, vol. 8437, pp. 436–454. Springer, Heidelberg (2014). doi:10.1007/978-3-662-45472-5_28
16. [FVY14] Fromknecht, C., Velicanu, D., Yakoubov, S.: A decentralized public key infrastructure with identity retention. IACR Cryptology ePrint Archive 2014, 803 (2014)
17. [GKL15] Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: analysis and applications. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 281–310. Springer, Heidelberg (2015). doi:10.1007/978-3-662-46803-6_10
18. [GMW87] Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218–229 (1987)
19. [KP15] Kiayias, A., Panagiotakos, G.: Speed-security tradeoffs in blockchain protocols (2015)
20. Kosba, A., Miller, A., Shi, E., Wen, Z., Papamanthou, C.: Hawk: the blockchain model of cryptography and privacy-preserving smart contracts. Technical report, Cryptology ePrint Archive, Report 2015/675 (2015). http://eprint.iacr.org
21. Lamport, L.: Byzantizing paxos by refinement (2010)
22. Lamport, L.: Leaderless Byzantine Paxos. In: DISC 2011 (2011)
23. Litecoin. https://litecoin.org
24. [MA05] Martin, J.-P., Alvisi, L.: Fast Byzantine consensus. In: DSN 2005 (2005)
25. [ML14] Miller, A., LaViola, J.J.: Anonymous Byzantine consensus from moderately-hard puzzles: a model for bitcoin (2014)
26. mtgox (2010). https://bitcointalk.org/index.php?topic=2227.msg29606#msg29606
27. Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008)
28. Namecoin. https://www.namecoin.org
29. Okun, M.: Agreement among unacquainted Byzantine generals. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 499–500. Springer, Heidelberg (2005). doi:10.1007/11561927_40
30. Okun, M.: Distributed computing among unacquainted processors in the presence of byzantine failures (2005)
31. [OB08] Okun, M., Barak, A.: Efficient algorithms for anonymous Byzantine agreement. Theor. Comp. Sys. 42, 222–238 (2008)
32. [PS15] Pass, R., Shelat, A.: Micropayments for decentralized currencies. In: CCS 2015 (2015)
33. Pass, R., Shi, E.: Fruitchains: an (almost) optimally fair blockchain (2016)
34. Pass, R., Shi, E.: Hybrid consensus (2016)
35. [PSL80] Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27, 228–234 (1980)
36. [PD15] Poon, J., Dryja, T.: The bitcoin lightning network: scalable offchain instant payments draft 0.5.9.1 (2015). https://lightning.network/lightning-network-paper.pdf
37. Ratanasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: SIGCOMM 2000 (2000)
38. [SZ15] Sompolinsky, Y., Zohar, A.: Secure high-rate transaction processing in bitcoin. In: Böhme, R., Okamoto, T. (eds.) FC 2015. LNCS, vol. 8975, pp. 507–527. Springer, Heidelberg (2015). doi:10.1007/978-3-662-47854-7_32
39. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: SIGCOMM 2001 (2001)