Certificateless Designated Verifier Signature Schemes

Authors:
Xinyi Huang;Willy Susilo;Yi Mu;Futai Zhang
Affiliations:
University of Wollongong, Australia;University of Wollongong, Australia;University of Wollongong, Australia;Nanjing Normal University, P.R. China
Venue:
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 02
Year:
2006

Citing 0
Cited 5

A secure anonymous routing protocol with authenticated key exchange for ad hoc networks

Computer Standards & Interfaces
Self-Generated-Certificate Public Key Cryptography and certificateless signature/encryption scheme in the standard model: extended abstract

ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Security analysis of the certificateless signature scheme proposed at SecUbiq 2006

EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
Self-generated-certificate public key encryption without pairing and its application

Information Sciences: an International Journal
Certificateless undeniable signatures from bilinear maps

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Designated verifier signature schemes allow a signer to convince a designated verifier, in such a way that only the designated verifier will believe with the authenticity of such a signature. The previous constructions of designated verifier signature rely on the underlying Public Key Infrastructure, that requires both signer and verifier to verify the authenticity of the public keys, and hence, the certificates are required. In contrast to the previous constructions, in this paper, we propose the first notion and construction of the certificateless designated verifier signature scheme. In our new notion, the necessity of certificates are eliminated. We show that our scheme satisfies all the requirements of the designated verifier signature schemes in the certificateless system. We also provide complete security proofs for our scheme and prove that our scheme is unforgeable under the assumption of the Gap Bilinear Diffie-Hellman Problem in the random oracle model.