中文摘要：

基于双线性对运算,提出了一个只能被指定验证者验证的新的短签名方案，把消息的签名从基于RSA签名算法的1024比特下降到170比特左右,降低了网络数据流量,有效地避免了网络中常见的阻塞问题,提高了网络使用率，同时满足了只有签名者指定的验证人才能正确验证该签名的正确性,可以有效防止对与签名人相关信息的泄露，在计算性Diffie-Hellman问题困难假设下利用随机预言模型证明了该方案的安全性，并且根据实际情况下的遗嘱签定,给出了遗嘱签定协议的具体应用。

英文摘要：

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.