{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:34:52Z","timestamp":1725543292469},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354376"},{"type":"electronic","value":"9783540354383"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11767480_7","type":"book-chapter","created":{"date-parts":[[2006,7,4]],"date-time":"2006-07-04T05:21:27Z","timestamp":1151990487000},"page":"98-113","source":"Crossref","is-referenced-by-count":10,"title":["Efficient Memory Bound Puzzles Using Pattern Databases"],"prefix":"10.1007","author":[{"given":"Sujata","family":"Doshi","sequence":"first","affiliation":[]},{"given":"Fabian","family":"Monrose","sequence":"additional","affiliation":[]},{"given":"Aviel D.","family":"Rubin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"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, 2003, pp. 107\u2013121 (February 2003)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Dwork, C., Goldberg, A., Naor, M.: On memory-bound functions for fighting spam. In: Proceedings of the 23rd Annual International Cryptology Conference, pp. 426\u2013444 (2003)","DOI":"10.1007\/978-3-540-45146-4_25"},{"key":"7_CR3","unstructured":"Juels, A., Brainard, J.: Client puzzles: A cryptographic countermeasure against connection depletion attacks. In: Proceedings of Networks and Distributed Security Systems, pp. 151\u2013165 (February 1999)"},{"key":"7_CR4","unstructured":"Dean, D., Stubblefield, A.: Using client puzzles to protect TLS. In: Proceedings of the 10th USENIX Security Symposium, pp. 1\u20138 (August 2001)"},{"key":"7_CR5","first-page":"78","volume-title":"Proceedings of the IEEE Symposium on Security and Privacy, IEEE Computer Society","author":"X. Wang","year":"2003","unstructured":"Wang, X., Reiter, M.K.: Defending against Denial-of-Service attacks with puzzle auctions. In: Proceedings of the IEEE Symposium on Security and Privacy, pp. 78\u201392. IEEE Computer Society, Los Alamitos (2003)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Waters, B., Juels, A., Halderman, J.A., Felten, E.W.: New client puzzle outsourcing techniques for DoS resistance. In: Proceedings of the 11th ACM conference on Computer and Communications Security, pp. 246\u2013256 (2004)","DOI":"10.1145\/1030083.1030117"},{"key":"7_CR7","unstructured":"Bernstein, D.J.: SYN cookies (1996), http:\/\/cr.yp.to\/syncookies.html"},{"issue":"4","key":"7_CR8","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/90.251892","volume":"1","author":"S. Floyd","year":"1993","unstructured":"Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance. IEEE\/ACM Transactions on Networking\u00a01(4), 397\u2013413 (1993)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"7_CR9","unstructured":"Loyd, S.: Mathematical Puzzles of Sam Loyd. Dover (1959), Selected and Edited by Martin Gardner"},{"key":"7_CR10","unstructured":"Singmaster, D.: Notes on Rubik\u2019s Magic Cube. Enslow Pub. Inc. (1981)"},{"key":"7_CR11","first-page":"700","volume-title":"Proceedings of the 14 th National Conference on Artificial Intelligence and 9 th Innovative Applications of Artificial Intelligence Conference","author":"R. Korf","year":"1997","unstructured":"Korf, R.: Finding Optimal Solutions to Rubik\u2019s Cube Using Pattern Databases. In: Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference, Rhode Island pp. 700\u2013705. AAAI Press\/MIT Press (1997)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-44914-0_18","volume-title":"Abstraction, Reformulation, and Approximation","author":"I.T. Hern\u2019advolgyi","year":"2000","unstructured":"Hern\u2019advolgyi, I.T., Holte, R.C.: Experiments with automatically created memory-based heuristics. In: Choueiry, B.Y., Walsh, T. (eds.) SARA 2000. LNCS, vol.\u00a01864, pp. 281\u2013290. Springer, Heidelberg (2000)"},{"key":"7_CR13","unstructured":"Bocan, V.: Threshold puzzles: The evolution of DoS-resistant authentication. Periodica Politechnica, Transactions on Automatic Control and Computer Science\u00a049(63) (2004)"},{"issue":"4","key":"7_CR14","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1145\/359460.359473","volume":"21","author":"R.C. Merkle","year":"1978","unstructured":"Merkle, R.C.: Secure communications over insecure channels. Communications of ACM\u00a021(4), 294\u2013299 (1978)","journal-title":"Communications of ACM"},{"key":"7_CR15","unstructured":"Back, A.: Hash cash - A Denial of Service Counter-Measure. Technical report (2002), http:\/\/www.hashcash.org\/"},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1145\/1030083.1030118","volume-title":"Proceedings of the 11 th ACM conference on Computer and Communications Security","author":"X. Wang","year":"2004","unstructured":"Wang, X., Reiter, M.K.: Mitigating bandwidth-exhaustion attacks using congestion puzzles. In: Proceedings of the 11th ACM conference on Computer and Communications Security, pp. 257\u2013267. ACM Press, New York (2004)"},{"key":"7_CR17","unstructured":"Rosenthal, D.S.H.: On the cost distribution of a memory bound function. Computing Research Repository. cs.CR\/0311005 (2003)"},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"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\u00a04(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/1056777.1056779","volume":"37","author":"P.E. Hart","year":"1972","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: Correction to a formal basis for the heuristic determination of minimum cost paths. ACM SIGART Bulletin\u00a037, 28\u201329 (1972)","journal-title":"ACM SIGART Bulletin"},{"issue":"1","key":"7_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0020-0190(95)00134-X","volume":"56","author":"I. Parberry","year":"1995","unstructured":"Parberry, I.: A real-time algorithm for the (n 2\u2009\u2212\u20091)-puzzle. Information Processing Letters\u00a056(1), 23\u201328 (1995)","journal-title":"Information Processing Letters"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-61291-2_68","volume-title":"Advances in Artificial Intelligence","author":"J.C. Culberson","year":"1996","unstructured":"Culberson, J.C., Schaeffer, J.: Searching with pattern databases. In: McCalla, G.I. (ed.) Canadian AI 1996. LNCS, vol.\u00a01081, pp. 402\u2013416. Springer, Heidelberg (1996)"},{"key":"7_CR22","unstructured":"Holte, R.C., Hern\u2019advolgyi, 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, pp. 704\u2013709, American Association for Artificial Intelligence, Menlo Park (1999)"},{"key":"7_CR23","unstructured":"FIPS: The Keyed-Hash Message Authentication Code (HMAC) (2002), http:\/\/csrc.nist.gov\/publications\/fips\/fips198\/fips-198a.pdf"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"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, pp. 1165\u20131170. AAAI Press \/ The MIT Press (2000)","DOI":"10.1007\/3-540-44914-0_3"},{"key":"7_CR25","unstructured":"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, pp. 305\u2013310, American Association for Artificial Intelligence, Menlo Park (1998)"},{"issue":"4","key":"7_CR26","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","RoboCup 2005: Robot Soccer World Cup IX"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11767480_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,29]],"date-time":"2021-07-29T04:37:12Z","timestamp":1627533432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11767480_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354376","9783540354383"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11767480_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}