By Topic

Provably Secure Blind ID-Based Strong Designated Verifier Signature Scheme

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ning Zhang ; School of Science, Beijing University of Posts and Telecommunications, Beijing, China 100876. Email: zhangning0619@hotmail.com ; Qiaoyan Wen

We propose a provably secure blind ID-based strong designated verifier signature (BIDSDVS) scheme in this paper. We first define the BIDSDVS scheme model with the relevant security notions. Then a new concrete provably secure IDSDVS scheme is presented with the random oracle model. Based on our IDSDVS scheme, we give the BIDSDVS scheme, and provide the proofs of the blindness and the parallel one-more unforgeability (plm-uf) which is reduced to Schnorrs ROS Problem in the random oracle model plus the generic group and pairing model (ROM+GGPM).

Published in:

Communications and Networking in China, 2007. CHINACOM '07. Second International Conference on

Date of Conference:

22-24 Aug. 2007