基于对的签名到泛（多）指定验证者签名的新扩展
New Extensions of Pairing-based Signatures into Universal (Multi) Designated Verifier Signatures
摘要：
通用指定验证者签名的概念是由Steinfeld、Bull、Wang和Pieprzyk在2003年的Asiacrypt上提出的。这些签名可以用作标准的可公开验证的数字签名，但是具有允许签名的任何持有者将签名指定给任何期望的验证者的附加功能。这个指定的验证者可以检查消息是否确实被签名，但是不能使任何其他人相信这一事实。我们提出了新的有效的构造基于配对的短签名。第一个方案基于Boneh-Boyen签名，其安全性可以在标准安全模型下进行分析。我们证明了它的抵抗伪造假设的硬度，所谓的强Diffie-Hellman问题，知识的指数假设。第二个方案是兼容的Boneh-Lynn-Shacham签名，并被证明是不可伪造的，在随机预言模型下，假设计算双线性Diffie-Hellman问题是不可处理的。这两种方案都是为具有受限计算能力的设备而设计的，因为签名和指定过程是无配对的。最后，我们提出了扩展这些计划在多用户设置Desmedt在2003年提出的。
英文摘要：
The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be used as standard publicly verifiable digital signatures but have an additional functionality which allows any holder of a signature to designate the signature to any desired verifier. This designated verifier can check that the message was indeed signed, but is unable to convince anyone else of this fact. We propose new efficient constructions for pairing-based short signatures. Our first scheme is based on Boneh-Boyen signatures and its security can be analyzed in the standard security model. We prove its resistance to forgery assuming the hardness of the so-called strong Diffie-Hellman problem, under the knowledge-of-exponent assumption. The second scheme is compatible with the Boneh-Lynn-Shacham signatures and is proven unforgeable, in the random oracle model, under the assumption that the computational bilinear Diffie-Hellman problem is untractable. Both schemes are designed for devices with constrained computation capabilities since the signing and the designation procedure are pairing-free. Finally, we present extensions of these schemes in the multi-user setting proposed by Desmedt in 2003.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
