Fetching the paper…
Reading the bibliography…
Today's blockchain designs suffer from a trilemma claiming that no blockchain system can simultaneously achieve decentralization, security, and performance scalability.
J.-P. Tillich and G. Zémor, “Hashing with s l 2 sl_{2} ,” in Annual International Cryptology Conference
1994
Earlier work this paper cites.
Cambridge University Press, 2006
R. Roth, Introduction to coding theory · 2006
Earlier work this paper cites.
S. Nakamoto, “Bitcoin: A peer-to-peer electronic cash system,” 2008
2008
Earlier work this paper cites.
R. Gennaro, C. Gentry, and B. Parno, “Non-interactive verifiable computing: Outsourcing computation to untrusted workers,” in Annual Cryptology Conference
2010
Earlier work this paper cites.
A. G. Dimakis, K. Ramchandran, Y. Wu, and C. Suh, “A survey on network codes for distributed storage,” Proceedings of the IEEE
2011
Earlier work this paper cites.
K. V. Rashmi, N. B. Shah, and P. V. Kumar, “Optimal exact-regenerating codes for distributed storage at the msr and mbr points via a product-matrix construction,” IEEE Transactions on Information Theory
2011
Earlier work this paper cites.
Y. M. Zou, “Representing boolean functions using polynomials: more can offer less,” in International Symposium on Neural Networks
2011
Earlier work this paper cites.
N. Bitansky, R. Canetti, A. Chiesa, and E. Tromer, “From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again,” in Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
2012
Earlier work this paper cites.
G. Wood, “Ethereum: A secure decentralised generalised transaction ledger,” Ethereum project yellow paper
2014
Earlier work this paper cites.
E. Ben-Sasson, A. Chiesa, E. Tromer, and M. Virza, “Succinct non-interactive zero knowledge for a von neumann architecture.,” in USENIX Security Symposium
2014
Earlier work this paper cites.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Coded MapReduce,” 53rd Allerton Conference
2015
Earlier work this paper cites.
A. Bahga and V. K. Madisetti, “Blockchain platform for industrial internet of things,” Journal of Software Engineering and Applications
2016
Earlier work this paper cites.
M. Mettler, “Blockchain technology in healthcare: The revolution starts here,” in IEEE 18th International Conference on e-Health Networking, Applications and Services (Healthcom)
2016
Earlier work this paper cites.
K. Croman, C. Decker, I. Eyal, A. E. Gencer, A. Juels, A. Kosba, A. Miller, P. Saxena, E. Shi, E. G. Sirer, et al
2016
Earlier work this paper cites.
A. Gervais, G. O. Karame, K. Wüst, V. Glykantzis, H. Ritzdorf, and S. Capkun, “On the security and performance of proof of work blockchains,” in Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security
2016
Cited alongside, same era.
L. Luu, V. Narayanan, C. Zheng, K. Baweja, S. Gilbert, and P. Saxena, “A secure sharding protocol for open blockchains,” in Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security
2016
Cited alongside, same era.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “A unified coding framework for distributed computing with straggling servers,” IEEE Workshop on Network Coding and Applications
2016
Cited alongside, same era.
S. Dutta, V. Cadambe, and P. Grover, “Short-dot: Computing large linear transforms distributedly using coded short dot products,” in NIPS
2016
Cited alongside, same era.
Accessed: 2018-12-21
T. Ometoruwa, “Solving the blockchain trilemma: Decentralization, security & scalability.” https://www.coinbureau.com/analysis/solving-blockchain-trilemma/ · 2018
Closest in time.
S. Li, M. A. Maddah-Ali, Q. Yu, and A. S. Avestimehr, “A fundamental tradeoff between computation and communication in distributed computing,” IEEE Transactions on Information Theory
2018
Closest in time.
K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Speeding up distributed machine learning using codes,” IEEE Transactions on Information Theory
2018
Closest in time.
Q. Yu, S. Li, N. Raviv, S. M. M. Kalan, M. Soltanolkotabi, and A. S. Avestimehr, “Lagrange coded computing: Optimal design for resiliency, security, and privacy,” in NIPS Systems for ML Workshop
2018
Closest in time.
https://eprint.iacr.org/2018/460.pdf
M. Zamani, M. Movahedi, and M. Raykova, “Rapidchain: A fast blockchain protocol via full sharding,” Cryptology ePrint Archive · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
B. Parno, J. Howell, C. Gentry, and M. Raykova, “Pinocchio: Nearly practical verifiable computation,” Communications of the ACM
2016
Cited alongside, same era.
E. Kokoris-Kogias, P. Jovanovic, L. Gasser, N. Gailly, and B. Ford, “Omniledger: A secure, scale-out, decentralized ledger.,” IACR Cryptology ePrint Archive
2017
Cited alongside, same era.
A. E. Gencer, R. van Renesse, and E. G. Sirer, “Short paper: Service-oriented sharding for blockchains,” in International Conference on Financial Cryptography and Data Security
2017
Cited alongside, same era.
Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “Polynomial codes: an optimal design for high-dimensional coded matrix multiplication,” in NIPS
2017
Cited alongside, same era.
C. Karakus, Y. Sun, S. Diggavi, and W. Yin, “Straggler mitigation in distributed optimization through data encoding,” in NIPS
2017
Cited alongside, same era.
R. Tandon, Q. Lei, A. G. Dimakis, and N. Karampatziakis, “Gradient coding: Avoiding stragglers in distributed learning,” in Proceedings of the 34th International Conference on Machine Learning
2017
Cited alongside, same era.
Y. Gao and H. Nobuhara, “A proof of stake sharding protocol for scalable blockchains,” Proceedings of the Asia-Pacific Advanced Network
2017
Cited alongside, same era.
Closest in time.
2018
Closest in time.
H. Yoo, J. Yim, and S. Kim, “The blockchain for domain based static sharding,” in 2018 17th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/12th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE)
2018
Closest in time.
S. Cai, N. Yang, and Z. Ming, “A decentralized sharding service network framework with scalability,” in International Conference on Web Services
2018
Closest in time.
A. Chauhan, O. P. Malviya, M. Verma, and T. S. Mor, “Blockchain and scalability,” in 2018 IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
Accessed: 2018-12-21
G. Bertoni, J. Daemen, M. Peeters, G. Van Assche, and R. Van Keer, “Keccak specifications summary.” https://keccak.team/keccak_specs_summary.html · 2018
Closest in time.