2nd International ICST Conference on Communications and Networking in China

Research Article

Provably Secure Blind ID-Based Strong Designated Verifier Signature Scheme

  • @INPROCEEDINGS{10.1109/CHINACOM.2007.4469393,
        author={Ning Zhang and Qiaoyan Wen},
        title={Provably Secure Blind ID-Based Strong Designated Verifier Signature Scheme},
        proceedings={2nd International ICST Conference on Communications and Networking in China},
        publisher={IEEE},
        proceedings_a={CHINACOM},
        year={2008},
        month={3},
        keywords={ROS Problem  blind ID-based strong designated verifier signature  blindness  parallel one-more unforgeability  random oracle model plus the generic group and pairing model},
        doi={10.1109/CHINACOM.2007.4469393}
    }
    
  • Ning Zhang
    Qiaoyan Wen
    Year: 2008
    Provably Secure Blind ID-Based Strong Designated Verifier Signature Scheme
    CHINACOM
    IEEE
    DOI: 10.1109/CHINACOM.2007.4469393
Ning Zhang1,*, Qiaoyan Wen1,*
  • 1: School of Science Beijing University of Posts and Telecommunications Beijing, China 100876
*Contact email: zhangning0619@hotmail.com, wqy@bupt.edu.cn

Abstract

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 (p1m-uf) which is reduced to Schnorrs ROS Problem in the random oracle model plus the generic group and pairing model (ROM+GGPM).