High parallel complexity graphs and memory-hard functions

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 14-17-June-2015, Issue , 2015, Pages 595-603

  Alwen, Joël ^a   Serbinenko, Vladimir ^b  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

PROM; QUERY PROCESSING;

COMPLEXITY MEASURES; EXPLICIT CONSTRUCTIONS; PARALLEL COMPLEXITY; PARALLEL COMPUTATION; POLY-LOGARITHMIC FACTORS; RANDOM ORACLE MODEL; SECURITY PRIMITIVES; TECHNICAL CONTRIBUTION;

GRAPHIC METHODS;

EID: 84958742084     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2746539.2746622     Document Type: Conference Paper

References (51)

1. 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/.
2. Adam Back. Hashcash - A Denial of Service Counter-Measure, 2002.
3. Joël Alwen and Vladimir Serbinenko. High parallel complexity graphs and memory-hard functions. Cryptology ePrint Archive Report 2014/238 2014. https://eprint.iacr.org/2014/238.
4. Vitalik Buterin, Anthony Di Lorio, Charles Hoskinson, and Mihai Alisie. Ethereum: A Distributed Cryptographic Leger, 2013.
5. Charles H. Bennett. Time/space trade-offs for reversible computation. SIAM J. Comput., 18(4):766-776, 1989.
6. Joseph Bonneau and Ilya Mironov. Cache-collision timing attacks against aes. In Cryptographic Hardware and Embedded Systems - CHES 2006, 8th International Workshop, volume 4249 of Lecture Notes in Computer Science, pages 201-215. Springer, 2006.
7. Ashok K. Chandra. Efficient compilation of linear recursive programs. In SWAT (FOCS), pages 16-25. IEEE Computer Society, 1973.
8. Charles Lee. Litecoin, 2011.
9. Siu Man Chan. Just a pebble game. In IEEE Conference on Computational Complexity, pages 133-143. IEEE, 2013.
10. Stephen A. Cook. An observation on time-storage trade off. In Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, STOC '73, pages 29-33, New York, NY, USA, 1973. ACM.
11. Stefan Dziembowski, Sebastian Faust, Vladimir Kolmogorov and Krzysztof Pietrzak. Proofs of space. Cryptology ePrint Archive Report 2013/796 2013. http://eprint.iacr.org/.
12. Cynthia Dwork, Andrew Goldberg, and Moni Naor. On memory-bound functions for fighting spam. In Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings, volume 2729 of Lecture Notes in Computer Science, pages 426-444. Springer, 2003.
13. Stefan Dziembowski, Tomasz Kazana, and Daniel Wichs. One-time computable self-erasing functions. In Yuval Ishai, editor, TCC, volume 6597 of Lecture Notes in Computer Science, pages 125-143. Springer, 2011.
14. Cynthia Dwork and Moni Naor. Pricing via processing or combatting junk mail. In Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO '92, pages 139-147, London, UK, UK, 1993. Springer-Verlag.
15. Cynthia Dwork, Moni Naor, and Hoeteck Wee. Pebbling and proofs of work. In Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings, volume 3621 of Lecture Notes in Computer Science, pages 37-54. Springer, 2005.
16. Patrick W. Dymond and Martin Tompa. Speedups of deterministic machines by synchronous parallel machines. J. Comput. Syst. Sci., 30(2):149-161, 1985.
17. Paul Erdoes, Ronald L. Graham, and Endre Szemeredi. On sparse graphs with dense long paths. Technical report, Stanford, CA, USA, 1975.
18. Christian Forler, Stefan Lucks and Jakob Wenzel. Catena: A memory-consuming password scrambler. Cryptology ePrint Archive Report 2013/525 2013. http://eprint.iacr.org/.
19. Matthew K. Franklin and Dahlia Malkhi. Auditable metering with lightweight security. Journal of Computer Security, 6(4):237-256, 1998.
20. Electronic Frontier Foundation. Cracking DES: Secrets of Encryption Research, Wiretap Politics and Chip Design. O'Reilly & Associates, Inc., Sebastopol, CA, USA, 1998.
21. Jeremi Gosney. Password Cracking HPC. Presented at Password12 in Oslo, Norway, 2012.
22. Carl E. Hewitt and Michael S. Paterson. Record of the project mac conference on concurrent systems and parallel computation. chapter Comparative Schematology, pages 119-127. ACM, New York, NY, USA, 1970.
23. John Hopcroft, Wolfgang Paul, and Leslie Valiant. On time versus space. J. ACM, 24(2):332-337, April 1977.
24. Ari Juels and John G. Brainard. Client puzzles: A cryptographic countermeasure against connection depletion attacks. In Proceedings of the Network and Distributed System Security Symposium, NDSS 1999, San Diego, California, USA. The Internet Society, 1999.
25. Markus Jakobsson and Ari Juels. Proofs of work and bread pudding protocols. In Proceedings of the IFIP TC6/TC11 Joint Working Conference on Secure Information Networks: Communications and Multimedia Security, CMS '99, pages 258-272, Deventer, The Netherlands, The Netherlands, 1999. Kluwer, B.V.
26. Yves Igor Jerschow and Martin Mauve. Non-parallelizable and non-interactive client puzzles from modular square roots. In ARES, pages 135-142. IEEE, 2011.
27. Ghassan O. Karame and Srdjan Cəpkun. Low-cost client puzzles based on modular exponentiation. In Proceedings of the 15th European Conference on Research in Computer Security, ESORICS'10, pages 679-697, Berlin, Heidelberg, 2010. Springer-Verlag.
28. Thomas Lengauer and Robert E. Tarjan. Asymptotically tight bounds on time-space trade-offs in a pebble game. J. ACM, 29(4):1087-1130, October 1982.
29. Miguel Freitas. Twister: Peer-to-Peer Microblogging, 2013.
30. Mohammad Mahmoody, Tal Moran, and Salil P. Vadhan. Time-lock puzzles in the random oracle model. In Phillip Rogaway, editor, CRYPTO, volume 6841 of Lecture Notes in Computer Science, pages 39-50. Springer, 2011.
31. Mohammad Mahmoody, Tal Moran, and Salil Vadhan. Publicly verifiable proofs of sequential work. In Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, ITCS '13, pages 373-388, New York, NY, USA, 2013. ACM.
32. Satoshi Nakamoto. Bitcoin: A Peer-to-Peer Electronic Cash System, 2009.
33. Namecoin: A Secure Distributed Key/Value Storage System, 2011.
34. Jackson Palmer. Dogecoin, 2013.
35. C. Percival. Stronger key derivation via sequential memory-hard functions. In BSDCan 2009, 2009.
36. Nicholas Pippenger. Superconcentrators. SIAM J. Comput., 6(2):298-304, 1977.
37. Nicholas Pippenger. Comparative schematology and pebbling with auxiliary pushdowns (preliminary version). In Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, STOC '80, pages 351-356, New York, NY, USA, 1980. ACM.
38. Wolfgang J. Paul, Robert Endre Tarjan, and James R. Celoni. Space bounds for a game on graphs. In Proceedings of the Eighth Annual ACM Symposium on Theory of Computing, STOC '76, pages 149-160, New York, NY, USA, 1976. ACM.
39. Ran Raz and Pierre McKenzie. Separation of the monotone nc hierarchy. Combinatorica, 19(3):403-435, 1999.
40. R. L. Rivest, A. Shamir, and D. A. Wagner. Time-lock puzzles and timed-release crypto. Technical report, Cambridge, MA, USA, 1996.
41. Walter L. Ruzzo. Tree-size bounded alternation(extended abstract). In Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, STOC '79, pages 352-359, New York, NY, USA, 1979. ACM.
42. Georg Schnitger. On depth-reduction and grates. In FOCS, pages 323-328. IEEE Computer Society, 1983.
43. Ravi Sethi. Complete register allocation problems. SIAM J. Comput., 4(3):226-248, 1975.
44. John E. Savage and Sowmitri Swamy. Space-time trade-offs on the fft algorithm. IEEE Transactions on Information Theory, 24(5):563-568, 1978.
45. John E. Savage and Sowmitri Swamy. Space-time tradeoffs for oblivious interger multiplications. In Hermann A. Maurer, editor, ICALP, volume 71 of Lecture Notes in Computer Science, pages 498-504. Springer, 1979.
46. Sowmitri Swamy and John E. Savage. Space-time tradeoffs for linear recursion. In Alfred V. Aho, Stephen N. Zilles, and Barry K. Rosen, editors, POPL, pages 135-142. ACM Press, 1979.
47. Suratose Tritilanunt, Colin A. Boyd, Ernest Foo, and Juan M. Gonzalez Nieto. Toward non-parallelizable client puzzles. Cryptology and Network Security (LNCS), 4856:247-264, 2007.
48. C. D. Thompson. Area-time complexity for vlsi. In Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, STOC '79, pages 81-88, New York, NY, USA, 1979. ACM.
49. Martin Tompa. Time-space tradeoffs for computing functions, using connectivity properties of their circuits. In Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC '78, pages 196-204, New York, NY, USA, 1978. ACM.
50. Leslie G. Valiant. Graph-theoretic arguments in low-level complexity. In Jozef Gruska, editor, MFCS, volume 53 of Lecture Notes in Computer Science, pages 162-176. Springer, 1977.
51. H. Venkateswaran and Martin Tompa. A new pebble game that characterizes parallel complexity classes. SIAM J. Comput., 18(3):533-549, 1989.