Moderately Hard Functions: From Complexity to Spam Fighting

@inproceedings{Naor2003ModeratelyHF,
  title={Moderately Hard Functions: From Complexity to Spam Fighting},
  author={Moni Naor},
  booktitle={FSTTCS},
  year={2003}
}
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the community has developed a fairly strong understanding of what types of cryptographic primitives can be achieved under which assumption. We explore the idea of using moderatelyhard functions in order to achieve many tasks for which a perfect solution is impossible, for instance, denial-of-service. We survey some of the… CONTINUE READING
BETA

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…