37 D Mazières The Stellar consensus protocol Afederated model for internet

37 d mazières the stellar consensus protocol

This preview shows page 18 out of 18 pages.

[37] D. Mazières. The Stellar consensus protocol: A federated model for internet-level consensus. - consensus-protocol.pdf , 2014. [38] S. Micali. Fast and furious Byzantine agreement. In Proceedings of the Innovations in Theoretical Computer Science (ITCS) Conference , 2017. [39] S. Micali, M. O. Rabin, and S. P. Vadhan. Verifiable ran- dom functions. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , New York, NY, Oct. 1999. [40] A. Miller, Y. Xia, K. Croman, E. Shi, and D. Song. The Honey Badger of BFT protocols. In Proceedings of the 23rd ACM Conference on Computer and Communications Security (CCS) , pages 31–42, Vienna, Austria, Oct. 2016. [41] A. Monaghan. US wealth inequality: top 0.1% worth as much as the bottom 90%, Nov. 2014. nov/13/us-wealth-inequality-top-01-worth- as-much-as-the-bottom-90 . [42] S. Nakamoto. Bitcoin: A peer-to-peer electronic cash system. , 2008. [43] R. Pass and E. Shi. Hybrid consensus: Efficient consen- sus in the permissionless model. Cryptology ePrint Archive, Report 2016/917, 2016. . iacr.org/ . [44] Peercointalk. Peercoin invalid checkpoint. - checkpoint/3691 , 2015. [45] O. Riordan and N. Wormald. The diameter of sparse ran- dom graphs. Combinatorics, Probability and Computing , 19(5-6):835–926, Nov. 2010. [46] P. Rizzo. BitGo launches “instant” Bitcoin transaction tool, Jan. 2016. - instant-bitcoin-transaction-tool/ . [47] J. Rubin. The problem of ASICBOOST, Apr. 2017. pdfs/Asicboost.pdf . [48] Y. Sompolinsky and A. Zohar. Secure high-rate trans- action processing in Bitcoin. In Proceedings of the 2015 Financial Cryptography and Data Security Conference , 2015. [49] Y. Sompolinsky, Y. Lewenberg, and A. Zohar. SPECTRE: A fast and scalable cryptocurrency protocol. Cryptol- ogy ePrint Archive, Report 2016/1159, 2016. http: //eprint.iacr.org/ . [50] N. Szabo. Smart contracts: Formalizing and securing relationships on public networks. First Monday , 2(9), Sept. 1997. . php/fm/article/view/548/469 . [51] R. Turpin and B. A. Coan. Extending binary Byzan- tine agreement to multivalued Byzantine agreement. Information Processing Letters , 18(2):73–76, Feb. 1984. [52] M. Vasek, M. Thornton, and T. Moore. Empirical analy- sis of denial-of-service attacks in the Bitcoin ecosystem. In Proceedings of the 18th International Financial Cryp- tography and Data Security Conference , Barbados, Mar. 2014. [53] WonderNetwork. Global ping statistics: Ping times between WonderNetwork servers, Apr. 2017. https: //wondernetwork.com/pings . [54] Zerocoin Electric Coin Company. ZCash: All coins are created equal, 2017. . 18
Image of page 18

You've reached the end of your free preview.

Want to read all 18 pages?

  • Spring '19
  • NA
  • hash function, Cryptographic hash function, Algorand

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern

Ask Expert Tutors You can ask You can ask ( soon) You can ask (will expire )
Answers in as fast as 15 minutes