@inproceedings{abadi2003moderately,
author = {Abadi, Martin and Burrows, Mike and Manasse, Mark and Wobber, Ted},
title = {Moderately Hard, Memory-bound Functions},
booktitle = {Proceedings of the 10th Annual Network and Distributed System Security Symposium (NDSS)},
year = {2003},
month = {February},
abstract = {A resource may be abused if its users incur little or no cost. For example, e-mail abuse is rampant because sending an e-mail has negligible cost for the sender. It has been suggested that such abuse may be discouraged by introducing an artificial cost in the form of a moderately expensive computation. Thus, the sender of an e-mail might be required to pay by computing for a few seconds before the e-mail is accepted. Unfortunately, because of sharp disparities across computer systems, this approach may be ineffective against malicious users with high-end systems, prohibitively slow for legitimate users with low-end systems, or both. Starting from this observation, we research moderately hard functions that most recent systems will evaluate at about the same speed. For this purpose, we rely on memory-bound computations. We describe and analyze a family of moderately hard, memory-bound functions, and we explain how to use them for protecting against abuses.},
publisher = {Internet Society},
url = {http://approjects.co.za/?big=en-us/research/publication/moderately-hard-memory-bound-functions-2/},
edition = {Proceedings of the 10th Annual Network and Distributed System Security Symposium (NDSS)},
}