{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:05:21Z","timestamp":1775282721566,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540406747","type":"print"},{"value":"9783540451464","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45146-4_25","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T17:51:19Z","timestamp":1277229079000},"page":"426-444","source":"Crossref","is-referenced-by-count":96,"title":["On Memory-Bound Functions for Fighting Spam"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Abadi, M., Burrows, M. (multiple) private communication(s)"},{"key":"25_CR2","unstructured":"Abadi, M.: private communication"},{"key":"25_CR3","unstructured":"Abadi, M., Burrows, M., Manasse, M., Wobber, T.: Moderately Hard, Memory-Bound Functions. In: Proceedings of the 10th Annual Network and Distributed System Security Symposium (February 2003)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Determinism versus Non-Determinism for Linear Time RAMs, In: STOC 1999, pp. 632\u2013641 (1999)","DOI":"10.1145\/301250.301424"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: A Non-linear Time Lower Bound for Boolean Branching Programs. In: FOCS 1999, pp. 60\u201370 (1999)","DOI":"10.1109\/SFFCS.1999.814578"},{"key":"25_CR6","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. Wiley & Sons, New-York (1992)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Beame, P., Saks, M.E., Sun, X., Vee, E.: Super-linear time-space tradeoff lower bounds for randomized computation. In: FOCS 2000, pp. 169\u2013179 (2000)","DOI":"10.1109\/SFCS.2000.892078"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"key":"25_CR9","unstructured":"http:\/\/www.camram.org\/mhonarc\/spam\/msg00166.html"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/C-M.1977.217750","volume":"10","author":"W. Diffie","year":"1977","unstructured":"Diffie, W., Hellman, M.E.: Exhaustive cryptanalysis of the NBS Data Encryption Standard. Computer\u00a010, 74\u201384 (1977)","journal-title":"Computer"},{"key":"25_CR11","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 Mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 139\u2013147. Springer, Heidelberg (1993)"},{"issue":"3","key":"25_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s001459900043","volume":"11","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Naor, M.: An Efficient Existentially Unforgeable Signature Scheme and Its Applications. Journal of Cryptology\u00a011(3), 187\u2013208 (1998)","journal-title":"Journal of Cryptology"},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s001459900021","volume":"10","author":"A. Fiat","year":"1997","unstructured":"Fiat, A.: Batch RSA. Journal of Cryptology\u00a010(2), 75\u201388 (1997)","journal-title":"Journal of Cryptology"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Fiat, A., Naor, M.: Rigorous Time\/Space Tradeoffs for Inverting Functions. In: STOC 1991, pp. 534\u2013541 (1991)","DOI":"10.1145\/103418.103473"},{"key":"25_CR15","unstructured":"Fiat, A., Shamir, A.: How to Prove Yourself. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 641\u2013654. Springer, Heidelberg (1985)"},{"key":"25_CR16","unstructured":"Fluhrer, S., Mantin, I., Shamir, A.: Attacks on RC4 and WEP. In: Cryptobytes 2002 (2002)"},{"key":"25_CR17","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"A.J. Menezes","year":"1996","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996), Also available: http:\/\/www.cacr.math.uwaterloo.ca\/hac\/"},{"key":"25_CR18","unstructured":"Back, A.: Hashcash - A Denial of Servic Counter-Measure, available at http:\/\/www.cypherspace.org\/hashcash\/hashcash.pdf"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/BFb0054130","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Garay, J.A., Rabin, T.: Fast Batch Verification for Modular Exponentiation and Digital Signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 236\u2013250. Springer, Heidelberg (1998)"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Bellare, M., Garay, J.A., Rabin, T.: Batch Verification with Applications to Cryptography and Checking, In: LATIN 1998, pp. 170\u2013191 (1998)","DOI":"10.1007\/BFb0054320"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TIT.1980.1056220","volume":"26","author":"M. Hellman","year":"1980","unstructured":"Hellman, M.: A Cryptanalytic Time Memory Trade-Off. IEEE Trans. Infor. Theory\u00a026, 401\u2013406 (1980)","journal-title":"IEEE Trans. Infor. Theory"},{"issue":"2","key":"25_CR22","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to Construct Pseudorandom Permutations and Pseudorandom Functions. SIAM J. Computing\u00a017(2), 373\u2013386 (1988)","journal-title":"SIAM J. Computing"},{"key":"25_CR23","unstructured":"Mantin, I.: Analysis of the Stream Cipher RC4, Master\u2019s Thesis, Weizmann Institute of Science (2001), Available http:\/\/www.wisdom.weizmann.ac.il\/~itsik\/RC4\/rc4.html"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Mironov, I.: (Not So) Random Shuffles of RC4, In: Proc. of CRYPTO 2002 (2002)","DOI":"10.1007\/3-540-45708-9_20"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal One-Way Hash Functions and their Cryptographic Applications, In: STOC 1989, pp. 33\u201343 (1989)","DOI":"10.1145\/73007.73011"},{"key":"25_CR26","unstructured":"Oechslin, P.: Making a faster Cryptanalytic Time-Memory Trade-Off, these proceedings"},{"issue":"1","key":"25_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"P.C. Oorschot van","year":"1999","unstructured":"van Oorschot, P.C., Wiener, M.J.: Parallel Collision Search with Cryptanalytic Applications. Journal of Cryptology\u00a012(1), 1\u201328 (1999)","journal-title":"Journal of Cryptology"},{"issue":"3","key":"25_CR28","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1137\/0210033","volume":"10","author":"R. Schroeppel","year":"1981","unstructured":"Schroeppel, R., Shamir, A.: A T = O(2(n\/2)), S = O(2(n\/4)) Algorithm for Certain NP-Complete Problems. SIAM J. Comput.\u00a010(3), 456\u2013464 (1981)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45146-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T05:51:58Z","timestamp":1559195518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45146-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406747","9783540451464"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45146-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}