An Efficient Existentially Unforgeable Signature Scheme and Its Applications |
| |
| Authors: | Cynthia Dwork Moni Naor |
| |
| Affiliation: | (1) IBM Research Division, Almaden Research Center, 650 Harry Road, San Jose, CA 95120, U.S.A. dwork@almaden.ibm.com, US;(2) Incumbent of the Morris and Rose Goldman Career Development Chair, Department of Applied Mathematics and Computer Science, Weizmann Institute of Science, Rehovot 76100, Israel naor@wisdom.weizmann.ac.il, IL |
| |
| 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
{m
1
, . . ., m
k
} . We present an existentially unforgeable signature scheme that for a reasonable setting of parameters requires at most six
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.
Received 2 May 1995 and revised 10 July 1997 |
| |
| Keywords: | , Cryptography, Digital signatures, Unforgeability, One-way hash \mbox{functions}, Authentication, |
| 本文献已被 SpringerLink 等数据库收录！ |
|
