A novel probabilistic signature based on bilinear square Diffie–Hellman problem and its extension
Article first published online: 13 AUG 2012
Copyright © 2012 John Wiley & Sons, Ltd.
Security and Communication Networks
Volume 6, Issue 6, pages 757–764, June 2013
How to Cite
Wu, T.-S. and Lin, H.-Y. (2013), A novel probabilistic signature based on bilinear square Diffie–Hellman problem and its extension. Security Comm. Networks, 6: 757–764. doi: 10.1002/sec.608
- Issue published online: 22 APR 2013
- Article first published online: 13 AUG 2012
- probabilistic signature;
- designated verifier;
- bilinear pairing;
- public key system
Digital signatures are just like hand-written ones, which guarantee integrity, authenticity, and nonrepudiation. On the basis of an intractable mathematical assumption, that is, bilinear square Diffie–Hellman problem, we give a concrete construction of the first provably secure probabilistic signature scheme and its extension to a universal designated verifier signature scheme. A universal designated verifier signature scheme allows any signature holder to designate a publicly verifiable signature to a specific verifier such that only the designated verifier can validate the signature for protecting the privacy of signature holder. In addition, the designated verifier is unable to convince any third party of the fact. Such schemes can be applied to privacy-preserving electronic applications such as the certificate for medical records and income summary. Our scheme is especially suitable for computation constrained devices because the signature generation and designation are pairing free. Copyright © 2012 John Wiley & Sons, Ltd.