Skip to Main content Skip to Navigation
Journal articles

Speeding-Up Verification of Digital Signatures

Abstract : In 2003, Fischlin introduced the concept of progressive verification in cryptography to relate the error probability of a cryptographic verification procedure to its running time. It ensures that the verifier confidence in the validity of a verification procedure grows with the work it invests in the computation. Le, Kelkar and Kate recently revisited this approach for digital signatures and proposed a similar framework under the name of flexible signatures. We propose efficient probabilistic verification procedures for popular signature schemes in which the error probability of a verifier decreases exponentially with the ver-ifier running time. We propose theoretical schemes for the RSA and ECDSA signatures based on some elegant idea proposed by Bernstein in 2000 and some additional tricks. We also present a general practical method, that makes use of efficient error-correcting codes, for signature schemes for which verification involves a matrix/vector multiplication.
Document type :
Journal articles
Complete list of metadata

Cited literature [54 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02934136
Contributor : Damien Vergnaud <>
Submitted on : Sunday, September 27, 2020 - 10:28:37 AM
Last modification on : Tuesday, March 23, 2021 - 9:28:03 AM
Long-term archiving on: : Thursday, December 3, 2020 - 6:34:03 PM

File

final.pdf
Files produced by the author(s)

Identifiers

Citation

Abdul Rahman Taleb, Damien Vergnaud. Speeding-Up Verification of Digital Signatures. Journal of Computer and System Sciences, Elsevier, 2021, 116, pp.22-39. ⟨10.1016/j.jcss.2020.08.005⟩. ⟨hal-02934136⟩

Share

Metrics

Record views

137

Files downloads

46