Hashcash

Results: 43



#Item
21Hashcash overview  OpenCL My implementation of Hashcash

Hashcash overview OpenCL My implementation of Hashcash

Add to Reading List

Source URL: www.cri.ensmp.fr

Language: English - Date: 2013-12-12 07:49:41
22Hashcash - A Denial of Service Counter-Measure Adam Back e-mail:  1st August 2002 Abstract Hashcash was originally proposed as a mechanism to throttle systematic abuse of un-metered internet resources

Hashcash - A Denial of Service Counter-Measure Adam Back e-mail: 1st August 2002 Abstract Hashcash was originally proposed as a mechanism to throttle systematic abuse of un-metered internet resources

Add to Reading List

Source URL: nakamotoinstitute.org

Language: English - Date: 2014-03-23 11:39:34
23Hashcash - Amortizable Publicly Auditable Cost-Functions Adam Back e-mail:  1st August 2002 Abstract We present a distributed efficiently amortizable CPU cost-function with no trap–door. The absence

Hashcash - Amortizable Publicly Auditable Cost-Functions Adam Back e-mail: 1st August 2002 Abstract We present a distributed efficiently amortizable CPU cost-function with no trap–door. The absence

Add to Reading List

Source URL: hashcash.org

Language: English - Date: 2005-01-15 19:23:55
24Moderately Hard, Memory-bound Functions Mart´ın Abadi University of California at Santa Cruz Abstract A resource may be abused if its users incur little or no cost. For example, e-mail abuse is rampant because sending

Moderately Hard, Memory-bound Functions Mart´ın Abadi University of California at Santa Cruz Abstract A resource may be abused if its users incur little or no cost. For example, e-mail abuse is rampant because sending

Add to Reading List

Source URL: www.hashcash.org

Language: English - Date: 2005-01-15 19:23:53
25MOMENTUM - A MEMORY-HARD PROOF-OF-WORK VIA FINDING BIRTHDAY COLLISIONS DANIEL LARIMER  Invictus Innovations, Inc ABSTRACT. We introduce the concept of memory-hard proof-of-work

MOMENTUM - A MEMORY-HARD PROOF-OF-WORK VIA FINDING BIRTHDAY COLLISIONS DANIEL LARIMER Invictus Innovations, Inc ABSTRACT. We introduce the concept of memory-hard proof-of-work

Add to Reading List

Source URL: hashcash.org

Language: English - Date: 2014-01-13 13:07:17
26An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol based on Merkle Trees (extended and colored version of [7]) Fabien Coelho ´ CRI, Ecole des mines de Paris,

An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol based on Merkle Trees (extended and colored version of [7]) Fabien Coelho ´ CRI, Ecole des mines de Paris,

Add to Reading List

Source URL: hashcash.org

Language: English - Date: 2008-06-22 07:14:34
27Proceedings of the 2003 IEEE Symposium on Security and Privacy (SP’ $17.00 © 2003 IEEE Proceedings of the 2003 IEEE Symposium on Security and Privacy (SP’ $17.00 © 2003 IEEE

Proceedings of the 2003 IEEE Symposium on Security and Privacy (SP’ $17.00 © 2003 IEEE Proceedings of the 2003 IEEE Symposium on Security and Privacy (SP’ $17.00 © 2003 IEEE

Add to Reading List

Source URL: hashcash.org

Language: English - Date: 2005-01-15 19:23:58
28Off-line Karma: A Decentralized Currency for Peer-to-peer and Grid Applications Flavio D. Garcia and Jaap-Henk Hoepman Institute for Computing and Information Science, Radboud University, Nijmegen, The Netherlands. {flav

Off-line Karma: A Decentralized Currency for Peer-to-peer and Grid Applications Flavio D. Garcia and Jaap-Henk Hoepman Institute for Computing and Information Science, Radboud University, Nijmegen, The Netherlands. {flav

Add to Reading List

Source URL: hashcash.org

Language: English - Date: 2005-04-20 07:18:43
29Proceedings of the 2003 IEEE Symposium on Security and Privacy (SP’ $17.00 © 2003 IEEE Proceedings of the 2003 IEEE Symposium on Security and Privacy (SP’ $17.00 © 2003 IEEE

Proceedings of the 2003 IEEE Symposium on Security and Privacy (SP’ $17.00 © 2003 IEEE Proceedings of the 2003 IEEE Symposium on Security and Privacy (SP’ $17.00 © 2003 IEEE

Add to Reading List

Source URL: www.hashcash.org

Language: English - Date: 2005-01-15 19:23:58
30On Memory-Bound Functions for Fighting Spam Cynthia Dwork1 , Andrew Goldberg1, and Moni Naor2? 1 Microsoft Research, SVC 1065 L’Avenida

On Memory-Bound Functions for Fighting Spam Cynthia Dwork1 , Andrew Goldberg1, and Moni Naor2? 1 Microsoft Research, SVC 1065 L’Avenida

Add to Reading List

Source URL: hashcash.org

Language: English - Date: 2005-01-15 19:23:52