Designated condition one-time signatures

Authors:
Wei Gao;Kefei Chen;Guilin Wang;Xueli Wang
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China,Department of Mathematics and Informatics, Ludong University, Yantai, China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;School of Computer Science & Software Engineering, University of Wollongong, Wollongong, NSW, Australia;School of Mathematics, South China Normal University, Guangzhou, China
Venue:
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
Year:
2012

Citing 8
Cited 0

A digital signature scheme secure against adaptive chosen-message attacks

SIAM Journal on Computing - Special issue on cryptography
Short Signatures from the Weil Pairing

Journal of Cryptology
Chosen-Ciphertext Security from Identity-Based Encryption

SIAM Journal on Computing
Generic Transformation to Strongly Unforgeable Signatures

ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Secure multiple-times proxy signature scheme

Computer Standards & Interfaces
Short Hash-Based Signatures for Wireless Sensor Networks

CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Group signatures

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Digital signature schemes with restriction on signing capability

ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new notion of designated condition one-time signatures (DCOTS) is proposed. For a DCOTS scheme, the signer can generate at most one signature for each condition. For example, the signer can generate at most one signature for each day. If the signer generates two signatures for the same condition, the private key will be severely threatened. Specifically, given two DCOTS signatures for the same condition c and then a DCOTS signature for a new condition c′, one can generate the DCOTS signature on any message for the condition c′. We formally define the notion and the security model for DCOTS signatures. We propose a DCOTS signature scheme based on bilinear parings, and prove its security under the CDH assumption in the random oracle model. We show that a k-times signature scheme and a designated condition k-times signature scheme can be easily derived from a DCOTS signature scheme. Some possible applications of DCOTS signatures are discussed.