On Memory-Bound Functions for Fighting Spam (2002)
Cached
Download Links
- [www.avglab.com]
- [www.wisdom.weizmann.ac.il]
- [research.microsoft.com]
- [research.microsoft.com]
- DBLP
Other Repositories/Bibliography
| Venue: | In Crypto |
| Citations: | 74 - 2 self |
BibTeX
@INPROCEEDINGS{Dwork02onmemory-bound,
author = {Cynthia Dwork and Andrew Goldberg and Moni Naor},
title = {On Memory-Bound Functions for Fighting Spam},
booktitle = {In Crypto},
year = {2002},
pages = {426--444},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In 1992, Dwork and Naor proposed that e-mail messages be accompanied by easy-to-check proofs of computational effort in order to discourage junk e-mail, now known as spam. They proposed specific CPU-bound functions for this purpose. Burrows suggested that, since memory access speeds vary across machines much less than do CPU speeds, memory-bound functions may behave more equitably than CPU-bound functions; this approach was first explored by Abadi, Burrows, Manasse, and Wobber [8].
