-
10
-
-
84978291536
-
On scaling decentralized blockchains (a position paper)
-
Kyle Croman, Christian Decker, Ittay Eyal, Adem Efe Gencer, Ari Juels, Ahmed Kosba, Andrew Miller, Prateek Saxena, Elaine Shi, Emin Gun Sirer, Dawn Song, and Roger Wattenhofer. On scaling decentralized blockchains (a position paper). Workshop on Bitcoin and Blockchain Research, 2016.
-
(2016)
Workshop on Bitcoin and Blockchain Research
-
-
Croman, K.1
Decker, C.2
Eyal, I.3
Gencer, A.E.4
Juels, A.5
Kosba, A.6
Miller, A.7
Saxena, P.8
Shi, E.9
Sirer, E.G.10
Song, D.11
Wattenhofer, R.12
-
11
-
-
84976810569
-
Reaching agreement in the presence of faults
-
April
-
M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228-234, April 1980.
-
(1980)
J. ACM
, vol.27
, Issue.2
, pp. 228-234
-
-
Pease, M.1
Shostak, R.2
Lamport, L.3
-
12
-
-
84976699318
-
The byzantine generals problem
-
July
-
Leslie Lamport, Robert Shostak, and Marshall Pease. The byzantine generals problem. ACM Trans. Program. Lang. Syst., 4(3):382-401, July 1982.
-
(1982)
ACM Trans. Program. Lang. Syst.
, vol.4
, Issue.3
, pp. 382-401
-
-
Lamport, L.1
Shostak, R.2
Pease, M.3
-
15
-
-
84883562045
-
Spanner: Google's globally distributed database
-
aug
-
James C. Corbett, Jeffrey Dean, Michael Epstein, Andrew Fikes, Christopher Frost, J. J. Furman, Sanjay Ghemawat, Andrey Gubarev, Christopher Heiser, Peter Hochschild, Wilson Hsieh, Sebastian Kanthak, Eugene Kogan, Hongyi Li, Alexander Lloyd, Sergey Melnik, David Mwaura, David Nagle, Sean Quinlan, Rajesh Rao, Lindsay Rolig, Yasushi Saito, Michal Szymaniak, Christopher Taylor, Ruth Wang, and Dale Woodford. Spanner: Google's globally distributed database. ACM Trans. Comput. Syst., aug 2013.
-
(2013)
ACM Trans. Comput. Syst.
-
-
Corbett, J.C.1
Dean, J.2
Epstein, M.3
Fikes, A.4
Frost, C.5
Furman, J.J.6
Ghemawat, S.7
Gubarev, A.8
Heiser, C.9
Hochschild, P.10
Hsieh, W.11
Kanthak, S.12
Kogan, E.13
Li, H.14
Lloyd, A.15
Melnik, S.16
Mwaura, D.17
Nagle, D.18
Quinlan, S.19
Rao, R.20
Rolig, L.21
Saito, Y.22
Szymaniak, M.23
Taylor, C.24
Wang, R.25
Woodford, D.26
more..
-
16
-
-
82655182957
-
Scalable consistency in scatter
-
New York, NY, USA, ACM
-
Lisa Glendenning, Ivan Beschastnikh, Arvind Krishnamurthy, and Thomas Anderson. Scalable consistency in scatter. In Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, SOSP'11, pages 15-28, New York, NY, USA, 2011. ACM.
-
(2011)
Proceedings of the Twenty-third ACM Symposium on Operating Systems Principles, SOSP'11
, pp. 15-28
-
-
Glendenning, L.1
Beschastnikh, I.2
Krishnamurthy, A.3
Anderson, T.4
-
17
-
-
79955085235
-
Megastore: Providing scalable, highly available storage for interactive services
-
Jason Baker, Chris Bond, James C. Corbett, JJ Furman, Andrey Khorlin, James Larson, Jean-Michel Leon, Yawei Li, Alexander Lloyd, and Vadim Yushprakh. Megastore: Providing scalable, highly available storage for interactive services. In Proceedings of the Conference on Innovative Data system Research (CIDR), pages 223-234, 2011.
-
(2011)
Proceedings of the Conference on Innovative Data System Research (CIDR)
, pp. 223-234
-
-
Baker, J.1
Bond, C.2
Corbett, J.C.3
Furman, J.J.4
Khorlin, A.5
Larson, J.6
Leon, J.7
Li, Y.8
Lloyd, A.9
Yushprakh, V.10
-
23
-
-
84995485026
-
-
Bitcoin client. https://github.com/bitcoin/bitcoin.
-
-
-
Bitcoin client1
-
25
-
-
84893786526
-
Self-healing deterministic expanders
-
Gopal Pandurangan, Peter Robinson, and Amitabh Trehan. Self-healing deterministic expanders. CoRR, abs/1206.1522, 2012.
-
(2012)
CoRR
-
-
Pandurangan, G.1
Robinson, P.2
Trehan, A.3
-
27
-
-
3042785862
-
The sybil attack in sensor networks: Analysis & defenses
-
New York, NY, USA, ACM
-
James Newsome, Elaine Shi, Dawn Song, and Adrian Perrig. The sybil attack in sensor networks: Analysis & defenses. In Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks, IPSN'04, pages 259-268, New York, NY, USA, 2004. ACM.
-
(2004)
Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks, IPSN'04
, pp. 259-268
-
-
Newsome, J.1
Shi, E.2
Song, D.3
Perrig, A.4
-
28
-
-
58549113189
-
Robust random number generation for peer-to-peer systems
-
Feb.
-
Baruch Awerbuch and Christian Scheideler. Robust random number generation for peer-to-peer systems. Theor. Comput. Sci., 410(6-7):453-466, feb 2009.
-
(2009)
Theor. Comput. Sci.
, vol.410
, Issue.6-7
, pp. 453-466
-
-
Awerbuch, B.1
Scheideler, C.2
-
30
-
-
84904768994
-
Proofs of space
-
Stefan Dziembowski, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof Pietrzak. Proofs of space. Cryptology ePrint Archive, Report 2013/796, 2013. http://eprint.iacr.org/.
-
(2013)
Cryptology EPrint Archive, Report
-
-
Dziembowski, S.1
Faust, S.2
Kolmogorov, V.3
Pietrzak, K.4
-
31
-
-
84927671041
-
Proofs of space: When space is of the essence
-
Giuseppe Ateniese, Ilario Bonacina, Antonio Faonio, and Nicola Galesi. Proofs of space: When space is of the essence. Cryptology ePrint Archive, Report 2013/805, 2013. http://eprint.iacr.org/.
-
(2013)
Cryptology EPrint Archive, Report
-
-
Ateniese, G.1
Bonacina, I.2
Faonio, A.3
Galesi, N.4
-
33
-
-
84910658777
-
Who are you? Secure identities in ad hoc networks
-
Springer
-
Seth Gilbert, Calvin Newport, and Chaodong Zheng. Who are you? secure identities in ad hoc networks. In Distributed Computing, pages 227-242. Springer, 2014.
-
(2014)
Distributed Computing
, pp. 227-242
-
-
Gilbert, S.1
Newport, C.2
Zheng, C.3
-
36
-
-
85055258592
-
-
IBM. Ibm blockchain. http://www.ibm.com/blockchain/, 2016.
-
(2016)
IBM Blockchain
-
-
IBM1
-
40
-
-
84920743145
-
Accelerating bitcoin's transaction processing. Fast money grows on trees, not chains
-
Yonatan Sompolinsky and Aviv Zohar. Accelerating bitcoin's transaction processing. fast money grows on trees, not chains. Cryptology ePrint Archive, Report 2013/881, 2013. http://eprint.iacr.org/.
-
(2013)
Cryptology EPrint Archive, Report 2013/881
-
-
Sompolinsky, Y.1
Zohar, A.2
-
41
-
-
84954102636
-
Demystifying incentives in the consensus computer
-
Loi Luu, Jason Teutsch, Raghav Kulkarni, and Prateek Saxena. Demystifying incentives in the consensus computer. Cryptology ePrint Archive, Report 2015/702, 2015. http://eprint.iacr.org/.
-
(2015)
Cryptology EPrint Archive, Report
-
-
Luu, L.1
Teutsch, J.2
Kulkarni, R.3
Saxena, P.4
-
43
-
-
84943593919
-
-
Adam Back, Matt Corallo, Luke Dashjr, Mark Friedenbach, Gregory Maxwell, Andrew Miller, Andrew Poelstra, Jorge Timon, and Pieter Wuille. Enabling blockchain innovations with pegged sidechains. https://blockstream.com/sidechains.pdf, 2014.
-
(2014)
Enabling Blockchain Innovations with Pegged Sidechains
-
-
Back, A.1
Corallo, M.2
Dashjr, L.3
Friedenbach, M.4
Maxwell, G.5
Miller, A.6
Poelstra, A.7
Timon, J.8
Wuille, P.9
-
45
-
-
84995384269
-
-
Buteri Vitalik, Wood Gavin, Zamfir Vlad, Coleman Jeff, Wampler-Doty Matthew, and Cohn John. Notes on scalable blockchain protocols (version 0.3.2). https://github.com/vbuterin/scalability-paper/raw/master/scalability.pdf, 2015.
-
(2015)
Notes on Scalable Blockchain Protocols (version 0.3.2)
-
-
Vitalik, B.1
Gavin, W.2
Vlad, Z.3
Jeff, C.4
Matthew, W.5
John, C.6
-
46
-
-
0023436302
-
An O (log n) expected rounds randomized byzantine generals protocol
-
October
-
Gabriel Bracha. An O (log n) expected rounds randomized byzantine generals protocol. J. ACM, 34:910-920, October 1987.
-
(1987)
J. ACM
, vol.34
, pp. 910-920
-
-
Bracha, G.1
-
48
-
-
33750538666
-
Fast paxos
-
October
-
Leslie Lamport. Fast paxos. Distributed Computing, 19(2):79-103, October 2006.
-
(2006)
Distributed Computing
, vol.19
, Issue.2
, pp. 79-103
-
-
Lamport, L.1
-
49
-
-
85026654819
-
Making byzantine fault tolerant systems tolerate byzantine faults
-
USENIX Association
-
Allen Clement, Edmund Wong, Lorenzo Alvisi, Mike Dahlin, and Mirco Marchetti. Making byzantine fault tolerant systems tolerate byzantine faults. In Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, pages 153-168. USENIX Association, 2009.
-
(2009)
Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation
, pp. 153-168
-
-
Clement, A.1
Wong, E.2
Alvisi, L.3
Dahlin, M.4
Marchetti, M.5
-
50
-
-
74049140718
-
Zyzzyva: Speculative byzantine fault tolerance
-
January
-
Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement, and Edmund Wong. Zyzzyva: Speculative byzantine fault tolerance. ACM Trans. Comput. Syst., 27(4):7:1-7:39, January 2010.
-
(2010)
ACM Trans. Comput. Syst.
, vol.27
, Issue.4
, pp. 71-739
-
-
Kotla, R.1
Alvisi, L.2
Dahlin, M.3
Clement, A.4
Wong, E.5
-
51
-
-
84921499802
-
The next 700 bft protocols
-
January
-
Pierre-Louis Aublin, Rachid Guerraoui, Nikola Knežević, Vivien Quéma, and Marko Vukolić. The next 700 bft protocols. ACM Trans. Comput. Syst., 32(4):12:1-12:45, January 2015.
-
(2015)
ACM Trans. Comput. Syst.
, vol.32
, Issue.4
, pp. 121-1245
-
-
Aublin, P.-L.1
Guerraoui, R.2
Knežević, N.3
Quéma, V.4
Vukolić, M.5
-
52
-
-
38049008242
-
Towards secure and scalable computation in peer-to-peer networks
-
V. King, J. Saia, V. Sanwalani, and E. Vee. Towards secure and scalable computation in peer-to-peer networks. In Foundations of Computer Science, 2006. FOCS'06. 47th Annual IEEE Symposium on, pages 87-98, 2006.
-
(2006)
Foundations of Computer Science, 2006. FOCS'06. 47th Annual IEEE Symposium on
, pp. 87-98
-
-
King, V.1
Saia, J.2
Sanwalani, V.3
Vee, E.4
-
54
-
-
78751674305
-
Load balanced scalable byzantine agreement through quorum building, with full information
-
Springer Berlin Heidelberg
-
Valerie King, Steven Lonargan, Jared Saia, and Amitabh Trehan. Load balanced scalable byzantine agreement through quorum building, with full information. In Distributed Computing and Networking, volume 6522 of Lecture Notes in Computer Science, pages 203-214. Springer Berlin Heidelberg, 2011.
-
(2011)
Distributed Computing and Networking, Volume 6522 of Lecture Notes in Computer Science
, pp. 203-214
-
-
King, V.1
Lonargan, S.2
Saia, J.3
Trehan, A.4
-
57
-
-
79960819698
-
Breaking the O (n2) bit barrier: Scalable byzantine agreement with an adaptive adversary
-
July
-
Valerie King and Jared Saia. Breaking the O (n2) bit barrier: Scalable byzantine agreement with an adaptive adversary. J. ACM, 58:18:1-18:24, July 2011.
-
(2011)
J. ACM
, vol.58
, pp. 181-1824
-
-
King, V.1
Saia, J.2
-
58
-
-
84943379751
-
Pseudonymous broadcast and secure computation from cryptographic puzzles
-
Jonathan Katz, Andrew Miller, and Elaine Shi. Pseudonymous broadcast and secure computation from cryptographic puzzles. Cryptology ePrint Archive, Report 2014/857, 2014. http://eprint.iacr.org/2014/857.
-
(2014)
Cryptology EPrint Archive, Report 2014/857
-
-
Katz, J.1
Miller, A.2
Shi, E.3
-
59
-
-
85010291991
-
Bitcoin meets strong consistency
-
New York, NY, USA, ACM
-
Christian Decker, Jochen Seidel, and Roger Wattenhofer. Bitcoin meets strong consistency. In Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN'16, pages 13:1-13:10, New York, NY, USA, 2016. ACM.
-
(2016)
Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN'16
, pp. 131-1310
-
-
Decker, C.1
Seidel, J.2
Wattenhofer, R.3
-
60
-
-
77956586366
-
-
Department of Computer Science, Yale University, New Haven, CT, Tech. Rep
-
James Aspnes, Collin Jackson, and Arvind Krishnamurthy. Exposing computationally-challenged byzantine impostors. Department of Computer Science, Yale University, New Haven, CT, Tech. Rep, 2005.
-
(2005)
Exposing Computationally-challenged Byzantine Impostors
-
-
Aspnes, J.1
Jackson, C.2
Krishnamurthy, A.3
-
65
-
-
1542640153
-
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
-
June
-
Seth Gilbert and Nancy Lynch. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News, 33(2):51-59, June 2002.
-
(2002)
SIGACT News
, vol.33
, Issue.2
, pp. 51-59
-
-
Gilbert, S.1
Lynch, N.2
-
66
-
-
84869219414
-
Perspectives on the cap theorem
-
February
-
Seth Gilbert and Nancy Lynch. Perspectives on the cap theorem. Computer, 45(2):30-36, February 2012.
-
(2012)
Computer
, vol.45
, Issue.2
, pp. 30-36
-
-
Gilbert, S.1
Lynch, N.2
|