Moderately hard, memory-bound functions

By Martín Abadi, M. Burrows, Ted Wobber. TOIT, 2005

298 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Bitcoin and Beyond: A Technical Survey on Decentralized Digital Currencies (2016, background): “Memory-bound functions had been proposed in the context of spam prevention before [Dwork et al. 2003, Abadi et al. 2005].”
Detecting identity-based attacks in wireless networks using signalprints (2006, background): “Mechanisms such as client puzzles have been designed to slow down attack sources, reducing the damages caused by resource depletion attacks [15, 7, 3].”
Efficient Cache Attacks on AES, and Countermeasures (2010, background): “ical hurdles, that it has been proposed by Abadi et al. [ 1 ] and Dwork et al. [21] as a basis for proof-of-work protocols.”
Observation-based Cooperation Enforcement in Ad Hoc Networks (2003, background): “To deal with such short-term identities, we hope to leverage recent work on proof-of-eﬀort mechanisms [1] [11].”
CryptoNote v 2.0 (2013, unknown): “Memory-bound price functions were first introduced by Abadi et al and were defined as “functions whose computation time is dominated by the time spent accessing memory” [15].”