Forward-Secure Digital Signature Schemes with Optimal Computation and Storage of Signers - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Forward-Secure Digital Signature Schemes with Optimal Computation and Storage of Signers

(1) , (2)
1
2
Jihye Kim
  • Function : Author
  • PersonId : 1023791
Hyunok Oh
  • Function : Author
  • PersonId : 1023792

Abstract

Forward-secure signatures minimize damage by preventing forgeries for past time periods when a secret key is compromised. Forward-secure signature schemes are useful for various devices such as logging systems, unattended sensors, CCTV, dash camera, etc. Considering sensors equipped with limited resources and embedded real-time systems with timing constraints, it is necessary to design a forward-secure signature scheme with minimal overhead on signer’s side.This paper proposes the first forward secure digital signature schemes with constant complexities in signature generation, key update, the size of keys, and the size of a signature. The proposed algorithms have $$O(k^3)$$O(k3)-time complexity for each signing and key update algorithm and O(k)-size secret keys where k is an RSA security parameter. We prove the security of our proposed schemes under the factoring assumption in the random oracle model and present a concrete implementation of our schemes to demonstrate their practical feasibility.
Fichier principal
Vignette du fichier
449885_1_En_35_Chapter.pdf (223.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01648999 , version 1 (27-11-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Jihye Kim, Hyunok Oh. Forward-Secure Digital Signature Schemes with Optimal Computation and Storage of Signers. 32th IFIP International Conference on ICT Systems Security and Privacy Protection (SEC), May 2017, Rome, Italy. pp.523-537, ⟨10.1007/978-3-319-58469-0_35⟩. ⟨hal-01648999⟩
259 View
92 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More