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

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-01648999
Contributor : Hal Ifip <>
Submitted on : Monday, November 27, 2017 - 10:31:26 AM
Last modification on : Monday, November 27, 2017 - 10:34:09 AM

File

 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2020-01-01

Please log in to resquest access to the document

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

286