{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:06:03Z","timestamp":1725494763699},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540769682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76969-9_16","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T06:32:49Z","timestamp":1195021969000},"page":"247-264","source":"Crossref","is-referenced-by-count":25,"title":["Toward Non-parallelizable Client Puzzles"],"prefix":"10.1007","author":[{"given":"Suratose","family":"Tritilanunt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"Boyd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernest","family":"Foo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Manuel","family":"Gonz\u00e1lez Nieto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L M.: On Breaking Generalized Knapsack Public Key Cryptosystems. In: the 15th Annual ACM Symposium on Theory of Computing, pp. 402\u2013412 (1983)","DOI":"10.1145\/800061.808771"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Aura, T., Nikander, P., Leiwo, J.: DoS-resistant authentication with client puzzles. In: Security Protocols Workshop 2000, Cambridge, pp. 170\u2013181 (April 2000)","DOI":"10.1007\/3-540-44810-1_22"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/944618.944619","volume":"7","author":"W. Backes","year":"2002","unstructured":"Backes, W., Wetzel, S.: Heuristics on Lattice Basis Reduction in Practice. Journal of Experimental Algorithmics (JEA)\u00a07, 1\u201321 (2002)","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"M.J. Coster","year":"1992","unstructured":"Coster, M.J., Joux, A., LaMacchia, B.A., Odlyzko, A.M., Schnorr, C., Stern, J.: Improved low-density subset sum algorithms. Computational Complexity\u00a02(2), 111\u2013128 (1992)","journal-title":"Computational Complexity"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","first-page":"139","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"C. Dwork","year":"1992","unstructured":"Dwork, C., Naor, M.: Pricing via Processing or Combatting Junk Mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 139\u2013147. Springer, Heidelberg (1992)"},{"key":"16_CR6","unstructured":"Feng, W., Kaiser, E., Feng, W., Luu, A.: The Design and Implementation of Network Layer Puzzles. In: Proceedings of IEEE Infocom 2005 (March 13-17, 2005)"},{"key":"16_CR7","unstructured":"Feng, W., Luu, A., Feng, W.: Scalable, Fine-grained Control of Network Puzzles. Technical report 03-015, OGI CSE (2003)"},{"key":"16_CR8","unstructured":"Gao, Y.: Efficient Trapdoor-Based Client Puzzle System against DoS Attacks. In: Master of Computer Science by Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia (2005)"},{"key":"16_CR9","unstructured":"Groza, B., Petrica, D.: On Chained Cryptographic Puzzles. In: 3rd Romanian-Hungarian Joint Symposium on Applied Computational Intelligence (SACI), Timisoara, Romania, pp. 25\u201326 (May 2006)"},{"key":"16_CR10","first-page":"151","volume-title":"NDSS 1999. The 1999 Network and Distributed System Security Symposium","author":"A. Juels","year":"1999","unstructured":"Juels, A., Brainard, J.: Client Puzzles: A Cryptographic Defense Against Connection Depletion Attacks. In: NDSS 1999. The 1999 Network and Distributed System Security Symposium, San Diego, California, USA, pp. 151\u2013165. Internet Society Press, Reston (1999)"},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"J.C. Lagarias","year":"1985","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. Journal of the ACM (JACM)\u00a032(1), 229\u2013246 (1985)","journal-title":"Journal of the ACM (JACM)"},{"key":"16_CR12","unstructured":"LaMacchia, B.A.: Basis Reduction Algorithms and Subset Sum Problems. Master Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (1991)"},{"issue":"4","key":"16_CR13","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lov\u00e1sz, L.: Factoring Polynomials with Rational Coefficients. Mathematische Annalen\u00a0261(4), 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Ma, M.: Mitigating denial of service attacks with password puzzles. In: ITCC 2005. International Conference on Information Technology: Coding and Computing, 2nd edn., pp. 621\u2013626 (2005)","DOI":"10.1109\/ITCC.2005.200"},{"key":"16_CR15","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, Inc., Chichester (1990)"},{"key":"16_CR16","unstructured":"Moskowitz, R.: The Host Identity Protocol (HIP). Internet Draft, Internet Engineering Task Force (October 2007), http:\/\/www.ietf.org\/internet-drafts\/draft-ietf-hip-base-09.txt"},{"key":"16_CR17","first-page":"16","volume-title":"9th IMA International Conference on Cryptography and Coding","author":"G. Price","year":"2003","unstructured":"Price, G.: A General Attack Model on Hash-Based Client Puzzles. In: 9th IMA International Conference on Cryptography and Coding, Cirencester, UK, pp. 16\u201318. Springer, Heidelberg (2003)"},{"key":"16_CR18","first-page":"49","volume":"3","author":"S. Radziszowski","year":"1988","unstructured":"Radziszowski, S., Kreher, D.: Solving subset sum problems with the L 3 algorithm. Journal of Combinatorial Mathematics and Combinatorial Computing\u00a03, 49\u201363 (1988)","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"16_CR19","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock Puzzles and Timed-release Crypto. Technical Report TR-684, Massachusetts Institute of Technology, Cambridge, MA, USA (March 10, 1996)"},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2005.04.004","volume":"204","author":"C.P. Schnorr","year":"2006","unstructured":"Schnorr, C.P.: Fast LLL-type Lattice Reduction. Information and Computation\u00a0204(1), 1\u201325 (2006)","journal-title":"Information and Computation"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-54458-5_51","volume-title":"Fundamentals of Computation Theory","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P., Euchner, M.: Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. In: Budach, L. (ed.) FCT 1991. LNCS, vol.\u00a0529, pp. 68\u201385. Springer, Heidelberg (1991)"},{"key":"16_CR22","volume-title":"Cryptography: An Introduction","author":"N. Smart","year":"2006","unstructured":"Smart, N.: Cryptography: An Introduction, 2nd edn. McGraw-Hill, New York (2006)","edition":"2"},{"key":"16_CR23","first-page":"269","volume-title":"ISSAC 1992. The International Symposium on Symbolic and Algebraic Computation","author":"G. Villard","year":"1992","unstructured":"Villard, G.: Parallel Lattice Basis Reduction. In: ISSAC 1992. The International Symposium on Symbolic and Algebraic Computation, pp. 269\u2013277. ACM Press, New York (1992)"},{"key":"16_CR24","unstructured":"Wang, X., Reiter, M.K.: Defending Against Denial-of-Service Attacks with Puzzle Auctions (Extended Abstract). In: SP 2003. The 2003 IEEE Symposium on Security and Privacy, Berkeley, CA, USA, pp. 78\u201392 (May 11-13, 2003)"},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/1030083.1030117","volume-title":"CCS 2004. The 11th ACM Conference on Computer and Communications Security","author":"B. Waters","year":"2004","unstructured":"Waters, B., Juels, A., Halderman, J.A., Felten, E.W.: New Client Puzzle Outsourcing Techniques for DoS Resistance. In: CCS 2004. The 11th ACM Conference on Computer and Communications Security, pp. 246\u2013256. ACM Press, Washington DC (2004)"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76969-9_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:50:52Z","timestamp":1619520652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76969-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540769682"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76969-9_16","relation":{},"subject":[]}}