Abstract:
In year 2005, Internet users were twice more likely to receive unsolicited electronic messages, known as spams, than regular emails. Proof of work protocols are designed to limit such phenomena and other denial-of-service attacks by requiring some kind of virtual stamping: the attacks are not suppressed, but their rate is reduced as some cost must be paid to get the service. The cost is not in money but in computation time. These schemes require computing an easy to verify but hard to find solution to some problem. As cpu-intensive computations are badly hit over time by Moore’s law, memory-bound computations have been suggested as an alternative to deal with heterogeneous hardware. We introduce new memory-bound functions suitable to these protocols, in which the client-side work to compute the response is exponential with respect to the server-side work needed to set the challenge or check it, instead of polynomial. One-way non-interactive solution-verification variants are also presented. Our experimental results and technical arguments show that any such memory-bound function is inherently parallel, thus bound by memory bandwidth and not by memory latency, as previously claimed by others. 1
Citations
|
3148
|
Computer architecture : a quantitative approach, 3rd ed
– Hennessy, Patterson, et al.
- 2003
|
|
281
|
Cramming more components onto integrated circuits
– Moore
- 1965
|
|
179
|
and A.Ahamir, PayWord and MicroMint: two Simple MicroPayment schemes, CryptoBytes
– Rivest
- 1996
|
|
172
|
Hitting the memory wall: Implications of the obvious
– Wulf, McKee
- 1995
|
|
115
|
Pricing via Processing or Combatting Junk Mail
– Dwork, Naor
- 1992
|
|
65
|
Client puzzles: A cryptographic defense against connection depletion attacks
– Juels, Brainard
- 1999
|
|
54
|
On memory-bound functions for fighting spam
– Dwork, Goldberg, et al.
- 2003
|
|
53
|
Moderately hard, memory-bound functions
– Abadi, Burrows, et al.
- 2003
|
|
34
|
Auditable Metering with Lightweight Security
– Franklin, Malkhi
|
|
33
|
Defending against denial-ofservice attacks with puzzle auctions
– Wang, Reiter
- 2003
|
|
29
|
Proofs of work and bread pudding protocols
– Jakobsson, Juels
- 1999
|
|
19
|
Dwork and Moni Naor. Pricing via Processing, or: Combating Junk Mail
– Cynthia
- 1993
|
|
11
|
Economic Measures to Resist Attacks on a Peer-to-Peer Network
– Rosenthal, Roussopoulos, et al.
- 2003
|
|
10
|
Proof-of-work proves not to work
– Laurie, Clayton
- 2004
|
|
2
|
1035, domain names - implementation and specification
– RFC
- 1987
|
|
2
|
Démonstration touchant le mouvement de la lumière
– Rømer
|
|
1
|
Spam skit. Flying Circus episode 25 (season 2), broadcast on BBC One
– Python
- 1970
|
|
1
|
Spam intercepts,” http://www.messagelabs.com
– MessageLabs
- 2005
|
|
1
|
Taxonomy of anti-spam systems. http://asrg.sp.am
– Judge
- 2003
|
|
1
|
Mail filtering on medium/huge mail servers with j-chkmail
– Cruz
- 2005
|
|
1
|
Advice to a young tradesman
– Franklin
|
|
1
|
Hashcash package first announced. http://www.hashcash.org/papers/ announce.txt
– Back
- 1997
|
|
1
|
2821, simple mail transfer protocol (SMTP),” http://www.ietf.org/rfc/rfc2821.txt
– IETF
- 2001
|
|
1
|
DNSBL – DNS-based blackhole list,” part of MAPS, Mail Abuse Prevention System
– Vixie
- 1997
|
|
1
|
2821, simple mail transfer protocol (SMTP
– RFC
- 2001
|
|
1
|
Jakobsson and Ari Juels. Proofs of work and bread pudding protocols
– Markus
- 1999
|
|
1
|
filtering on medium/huge mail servers with j-chkmail
– Mail
- 2005
|
|
1
|
DNSBL – DNS-based blackhole list. part
– Vixie
- 1997
|
|
1
|
Design and Optimization of Compilers, chapter A catalogue of optimizing transformations
– Allen, Cocke
- 1972
|
|
1
|
Implementation of memory-bound functions. http://www.coelho.net/ mbound.html
– Coelho
- 2006
|
