Certificateless strong designated verifier multi-signature

In order to satisfy the application requirements in the fields of judicial administration,e-government,etc.,the definition and security model for certificateless strong designated verifier multi-signature were proposed.Then,the first certificateless strong designated verifier multi-signature scheme...

Full description

Saved in:
Bibliographic Details
Main Authors: Hong-zhen DU, Qiao-yan WEN
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2016-06-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2016112/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In order to satisfy the application requirements in the fields of judicial administration,e-government,etc.,the definition and security model for certificateless strong designated verifier multi-signature were proposed.Then,the first certificateless strong designated verifier multi-signature scheme from bilinear pairings was constructed and it was proved that the scheme is existentially unforgeable under the computational bilinear Diffie-Hellman assumption and the computational Diffie-Hellman assumption.Moreover,the scheme meets the properties of both strong designated verifier signatures and multi-signatures.The scheme achieves high efficiency since the length of designated verifier multi-signature generated by the scheme is only 160 bits and the computational cost of bilinear pairings necessary for verification algorithm is constant,i.e.,one bilinear pairing.So,it can be applied in wireless networks of the limited computing resources and network bandwidth.
ISSN:1000-436X