Logo image
Back
Robust digital signature revisited
Journal article   Peer reviewed

Robust digital signature revisited

H. Cui, B. Qin, W. Susilo and S. Nepal
Theoretical Computer Science, Vol.844, pp.87-96
2020
DOI: https://doi.org/10.1016/j.tcs.2020.08.005
url
Link to Published Version *Subscription may be requiredView

Abstract

In CT-RSA 2019, Geraud, Naccache and Rosie introduced the notion of robustness (ROB) for digital signature schemes to guarantee that the same signature and message pair cannot be valid under two different public keys. Their definition of complete ROB (CROB) can even support the ROB when the keys are malignantly generated. Motivated by the fact that the signature and the key could be illegally produced in some circumstances, we extended the ROB security one step further to guarantee that one valid signature cannot be modified to another valid signature under a different public key, which we call extreme robustness (EXROB). After analysing the relations between the EXROB security and existing ROB related definitions, we describe generic constructions to convert any digital signature scheme that is unforgeable into an EXROB secure one. Our hash-then-sign construction is very efficient, which only adds one hash calculation to the underlying digital signature scheme and does not increase the size of the signature generated by the underlying digital signature scheme.

Details

Metrics

27 Record Views
2 Times Cited - Web of Science

InCites Highlights

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Collaboration types
Domestic collaboration
International collaboration
Citation topics
4 Electrical Engineering, Electronics & Computer Science
4.187 Security Systems
4.187.160 Cryptographic Protocols
Web Of Science research areas
Computer Science, Theory & Methods
ESI research areas
Computer Science
Logo image