Pebbling and proofs of work

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3621 LNCS, Issue , 2006, Pages 37-54

  Dwork, Cynthia ^a   Naor, Moni ^b   Wee, Hoeteck ^c  

^a MICROSOFT RESEARCH   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LARGE RANDOM TABLE; MEMORY ACCESSES; MEMORY-BOUND FUNCTION; SERVICE ATTACKS;

COMPUTATIONAL METHODS; DATA STORAGE EQUIPMENT; EMBEDDED SYSTEMS; FUNCTION EVALUATION; INFORMATION TECHNOLOGY; SECURITY OF DATA;

COMPUTER CRIME;

EID: 33745136796     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. M. Abadi, M. Burrows, M. Manasse, and T. Wobber. Moderately hard, memory-bound functions. In Proc. 10th NDSS, 2003.
2. M. Ajtai. Determinism versus non-determinism for linear time RAMs. In Proc. 31st STOC, pages 632-641, 1999.
3. M. Ajtai. A non-linear time lower bound for boolean branching programs. In Proc. 40th FOCS, pages 60-70, 1999.
4. N. Alon and M. Capalbo. Smaller explicit superconcentrators. Internet Mathematics, 1(2):151-163, 2003.
5. N. Alon and F. Chung. Explicit constructions of linear-sized tolerant networks. Discrete Math, 72:15-20, 1988.
6. A. Back. Hashcash - a denial of servie counter-measure. Available at http://www.cypherspace.org/hashcash/hashcash.pdf.
7. P. Beame, M. E. Saks, X. Sun, and E. Vee. Super-linear time-space tradeoff lower bounds for randomized computation. In Proc. 41st FOCS, pages 169-179, 2000.
8. A. Borodin and S. Cook. A time-space tradeoff for sorting on a general sequential model of computation. SIAM J. Comput., 11(2):287-297, 1982.
9. S. Cook. An observation on time-storage trade off. JCSS, 9(3):308-316, 1974.
10. D. Dolev, C. Dwork, N. Pippenger, and A. Wigderson. Superconcentrators, generalizers, and generalized connectors with limited depth. In Proc. 15th STOC, pages 42-51, 1983.
11. C. Dwork, A. V. Goldberg, and M. Naor. On memory-bound functions for fighting spam. In Advances in Cryptology - CRYPTO'03, pages 426-444, 2003.
12. C. Dwork and M. Naor. Pricing via processing, or, combatting junk mail. In Advances in Cryptology - CRYPTO'92, pages 139-147, 1993.
13. T. Lengauer and R.E. Tarjan. Asymptotically tight bounds on time-space trade-offs in a pebble game. JACM, 29(4):1087-1130, 1982.
14. W. Paul, R. E. Tarjan, and J. R. Celoni. Space bounds for a game on graphs. In Proc. 8th STOC, pages 149-160, 1976.
15. N. Pippenger. Superconcentrators. SIAM J. Comput., 6(2):298-304, 1977.
16. M. Tompa. Time-space tradeoffs for computing functions, using connectivity properties of their circuits. JCSS, 20(2):118-132, 1980.
17. E. Upfal. Tolerating linear number of faults in networks of bounded degree. In Proc. 11th PODC, pages 83-89, 1992.
18. L. G. Valiant. On non-linear lower bounds in computational complexity. In Proc. 7th STOC, pages 45-53, 1975.