DMCA
A Note on Negligible Functions (1997)
| Venue: | Journal of Cryptology |
| Citations: | 28 - 2 self |
BibTeX
@ARTICLE{Bellare97anote,
author = {Mihir Bellare},
title = {A Note on Negligible Functions},
journal = {Journal of Cryptology},
year = {1997},
volume = {15},
pages = {2002}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The notion of a negligible function is used in theoretical cryptography to formalize the notion of a function asymptotically "too small to matter." We claim the issue that really arises is what it might mean for a sequence of functions to be "negligible." We consider (and define) two such notions, and prove them equivalent. Roughly, this enables us to say that any cryptographic primitive has a specific associated "security level." In particular we can say this for any one-way function. We can also reconcile different definitions of negligible error arguments and computational proofs of knowledge that have appeared in the literature. Although there are some cryptographic consequences, the main result is something purely about negligible functions. E-Mail: mihir@cs.ucsd.edu. URL: http://www-cse.ucsd.edu/users/mihir. Supported in part by NSF CAREER Award CCR-9624439 and a Packard Foundation Fellowship in Science and Engineering. Contents 1 Introduction 3 1.1 The issue for one-way fu...
Keyphrases
negligible function theoretical cryptography nsf career award ccr-9624439 edu user packard foundation fellowship different definition main result mihir c negligible error argument security level cryptographic consequence one-way fu computational proof one-way function cryptographic primitive
