{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:59:24Z","timestamp":1725562764174},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137389"},{"type":"electronic","value":"9783642137396"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13739-6_28","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T11:23:50Z","timestamp":1282649030000},"page":"358-365","source":"Crossref","is-referenced-by-count":2,"title":["Performance Evaluation of Non-parallelizable Client Puzzles for Defeating DoS Attacks in Authentication Protocols"],"prefix":"10.1007","author":[{"given":"Suratose","family":"Tritilanunt","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology - CRYPTO 1992","author":"C. Dwork","year":"1993","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 (1993)"},{"key":"28_CR2","unstructured":"Juels, A., Brainard, J.: Client Puzzles: A Cryptographic Defense Against Connection Depletion Attacks. In: the 1999 Network and Distributed System Security Symposium (NDSS 1999), San Diego, California, USA, February 1999, pp. 151\u2013165 (1999)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-44810-1_22","volume-title":"Security Protocols","author":"T. Aura","year":"2001","unstructured":"Aura, T., Nikander, P., Leiwo, J.: DoS-resistant authentication with client puzzles. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2000. LNCS, vol.\u00a02133, pp. 170\u2013181. Springer, Heidelberg (2001)"},{"key":"28_CR4","first-page":"322","volume-title":"ACM SIGCOMM 2003 Workshops","author":"W. Feng","year":"2003","unstructured":"Feng, W.: The case for TCP\/IP Puzzles. In: ACM SIGCOMM 2003 Workshops, Karlsruhe, Germany, August 25-27, pp. 322\u2013327. ACM Press, New York (2003)"},{"key":"28_CR5","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)"},{"key":"28_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: the 11th ACM Conference on Computer and Communications Security (CCS 2004), USA. ACM Press, New York (2004)","DOI":"10.1145\/1030083.1030117"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Juels, A.: Proofs of work and bread pudding protocols. In: The IFIP TC6 and TC11 Joint Working Conference on Communications and Multimedia Security (CMS 1999) (September 1999)","DOI":"10.1007\/978-0-387-35568-9_18"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Bocan, V., Cosma, M.F.: Adaptive Threshold Puzzles. In: EUROCON 2005 - The International Conference on Computer as a tool, Belgrade, Serbia and Montenegro, November 22-24 (2005)","DOI":"10.1109\/EURCON.2005.1630012"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Ma, M.: Mitigating denial of service attacks with password puzzles. In: International Conference on Information Technology: Coding and Computing (ITCC 2005), vol.\u00a02, pp. 621\u2013626 (2005)","DOI":"10.1109\/ITCC.2005.200"},{"key":"28_CR10","unstructured":"Groza, B., Petrica, D.: On Chained Cryptographic Puzzles. In: 3rd Romanian-Hungarian Joint Symposium on Applied Computational Intelligence (SACI), Timisoara, Romania, May 25-26 (2006)"},{"key":"28_CR11","unstructured":"Jeckmans, A.J.P.: Practical client puzzle from repeated squaring. Master\u2019s thesis (September 2009)"},{"issue":"4","key":"28_CR12","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"},{"issue":"3","key":"28_CR13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s001459900042","volume":"11","author":"A. Joux","year":"1998","unstructured":"Joux, A., Stern, J.: Lattice Reduction: A Toolbox for the Cryptanalyst. Journal of Cryptology: the journal of the International Association for Cryptologic Research\u00a011(3), 161\u2013185 (1998)","journal-title":"Journal of Cryptology: the journal of the International Association for Cryptologic Research"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/10722028_4","volume-title":"Algorithmic Number Theory","author":"P.Q. Nguyen","year":"2000","unstructured":"Nguyen, P.Q., Stern, J.: Lattice Reduction in Cryptology: An Update. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 85\u2013112. Springer, Heidelberg (2000)"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-76969-9_16","volume-title":"Cryptology and Network Security","author":"S. Tritilanunt","year":"2007","unstructured":"Tritilanunt, S., Boyd, C., Foo, E., Nieto, J.M.G.: Toward Non-Parallelizable Client Puzzles. In: Bao, F., Ling, S., Okamoto, T., Wang, H., Xing, C. (eds.) CANS 2007. LNCS, vol.\u00a04856, pp. 247\u2013264. Springer, Heidelberg (2007)"},{"issue":"2","key":"28_CR16","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"},{"issue":"1\/2","key":"28_CR17","doi-asserted-by":"crossref","first-page":"143","DOI":"10.3233\/JCS-2001-91-206","volume":"9","author":"C. Meadows","year":"2001","unstructured":"Meadows, C.: A Cost-Based Framework for Analysis of DoS in Networks. Journal of Computer Security\u00a09(1\/2), 143\u2013164 (2001)","journal-title":"Journal of Computer Security"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security and Privacy XXIV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13739-6_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:42:36Z","timestamp":1606185756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13739-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137389","9783642137396"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13739-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}