{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:12Z","timestamp":1725574092296},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212584"},{"type":"electronic","value":"9783540246985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_3","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T17:28:22Z","timestamp":1294421302000},"page":"3-4","source":"Crossref","is-referenced-by-count":2,"title":["Fighting Spam: The Science"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-24698-5_3","volume-title":"LATIN 2004: Theoretical Informatics","author":"M. Abadi","year":"2004","unstructured":"Abadi, M., Burrows, M., Manasse, M., Wobber, T.: Moderately Hard, Memory-Bound Functions. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 3\u20134. Springer, Heidelberg (2004)"},{"key":"3_CR2","unstructured":"Back, A.: Hashcash - A Denial of Servic Counter-Measure, \n                    \n                      http:\/\/www.cypherspace.org\/hashcash\/hashcash.pdf"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-45146-4_25","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"C. Dwork","year":"2003","unstructured":"Dwork, C., Goldberg, A.V., Naor, M.: On memory-bound functions for fighting spam. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 426\u2013444. Springer, Heidelberg (2003)"},{"key":"3_CR4","unstructured":"Chang, R.: Could spam kill off e-mail? PC World (October 23, 2003), See, \n                    \n                      http:\/\/www.nwfusion.com\/news\/2003\/1023couldspam.html"},{"key":"3_CR5","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":"3_CR6","unstructured":"Spam Filter Review, Spam Statistics (2004), \n                    \n                      http:\/\/www.spamfilterreview.com\/spam-statistics.html"},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/216585.216588","volume":"23","author":"W..A. Wulf","year":"1995","unstructured":"Wulf, W.A., McKee, S.A.: Hitting the Memory Wall: Implications of the Obvious. Computer Architecture News\u00a023(1), 20\u201324 (1995)","journal-title":"Computer Architecture News"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T16:56:35Z","timestamp":1548435395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}