Zero-knowledge undeniable signatures (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
An efficient one-move Nominative Signature scheme
International Journal of Applied Cryptography
Modified Huang-Wang's Convertible Nominative Signature Scheme
ICYCS '08 Proceedings of the 2008 The 9th International Conference for Young Computer Scientists
Provably Secure Convertible Nominative Signature Scheme
Information Security and Cryptology
Nominative signature from ring signature
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
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
The security of the FDH variant of Chaum's undeniable signature scheme
IEEE Transactions on Information Theory
Provably secure pairing-based convertible undeniable signature with short signature length
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
One-Move convertible nominative signature in the standard model
ProvSec'12 Proceedings of the 6th international conference on Provable Security
| Hi-index | 0.00 |
A nominative signature scheme allows 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. In Inscrypt 2008, Zhao et al. proposed selectively and universally convertible nominative signatures, which equips the nominee with additional ability to publish a selective proof to convert a nominative signature into a publicly verifiable one (i.e. selective convertibility), or issue a universal proof to make all nominative signatures with respect to the nominator and the nominee publicly verifiable (i.e. universal convertibility). Finally, they left an open problem to construct a selectively and universally convertible nominative signature scheme from bilinear pairings which is provably secure under the conventional assumptions. In this paper, based on standard digital signature and undeniable signature, we propose a new selectively and universally convertible nominative signature scheme from bilinear pairings. Our scheme is efficient which is a one-move (i.e. non-interactive) convertible nominative signature scheme, and possesses short signature length compared with Zhao et al.'s scheme. Moreover, formal proofs are given to show that our scheme is secure under some conventional assumptions in the random oracle model. Based on our construction and further analysis, we think that nominative signatures are just the dual form of undeniable signatures in the concept; whether their dual property in the construction of the schemes has generality needs further investigation.