Short Signature for Specified Verifier
Xiao Guo-zhen · Dianzi xuebao · 2008
Based on bilinear pairings,a new short signature scheme is proposed which can only be verified by the specified verifier in this paper.The signature of messages is dropped from the 1024 bits for RSA signature algorithm to around 170 bits,which reduces the flow of data network,avoids the congestion efficiently and increases the usage of the network.The characteristic,the designated verifier only can verify the correctness of the message's signature,prevents the disclosure of the signer's any relevant information.Presumed the difficulty of Computational Diffie-Hellman Problem,the security proofs for the new signature scheme is given in the random oracle model and its application is put forward on will subscription.