On The Cost Distribution of a Memory Bound Function

Details On The Cost Distribution of a Memory Bound Function On The Cost Distribution of a Memory Bound Function

2003-11-06

arxiv.org/abs/cs/0311005v1

Computer Science

Cryptography and Security

8 pages

Scientific paper

Memory Bound Functions have been proposed for fighting spam, resisting Sybil attacks and other purposes. A particular implementation of such functions has been proposed in which the average effort required to generate a proof of effort is set by parameters E and l to E * l. The distribution of effort required to generate an individual proof about this average is fairly broad. When particular uses of these functions are envisaged, the choice of E and l, and the system design surrounding the generation and verification of proofs of effort, need to take the breadth of the distribution into account. We show the distribution for this implementation, discuss the system design issues in the context of two proposed applications, and suggest an improved implementation.

Affiliated with

Also associated with

No associations

Rating

On The Cost Distribution of a Memory Bound Function does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On The Cost Distribution of a Memory Bound Function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On The Cost Distribution of a Memory Bound Function will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-519172