Abstract
Consider the following simple approach to fighting spam [5]:
If I don’t know you, and you want your e-mail to appear in my inbox, then you must attach to your message an easily verified “proof of computational effort”, just for me and just for this message.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abadi, M., Burrows, M., Manasse, M., Wobber, T.: Moderately Hard, Memory-Bound Functions. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 3–4. Springer, Heidelberg (2004)
Back, A.: Hashcash - A Denial of Servic Counter-Measure, http://www.cypherspace.org/hashcash/hashcash.pdf
Dwork, C., Goldberg, A.V., Naor, M.: On memory-bound functions for fighting spam. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 426–444. Springer, Heidelberg (2003)
Chang, R.: Could spam kill off e-mail? PC World (October 23, 2003), See, http://www.nwfusion.com/news/2003/1023couldspam.html
Dwork, C., Naor, M.: Pricing via Processing, Or, Combatting Junk Mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139–147. Springer, Heidelberg (1993)
Spam Filter Review, Spam Statistics (2004), http://www.spamfilterreview.com/spam-statistics.html
Wulf, W.A., McKee, S.A.: Hitting the Memory Wall: Implications of the Obvious. Computer Architecture News 23(1), 20–24 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dwork, C. (2004). Fighting Spam: The Science. In: Farach-Colton, M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24698-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-24698-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21258-4
Online ISBN: 978-3-540-24698-5
eBook Packages: Springer Book Archive