Advertisement

Fighting Spam: The Science

  • Cynthia Dwork
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2976)

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.

Keywords

Price Function Processor Speed Architecture Community Hard Function Rigorous Investigation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Back, A.: Hashcash - A Denial of Servic Counter-Measure, http://www.cypherspace.org/hashcash/hashcash.pdf
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Chang, R.: Could spam kill off e-mail? PC World (October 23, 2003), See, http://www.nwfusion.com/news/2003/1023couldspam.html
  5. 5.
    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)Google Scholar
  6. 6.
    Spam Filter Review, Spam Statistics (2004), http://www.spamfilterreview.com/spam-statistics.html
  7. 7.
    Wulf, W.A., McKee, S.A.: Hitting the Memory Wall: Implications of the Obvious. Computer Architecture News 23(1), 20–24 (1995)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Cynthia Dwork
    • 1
  1. 1.Microsoft ResearchMountain ViewUSA

Personalised recommendations