-
8
-
-
84884489949
-
Time-optimal interactive proofs for circuit evaluation
-
Justin Thaler. Time-optimal interactive proofs for circuit evaluation. In Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part II, pages 71-89, 2013.
-
(2013)
Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings
, pp. 71-89
-
-
Thaler, J.1
-
9
-
-
84856468957
-
Practical verified computation with streaming interactive proofs
-
Graham Cormode, Michael Mitzenmacher, and Justin Thaler. Practical verified computation with streaming interactive proofs. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS'12, pages 90-112, 2012.
-
(2012)
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS'12
, pp. 90-112
-
-
Cormode, G.1
Mitzenmacher, M.2
Thaler, J.3
-
10
-
-
84873940588
-
Making argument systems for outsourced computation practical (sometimes)
-
Srinath T. V. Setty, Richard McPherson, Andrew J. Blumberg, and Michael Walfish. Making argument systems for outsourced computation practical (sometimes). In 19th Annual Network and Distributed System Security Symposium, NDSS, pages 253-268, 2012.
-
(2012)
19th Annual Network and Distributed System Security Symposium, NDSS
, pp. 253-268
-
-
Setty, S.T.V.1
McPherson, R.2
Blumberg, A.J.3
Walfish, M.4
-
11
-
-
84889685593
-
Snarks for c: Verifying program executions succinctly and in zero knowledge
-
Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, and Madars Virza. Snarks for c: Verifying program executions succinctly and in zero knowledge. Cryptology ePrint Archive, Report 2013/507, 2013. http://eprint.iacr.org/.
-
(2013)
Cryptology EPrint Archive, Report 2013/507
-
-
Ben-Sasson, E.1
Chiesa, A.2
Genkin, D.3
Tromer, E.4
Virza, M.5
-
12
-
-
84889685086
-
Verifying computations with state
-
Benjamin Braun, Ariel J. Feldman, Zuocheng Ren, Srinath Setty, Andrew J. Blumberg, and Michael Walfish. Verifying computations with state. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, SOSP'13, pages 341-357, 2013.
-
(2013)
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, SOSP'13
, pp. 341-357
-
-
Braun, B.1
Feldman, A.J.2
Ren, Z.3
Setty, S.4
Blumberg, A.J.5
Walfish, M.6
-
13
-
-
85076228457
-
Taking proof-based verified computation a few steps closer to practicality
-
Security'12
-
Srinath Setty, Victor Vu, Nikhil Panpalia, Benjamin Braun, Andrew J. Blumberg, and Michael Walfish. Taking proof-based verified computation a few steps closer to practicality. In Proceedings of the 21st USENIX Conference on Security Symposium, Security'12, 2012.
-
(2012)
Proceedings of the 21st USENIX Conference on Security Symposium
-
-
Setty, S.1
Vu, V.2
Panpalia, N.3
Braun, B.4
Blumberg, A.J.5
Walfish, M.6
-
14
-
-
84881259359
-
Pinocchio: Nearly practical verifiable computation
-
Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova. Pinocchio: Nearly practical verifiable computation. In Proceedings of the 2013 IEEE Symposium on Security and Privacy, SP'13, pages 238-252, 2013.
-
(2013)
Proceedings of the 2013 IEEE Symposium on Security and Privacy, SP'13
, pp. 238-252
-
-
Parno, B.1
Howell, J.2
Gentry, C.3
Raykova, M.4
-
15
-
-
84945176880
-
SoK: Research perspectives and challenges for bitcoin and cryptocurrencies
-
May
-
Joseph Bonneau, Andrew Miller, Jeremy Clark, Arvind Naryanan, Joshua A. Kroll, and Edward W. Felten. SoK: Research Perspectives and Challenges for Bitcoin and Cryptocurrencies. In IEEE Security and Privacy 2015, May 2015.
-
(2015)
IEEE Security and Privacy 2015
-
-
Bonneau, J.1
Miller, A.2
Clark, J.3
Naryanan, A.4
Kroll, J.A.5
Felten, E.W.6
-
16
-
-
84914117917
-
Permacoin: Repurposing bitcoin work for long-term data preservation
-
A Miller, A Juels, E Shi, B Parno, and J Katz. Permacoin: Repurposing bitcoin work for long-term data preservation. IEEE Security and Privacy, 2014.
-
(2014)
IEEE Security and Privacy
-
-
Miller, A.1
Juels, A.2
Shi, E.3
Parno, B.4
Katz, J.5
-
18
-
-
84910677439
-
Zerocash: Decentralized anonymous payments from bitcoin
-
Eli Ben Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, and Madars Virza. Zerocash: Decentralized anonymous payments from bitcoin. In Proceedings of the 2014 IEEE Symposium on Security and Privacy, SP'14, 2014.
-
(2014)
Proceedings of the 2014 IEEE Symposium on Security and Privacy, SP'14
-
-
Ben Sasson, E.1
Chiesa, A.2
Garman, C.3
Green, M.4
Miers, I.5
Tromer, E.6
Virza, M.7
-
20
-
-
84910660043
-
Secure multiparty computations on bitcoin
-
IEEE Computer Society
-
Marcin Andrychowicz, Stefan Dziembowski, Daniel Malinowski, and Lukasz Mazurek. Secure multiparty computations on bitcoin. In Proceedings of the 2014 IEEE Symposium on Security and Privacy, SP'14, pages 443-458. IEEE Computer Society, 2014.
-
(2014)
Proceedings of the 2014 IEEE Symposium on Security and Privacy, SP'14
, pp. 443-458
-
-
Andrychowicz, M.1
Dziembowski, S.2
Malinowski, D.3
Mazurek, L.4
-
21
-
-
84905409094
-
How to use bitcoin to design fair protocols
-
Iddo Bentov and Ranjit Kumaresan. How to use bitcoin to design fair protocols. In Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part II, pages 421-439, 2014.
-
(2014)
Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings
, pp. 421-439
-
-
Bentov, I.1
Kumaresan, R.2
-
24
-
-
84954128379
-
-
May
-
Andrew Miller, James Litton, Andrew Pachulski, Neil Spring Neal Gupta, Dave Levin, and Bobby Bhattacharjee. Discovering Bitcoin's public topology and inuential nodes. http://cs.umd.edu/projects/coinscope/coinscope.pdf, May 2015.
-
(2015)
Discovering Bitcoin's Public Topology and Inuential Nodes
-
-
Miller, A.1
Litton, J.2
Pachulski, A.3
Gupta, N.S.N.4
Levin, D.5
Bhattacharjee, B.6
-
28
-
-
79955434234
-
Proving program termination
-
May
-
Byron Cook, Andreas Podelski, and Andrey Rybalchenko. Proving program termination. Commun. ACM, 54(5):88-98, May 2011.
-
(2011)
Commun ACM
, vol.54
, Issue.5
, pp. 88-98
-
-
Cook, B.1
Podelski, A.2
Rybalchenko, A.3
-
31
-
-
0002572651
-
Regular partitions of graphs
-
volume 260 of Colloq. Internat. CNRS
-
Endre Szemerédi. Regular partitions of graphs. In Problèmes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), volume 260 of Colloq. Internat. CNRS, pages 399-401. 1978.
-
(1978)
Problèmes Combinatoires et Théorie des Graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976)
, pp. 399-401
-
-
Szemerédi, E.1
-
32
-
-
55249124059
-
Every monotone graph property is testable
-
Noga Alon and Asaf Shapira. Every monotone graph property is testable. SIAM Journal on Computing, 38(2):505-522, 2008.
-
(2008)
SIAM Journal on Computing
, vol.38
, Issue.2
, pp. 505-522
-
-
Alon, N.1
Shapira, A.2
-
38
-
-
84961311373
-
On power splitting games in distributed computation: The case of bitcoin pooled mining
-
July
-
Loi Luu, Ratul Saha, Inian Parameshwaran, Prateek Saxena, and Aquinas Hobor. On power splitting games in distributed computation: The case of bitcoin pooled mining. The 28th IEEE Computer Security Foundations Symposium, July 2015.
-
(2015)
The 28th IEEE Computer Security Foundations Symposium
-
-
Luu, L.1
Saha, R.2
Parameshwaran, I.3
Saxena, P.4
Hobor, A.5
-
43
-
-
84954153747
-
Hawk: The blockchain model of cryptography and privacy-preserving smart contracts
-
Ahmed Kosba, Andrew Miller, Elaine Shi, Zikai Wen, and Charalampos Papamanthou. Hawk: The blockchain model of cryptography and privacy-preserving smart contracts. Cryptology ePrint Archive, Report 2015/675, 2015. http://eprint.iacr.org/.
-
(2015)
Cryptology EPrint Archive Report 2015/675
-
-
Kosba, A.1
Miller, A.2
Shi, E.3
Wen, Z.4
Papamanthou, C.5
|