The gap-problems: a new class of problems for the security of cryptographic schemes (1992)
Cached
Download Links
- [www.di.ens.fr]
- [www.di.ens.fr]
- [www.mathmagic.cn]
- DBLP
Other Repositories/Bibliography
| Venue: | Proceedings of PKC 2001, volume 1992 of LNCS |
| Citations: | 107 - 11 self |
BibTeX
@INPROCEEDINGS{Okamoto92thegap-problems:,
author = {Tatsuaki Okamoto and David Pointcheval},
title = {The gap-problems: a new class of problems for the security of cryptographic schemes},
booktitle = {Proceedings of PKC 2001, volume 1992 of LNCS},
year = {1992},
pages = {104--118},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. This paper introduces a novel class of computational problems, the gap problems, which can be considered as a dual to the class of the decision problems. We show the relationship among inverting problems, decision problems and gap problems. These problems find a nice and rich practical instantiation with the Diffie-Hellman problems. Then, we see how the gap problems find natural applications in cryptography, namely for proving the security of very efficient schemes, but also for solving a more than 10-year old open security problem: the Chaum’s undeniable signature.
