An Efficient Existentially Unforgeable Signature Scheme and its Applications (1994)
Cached
Download Links
- [www.wisdom.weizmann.ac.il]
- [ftp.wisdom.weizmann.ac.il]
- DBLP
Other Repositories/Bibliography
| Venue: | Journal of Cryptology |
| Citations: | 42 - 5 self |
BibTeX
@INPROCEEDINGS{Dwork94anefficient,
author = {Cynthia Dwork and Moni Naor},
title = {An Efficient Existentially Unforgeable Signature Scheme and its Applications},
booktitle = {Journal of Cryptology},
year = {1994},
pages = {234--246},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A signature scheme is existentially unforgeable if, given any polynomial (in the security parameter) number of pairs (m 1 ; S(m 1 )); (m 2 ; S(m 2 )); : : : (m k ; S(m k )) where S(m) denotes the signature on the message m, it is computationally infeasible to generate a pair (m k+1 ; S(m k+1 )) for any message m k+1 = 2 fm 1 ; : : : m k g. We present an existentially unforgeable signature scheme that for a reasonable setting of parameters requires at most 6 times the amount of time needed to generate a signature using "plain" RSA (which is not existentially unforgeable). We point out applications where our scheme is desirable. Preliminary version appeared in Crypto'94 y IBM Research Division, Almaden Research Center, 650 Harry Road, San Jose, CA 95120. Research supported by a BSF Grant 32-00032-1. E-mail: dwork@almaden.ibm.com. z Incumbent of the Morris and Rose Goldman Career Development Chair, Dept. of Applied Mathematics and Computer Science, Weizmann Institute of Science, Re...
