Efficient memory bound puzzles using pattern databases

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

Volumn 3989 LNCS, Issue , 2006, Pages 98-113

  Doshi, Sujata ^a   Monrose, Fabian ^a   Rubin, Aviel D ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CACHE MEMORY; COMPUTER CRIME; CONSTRAINT THEORY; HEURISTIC METHODS; PROGRAM PROCESSORS;

ALGORITHMIC FOUNDATION; CPU BOUND CLIENT PUZZLES; CPU SPEEDS; IMPACT PUZZLE CREATION;

DATABASE SYSTEMS;

EID: 33746586067     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11767480_7     Document Type: Conference Paper

References (26)

1. Abadi, M., Burrows, M., Manasse, M., Wobber, T.: Moderately hard, memory-bound functions. In: Proceedings of Network and Distributed Systems Security Symposium, San Diego, California, USA. (February 2003) 107-121
2. Dwork, C., Goldberg, A., Naor, M.: On memory-bound functions for fighting spam. In: Proceedings of the 23rd Annual International Cryptology Conference. (2003) 426-444
3. Juels, A., Brainard, J.: Client puzzles: A cryptographic countermeasure against connection depletion attacks. In: Proceedings of Networks and Distributed Security Systems. (February 1999) 151-165
4. Dean, D., Stubblefield, A.: Using client puzzles to protect TLS. In: Proceedings of the 10th USENIX Security Symposium. (August 2001) 1-8
5. Wang, X., Reiter, M.K.: Defending against Denial-of-Service attacks with puzzle auctions. In: Proceedings of the IEEE Symposium on Security and Privacy, IEEE Computer Society (2003) 78-92
6. Waters, B., Juels, A., Halderman, J.A., Felten, E.W.: New client puzzle outsourcing techniques for DoS resistance. In: Proceedings of the 11 th ACM conference on Computer and Communications Security. (2004) 246-256
7. Bernstein, D.J.: SYN cookies (1996) http://cr.yp.to/syncookies.html.
8. Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking 1(4) (1993) 397-413
9. Loyd, S.: Mathematical Puzzles of Sam Loyd. Dover (1959) Selected and Edited by Martin Gardner.
10. Singmaster, D.: Notes on Rubik's Magic Cube. Enslow Pub Inc. (1981)
11. Korf, R.: Finding Optimal Solutions to Rubik's Cube Using Pattern Databases. In: Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference, Rhode Island, AAAI Press/MIT Press (July 1997) 700-705
12. Hern'advolgyi, I.T., Holte, R.C.: Experiments with automatically created memory-based heuristics. In: Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation, London, UK, Springer-Verlag (2000) 281-290
13. Bocan, V.: Threshold puzzles: The evolution of DoS-resistant authentication. Periodica Politechnica, Transactions on Automatic Control and Computer Science 49(63) (2004)
14. Merkle, R.C.: Secure communications over insecure channels. Communications of ACM 21(4) (April 1978) 294-299
15. Back, A.: Hash cash - A Denial of Service Counter-Measure. Technical report (2002) http://www.hashcash.org/.
16. Wang, X., Reiter, M.K.: Mitigating bandwidth-exhaustion attacks using congestion puzzles. In: Proceedings of the 11th ACM conference on Computer and Communications Security, New York, NY, USA, ACM Press (2004) 257-267
17. Rosenthal, D.S.H.: On the cost distribution of a memory bound function. Computing Research Repository cs.CR/0311005 (2003)
18. Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4(2) (1968) 100-107
19. Hart, P.E., Nilsson, N.J., Raphael, B.: Correction to a formal basis for the heuristic determination of minimum cost paths. ACM SIGART Bulletin (37) (1972) 28-29
20. Parberry, I.: A real-time algorithm for the (n2 - 1)-puzzle. Information Processing Letters 56(1) (1995) 23-28
21. Culberson, J.C., Schaeffer, J.: Searching with pattern databases. In: Advances in Artificial Intelligence, 11th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, Springer (1996) 402-416
22. Holte, R.C., Hern'advolgyi, I.T.: A space-time tradeoff for memory-based heuristics. In: Proceedings of the 16th national conference on Artificial Intelligence and the 11th Innovative Applications of Artificial Intelligence conference, Menlo Park, CA, USA, American Association for Artificial Intelligence (1999) 704-709
23. FIPS: The Keyed-Hash Message Authentication Code (HMAC). (2002) http://csrc.nist.gov/publications/fips/fips198/fips-198a.pdf.
24. Korf, R.E.: Recent progress in the design and analysis of admissible heuristic functions. In: Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI Press / The MIT Press (2000) 1165-1170
25. Korf, R.E., Reid, M.: Complexity analysis admissible heuristic search. In: Proceedings of the 15th national/10th conference on Artificial Intelligence/Innovative Applications of Artificial intelligence, Menlo Park, CA, USA, American Association for Artificial Intelligence (1998) 305-310
26. Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4) (1986) 792-807