M. Abadi, A. Birrell, B. Mike, F. Dabek, and T. Wobber, Bankable Postage for Network Services, 8th Asian Computing Science Conference, pp.72-90, 2003.
DOI : 10.1007/978-3-540-40965-6_6

M. Abadi, M. Burrows, M. Manasse, and T. Wobber, Moderately hard, memory-bound functions, 10th Annual Network and Distributed System Security Symposium (NDSS), 2003.
DOI : 10.1145/1064340.1064341
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.4073

A. Back, Hashcash package announce, 1997.

J. Cai, R. R. Lipton, R. Sedgewick, and A. C. Yao, Towards uncheatable benchmarks, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference, pp.2-11, 1993.
DOI : 10.1109/SCT.1993.336546

F. Coelho, Exponential memory-bound functions for proof of work protocols, Also Cryptology ePrint Archive Report, vol.356, 2005.

C. Dwork, A. Goldberg, and M. Naor, On Memory-Bound Functions for Fighting Spam, Advances in Cryptology ? CRYPTO 2003, pp.426-444, 2003.
DOI : 10.1007/978-3-540-45146-4_25

C. Dwork and M. Naor, Pricing via Processing or Combatting Junk Mail, Advances in Cryptology? CRYPTO '92, pp.139-147, 1992.
DOI : 10.1007/3-540-48071-4_10

M. K. Franklin and D. Malkhi, Auditable metering with lightweight security, Financial Cryptography 97, 1997.

E. Gabber, M. Jakobsson, Y. Matias, and A. J. Mayer, Curbing junk e-mail via secure classification, Financial Cryptography, pp.198-213, 1998.
DOI : 10.1007/BFb0055484

F. Garcia and J. Hoepman, Off-Line Karma: A Decentralized Currency for Peer-to-peer and Grid Applications, Applied Cryptography and Network Security ? ACNS, number 3531 in LNCS, pp.364-377, 2005.
DOI : 10.1007/11496137_25

D. M. Goldschlag and S. G. Stubblebine, Publicly verifiable lotteries: Applications of delaying functions, Financial Cryptography'98, 1998.
DOI : 10.1007/BFb0055485

M. Jakobsson and A. Juels, Proofs of work and bread pudding protocols, Communications and Multimedia Security, 1999.

A. Juels and J. Brainard, Client puzzles: A cryptographic defense against connection depletion attacks, Network and Distributed System Security (NDSS), 1999.

L. Lamport, Constructing digital signatures from a one-way function, 1979.

B. Laurie and R. Clayton, proof-of-work " proves not to work, WEAS 04, 2004.

D. Liu and L. J. Camp, Proof of Work can Work, Fifth Workshop on the Economics of Information Security, 2006.

R. C. Merkle, Secrecy, Authentification, and Public Key Systems, 1979.

R. L. Rivers, A. Shamir, and D. Wagner, Time-lock puzzles and timed-release crypto, 1996.

R. Rivest and A. Shamir, PayWord and MicroMint: Two simple micropayment schemes, CryptoBytes, vol.2, issue.1, 1996.
DOI : 10.1007/3-540-62494-5_6
URL : http://cactus.eas.asu.edu/partha/teaching/539.2008/rivestpapers/pay-mint.pdf

D. S. Rosenthal, M. Roussopoulos, P. Maniatis, and M. Baker, Economic measures to resist attacks on a peer-to-peer network, Workshop on Economics of Peer-to-Peer Systems, 2003.

X. Wang and M. Reiter, Defending against denial-ofservice attacks with puzzle auctions, IEEE Symposium on Security and Privacy 03, 2003.

B. Waters, A. Juels, J. A. Halderman, and E. W. Felten, New client puzzle outsourcing techniques for DoS resistance, Proceedings of the 11th ACM conference on Computer and communications security , CCS '04, 2004.
DOI : 10.1145/1030083.1030117