{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T22:21:43Z","timestamp":1746138103766},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642103650"},{"type":"electronic","value":"9783642103667"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10366-7_30","type":"book-chapter","created":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T03:08:44Z","timestamp":1259636924000},"page":"505-523","source":"Crossref","is-referenced-by-count":27,"title":["Security Notions and Generic Constructions for Client Puzzles"],"prefix":"10.1007","author":[{"given":"Liqun","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Morrissey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nigel P.","family":"Smart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bogdan","family":"Warinschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","first-page":"1","volume":"4","author":"W. Aiello","year":"2004","unstructured":"Aiello, W., Bellovin, S.M., Blaze, M., Canetti, R., Ioannidis, J., Kermoytis, A.D., Reingold, O.: Just Fast Keying: Key Agreement In A Hostile Internet. ACM Trans. on Info. and Syst. Sec.\u00a04, 1\u201330 (2004)","journal-title":"ACM Trans. on Info. and Syst. Sec."},{"key":"30_CR2","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":"30_CR3","unstructured":"Barak, B., Mahmoody\u2013Ghidary, M.: Merkle Puzzles are Optimal. Cryptology ePrint archive, report 2008\/032 (2008)"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-78524-8_4","volume-title":"Theory of Cryptography","author":"E. Biham","year":"2008","unstructured":"Biham, E., Goren, Y.J., Ishai, Y.: Basing Weak Public-Key Cryptoraphy on Strong One-Way Functions. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 55\u201372. Springer, Heidelberg (2008)"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-540-30576-7_2","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2005","unstructured":"Canetti, R., Halevi, S., Steiner, M.: Hardness Amplification of Weakly Verifiable Puzzles. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 17\u201333. Springer, Heidelberg (2005)"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/3-540-45439-X_33","volume-title":"Information Security","author":"L. Chen","year":"2001","unstructured":"Chen, L., Mao, W.: An Auditable Metering Scheme for Web Advertisement Applications. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol.\u00a02200, pp. 475\u2013485. Springer, Heidelberg (2001)"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.comnet.2003.10.003","volume":"44","author":"C. Douligeris","year":"2004","unstructured":"Douligeris, C., Mitrokotsa, A.: DDoS Attacks and Defence mechanisms: Classification and State\u2013of\u2013the\u2013Art. Computer Networks\u00a044, 643\u2013666 (2004)","journal-title":"Computer Networks"},{"key":"30_CR8","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 \u201992","author":"C. Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via Processing or Combatting Junk Email. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 139\u2013147. Springer, Heidelberg (1993)"},{"key":"30_CR9","unstructured":"Eddy, W.: TCP SYN Flooding Attacks and Common Mitigations. RFC 4987"},{"key":"30_CR10","unstructured":"Gao, Y.: Efficient Trapdoor-Based Client Puzzle System Against DoS Attacks. M.Sc Thesis, University of Wollongong, Computer Science Department (2005)"},{"key":"30_CR11","unstructured":"Groza, B., Petrica, D.: On Chained Cryptographic Puzzles. In: 3rd Romanian-Hungarian Joint Symp. on Applied Comput. Intel. \u2013 SACI, pp. 25\u201326 (2006)"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the Provable Consequences of One\u2013Way Permutations. In: ACM Symp. on the Theory of Comp. \u2013 STOC 1989, pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Juels, A.: Proofs of Work and Bread Pudding Protocols. In: Joint Working Conference on Secure Information Networks: Communications and Multimedia Security. IFIP Conference Proceedings, vol.\u00a0152, pp. 258\u2013272 (1999)","DOI":"10.1007\/978-0-387-35568-9_18"},{"key":"30_CR14","unstructured":"Juels, A., Brainard, J.: Client Puzzles: A Cryptographic Countermeasure Against Connection Depletion Attacks. In: ISOC Network and Distributed System Security Symposium, pp. 151\u2013165 (1999)"},{"key":"30_CR15","unstructured":"Karig, D., Lee, R.: Remote Denial of Service Attacks and Countermeasures. Princeton University Department of Electrical Engineering Technical Report CE\u2013L2001\u2013002 (2001)"},{"key":"30_CR16","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/CSFW.1999.779758","volume-title":"12th Computer Security Foundations Workshop","author":"C. Meadows","year":"1999","unstructured":"Meadows, C.: A Formal Framework and Evaluation Method for Network Denial of Service. In: 12th Computer Security Foundations Workshop, pp. 4\u201313. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"30_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\u2013Based Framework for Analysis of Denial of Service in Networks. Journal of Computer Security\u00a09, 143\u2013164 (2001)","journal-title":"Journal of Computer Security"},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1145\/359460.359473","volume":"21","author":"R. Merkle","year":"1978","unstructured":"Merkle, R.: Secure Communications Over Insecure Channels. Communications of the ACM\u00a021, 294\u2013299 (1978)","journal-title":"Communications of the ACM"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/997150.997156","volume":"34","author":"J. Mirkovic","year":"2004","unstructured":"Mirkovic, J., Martin, J., Reiher, P.: A Taxonomy of DDoS Attack and DDoS Defense Mechanisms. ACM SIGCOMM Computer Communication Review\u00a034, 39\u201353 (2004)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Moskowitz, R., Nikander, P., Jokela, P., Henderson, T.: Host Identity Protocol. Internet Draft (October 2007)","DOI":"10.17487\/rfc5201"},{"key":"30_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/978-3-540-40974-8_26","volume-title":"Cryptography and Coding","author":"G. Price","year":"2003","unstructured":"Price, G.: A General Attack Model of Hash-Based Client Puzzles. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol.\u00a02898, pp. 319\u2013331. Springer, Heidelberg (2003)"},{"key":"30_CR22","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.: Time-lock Puzzles and Timed-release Crypto. Massachusetts Institute of Technology Technical Report TR-684 (1996)"},{"key":"30_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11958239_14","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"P. Rogaway","year":"2006","unstructured":"Rogaway, P.: Formalizing Human Ignorance. In: Nguy\u00ean, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol.\u00a04341, pp. 211\u2013228. Springer, Heidelberg (2006)"},{"key":"30_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-72738-5_26","volume-title":"Applied Cryptography and Network Security","author":"P. Schaller","year":"2007","unstructured":"Schaller, P., Capkun, S., Basin, D.: BAP: Broadcast Authentication Using Cryptographic Puzzles. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol.\u00a04521, pp. 401\u2013419. Springer, Heidelberg (2007)"},{"key":"30_CR25","unstructured":"Smith, J., Gonz\u00e1lez\u2013Nieto, J.M., Boyd, C.: Modelling Denial of Service Attacks on JFK with Meadows\u2019s Cost\u2013Based Framework. In: Proceedings of the 2006 Australasian workshop on Grid computing and e\u2013research, vol.\u00a054, pp. 125\u2013134 (2006)"},{"key":"30_CR26","unstructured":"Specht, S., Lee, R.: Distributed Denial of Service: Taxonomies of Attacks, Tools, and Countermeasures. In: 17th International Conference on Parallel and Distributed Computing Systems, pp. 543\u2013550 (2004)"},{"key":"30_CR27","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., Gonz\u00e1lez Nieto, J.M.: 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)"},{"key":"30_CR28","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/1030083.1030117","volume-title":"11th ACM Conference on Computer and Communication Security \u2013 CCS","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: 11th ACM Conference on Computer and Communication Security \u2013 CCS, pp. 246\u2013256. ACM Press, New York (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10366-7_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:54:50Z","timestamp":1606186490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10366-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642103650","9783642103667"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10366-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}