Name
Abstract | ||
|---|---|---|
One-time signature schemes have been used as an important cryptographic tool for various applications. To generate a signature on a message, the state-of-the-art one-time signature requires roughly one hash function evaluation and one modular multiplication. We propose a new one-time signature scheme for short messages that needs only one integer multiplication (i.e., without modular reduction or hash function evaluation). Theoretically, our construction is based on a generic transformation from identification protocols secure against active attacks into secure one-time signature schemes for short messages, where the Fiat-Shamir technique is not used. To obtain efficient instantiation of the transformation, we prove that the GPS identification protocol is secure against active attacks, which may be of independent interest. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1587/transfun.E94.A.1567 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
cryptography, digital signature, one-time signature | Elliptic Curve Digital Signature Algorithm,ElGamal signature scheme,Merkle signature scheme,Commitment scheme,Ring signature,Theoretical computer science,Digital signature,Blind signature,Mathematics,Schnorr signature | Journal |
Volume | Issue | ISSN |
E94A | 7 | 0916-8508 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dae Hyun Yum | 1 | 315 | 24.95 |
| Pil Joong Lee | 2 | 1039 | 103.09 |