【摘要】 本文首次探讨了签密的门限生成问题,利用可验证秘密分享(VSS)和安全多方计算(MPC)技术提出了一个签密的门限生成协议。在该协议中,发送方的任何至少t个成员可生成对给定消息的有效的签密密文,而能勾结至多t-1个成员的攻击者无法伪造有效的签密密文。文中还改进了由Gennaro R, Jarecki S, Krawczyk H和Rabin T提出的计算秘密值的倒数的协议,使其效率得到了提高。更多还原

【Abstract】 In this paper, we propose a protocol for threshold generation of signcryption using the techniques of verifiable secret sharing (VSS) and secure multi-party computation (MPC). In the protocol, any t or more honest members can efficiently generate valid signcrypyion text of a given message, while the adversary whole corrupts up to t-1 group members cannot forge any valid signcryption text. The protocol of computing reciprocals of secrets presented by Gennaro R, Jarecki S, Krawczyk H and Rabin T is also modified so that the efficiency is improved.更多还原