95 |
|
|
96 |
Despite the limitation to a small number of signatures |
Despite the limitation to a small number of signatures |
97 |
per public/private key pair, one-time signatures have |
per public/private key pair, one-time signatures have |
98 |
two distinct advantages. Firstly, one-way functions |
an important advantage: |
99 |
can be very fast, and operations on one-way signatures |
one-way functions generally do not rely on |
|
may be orders of magnitude faster than operations |
|
|
in schemes like DSA or RSA. |
|
|
|
|
|
Secondly, one-way functions generally do not rely on |
|
100 |
unproven number-theoretic assumptions, like the |
unproven number-theoretic assumptions, like the |
101 |
difficulty of factoring large integers [XXX]. In practice, |
difficulty of factoring large integers [XXX]. In practice, |
102 |
a cryptographic hash function is used in most |
a cryptographic hash function is used in most |
106 |
as the basis for signature avoids introducing additional |
as the basis for signature avoids introducing additional |
107 |
cryptographic primitives into the system. |
cryptographic primitives into the system. |
108 |
|
|
109 |
|
Additionally, operations on one-way signatures |
110 |
|
may be orders of magnitude faster than operations |
111 |
|
in schemes like DSA or RSA. |
112 |
|
|
113 |
In this article, we introduce a new signature scheme |
In this article, we introduce a new signature scheme |
114 |
that can be used any number of times without keeping track |
that can be used any number of times without keeping track |
115 |
of private keys that have already been used. |
of private keys that have already been used. |