Fetching the paper…
Reading the bibliography…
Proof of work (PoW), the most popular consensus mechanism for Blockchain, requires ridiculously large amounts of energy but without any useful outcome beyond determining accounting rights among miners.
1912
Earlier work this paper cites.
V. Kolesnikov and T. Schneider, “Improved garbled circuit: Free xor gates and applications,” in International Colloquium on Automata, Languages & Programming , 2008
2008
Earlier work this paper cites.
D. Harnik, Y. Ishai, E. Kushilevitz, and J. B. Nielsen, “Ot-combiners via secure computation,” in Conference on Theory of Cryptography , 2008
2008
Earlier work this paper cites.
B. Pinkas, T. Schneider, N. P. Smart, and S. C. Williams, “Secure two-party computation is practical,” in International Conference on the Theory & Application of Cryptology & Information Security: Advances in Cryptology , 2009
2009
Earlier work this paper cites.
S. Jarecki and X. Liu, “Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection,” in Theory of Cryptography Conference on Theory of Cryptography , 2009
2009
Earlier work this paper cites.
A. Krizhevsky, G. Hinton et al. , “Learning multiple layers of features from tiny images,” Citeseer, Tech. Rep., 2009
2009
Earlier work this paper cites.
Y. LeCun and C. Cortes, “Mnist handwritten digit database,” 2010, [Online]. Available: http://yann.lecun.com/exdb/mnist/
2010
Earlier work this paper cites.
Y. Huang, C.-h. Shen, D. Evans, J. Katz, and A. Shelat, “Efficient secure computation with garbled circuits,” in International Conference on Information Systems Security . Springer, 2011, pp. 28–48
2011
Earlier work this paper cites.
S. King and S. Nadal, “Ppcoin: Peer-to-peer crypto-currency with proof-of-stake,” self-published paper, August , vol. 19, 2012
2012
Earlier work this paper cites.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” in Advances in neural information processing systems , 2012, pp. 1097–1105
2012
Cited alongside, same era.
S. King, “Primecoin: Cryptocurrency with prime number proof-of-work,” 2013
2013
Cited alongside, same era.
M. Bellare, V. T. Hoang, S. Keelveedhi, and P. Rogaway, “Efficient garbling from a fixed-key blockcipher,” Cryptology ePrint Archive, Report 2013/426, 2013, https://eprint.iacr.org/2013/426
2013
Cited alongside, same era.
2014
Cited alongside, same era.
A. Miller, A. Juels, E. Shi, B. Parno, and J. Katz, “Permacoin: Repurposing bitcoin work for data preservation,” in Security & Privacy , 2014
P. Daian, I. Eyal, A. Juels, and E. G. Sirer, “(short paper) piecework: Generalized outsourcing control for proofs of work,” in International Conference on Financial Cryptography and Data Security . Springer, 2017, pp. 182–190
2017
Later among the works it cites.
G.-T. Nguyen and K. Kim, “A survey about consensus algorithms used in blockchain.” Journal of Information processing systems , vol. 14, no. 1, 2018
2018
Later among the works it cites.
B. D. Rouhani, M. S. Riazi, and F. Koushanfar, “Deepsecure: Scalable provably-secure deep learning,” in Proceedings of the 55th Annual Design Automation Conference . ACM, 2018, p. 2
2018
Later among the works it cites.
Digiconomist, “Bitcoin energy consumption index,” 2019, [Online]. Available: https://digiconomist.net/bitcoin-energy-consumption,
2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
R. Gilad-Bachrach, N. Dowlin, K. Laine, K. Lauter, M. Naehrig, and J. Wernsing, “Cryptonets: Applying neural networks to encrypted data with high throughput and accuracy,” in International Conference on Machine Learning , 2016, pp. 201–210
2016
Cited alongside, same era.
A. Shoker, “Sustainable blockchain through proof of exercise,” in 2017 IEEE 16th International Symposium on Network Computing and Applications (NCA) . IEEE, 2017, pp. 1–9
2017
Cited alongside, same era.
S. Abdel-Hafeez and A. Gordon-Ross, “An efficient o ( n n ) comparison-free sorting algorithm,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems , vol. 25, no. 6, pp. 1930–1942, 2017
2017
Cited alongside, same era.
M. Ball, A. Rosen, M. Sabin, and P. N. Vasudevan, “Proofs of useful work.” IACR Cryptology ePrint Archive , vol. 2017, p. 203, 2017
2017
Cited alongside, same era.
B. Li, C. Chenli, X. Xu, T. Jung, and Y. Shi, “Exploiting computation power of blockchain for biomedical image segmentation,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops , 2019, pp. 0–0
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
BTC, 2019, [Online]. Available: https://bitnodes.earn.com/
2019
Closest in time.