Provably Secure Convertible Nominative Signature Scheme

Authors:
Wei Zhao;Changlu Lin;Dingfeng Ye
Affiliations:
State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing, P.R.China 100049;State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing, P.R.China 100049 and Key Laboratory of Network Security and Cryptology, Fujian Normal Uni ...;State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing, P.R.China 100049
Venue:
Information Security and Cryptology
Year:
2009

Citing 10
Cited 3

Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Convertible Undeniable Signatures

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Short Signatures from the Weil Pairing

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Undeniable Signatures

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Formal definition and construction of nominative signature

ICICS'07 Proceedings of the 9th international conference on Information and communications security
On the security of nominative signatures

ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
3-Move undeniable signature scheme

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Hierarchical identity based encryption with constant size ciphertext

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Provably secure pairing-based convertible undeniable signature with short signature length

Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography

Pairing-based nominative signatures with selective and universal convertibility

Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
Non-transferable user certification secure against authority information leaks and impersonation attacks

ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
One-Move convertible nominative signature in the standard model

ProvSec'12 Proceedings of the 6th international conference on Provable Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nominative signature, introduced by Kim, Park and Won, is a useful cryptographic primitive to limit the publicly verifiable property of ordinary digital signature. In a nominative signature scheme, a nominator and a nominee jointly generate a signature in such a way that only the nominee can check the validity of the signature and further convince a third party of the fact. An extended concept, convertible nominative signature, was introduced by Huang and Wang. In the new concept, the nominee can convert a nominative signature into a publicly verifiable one. In this paper, we first propose selectively and universally convertible nominative signatures so that the nominee can publish a selective proof to convert a nominative signature into a publicly verifiable one, or issue a universal proof to make all nominative signatures with respect to the nominator and the nominee publicly verifiable. Then, we present a security model for convertible nominative signatures. Furthermore, we propose a concrete scheme based on bilinear pairings and give the security analysis in the random oracle model.