Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
455506 | Computers & Electrical Engineering | 2011 | 6 Pages |
Short digital signatures are always desirable; for instance, when a human is asked to key in the signature manually or it is necessary to work effectively in low-bandwidth communication, low-storage and low-computation environments. We propose a short signature scheme based on knapsack and Gap Diffie–Hellman (GDH) groups whose security is closely related to the discrete logarithm assumption in the random oracle model. Our new scheme offers a better security guarantee than existing signature schemes. Furthermore, our scheme upholds all desirable properties of previous ID-based signature schemes, and requires general cryptographic hash functions instead of MapToPoint hash function that is inefficient and probabilistic.
Graphical abstractOur scheme abstracts example architecture.Figure optionsDownload full-size imageDownload as PowerPoint slideResearch highlights► Short digital signatures are always desirable. ► We propose a short signature scheme based on CKDH. ► Our scheme requires general hash functions instead of MapToPoint function. ► Security depends on the computational complexity of multiple assumptions.