高级检索
    马春波, 何大可. 基于双线性映射的卡梅隆门限签名方案[J]. 计算机研究与发展, 2005, 42(8): 1427-1430.
    引用本文: 马春波, 何大可. 基于双线性映射的卡梅隆门限签名方案[J]. 计算机研究与发展, 2005, 42(8): 1427-1430.
    Ma Chunbo, He Dake. A New Chameleon Threshold Signature Based on Bilinear Pairing[J]. Journal of Computer Research and Development, 2005, 42(8): 1427-1430.
    Citation: Ma Chunbo, He Dake. A New Chameleon Threshold Signature Based on Bilinear Pairing[J]. Journal of Computer Research and Development, 2005, 42(8): 1427-1430.

    基于双线性映射的卡梅隆门限签名方案

    A New Chameleon Threshold Signature Based on Bilinear Pairing

    • 摘要: 考虑如下情况,有两个公司A,B通过网络进行通信.为了能安全地生成签字,公司A要求在有足够多的A内成员参与的情况下签字才能有效,并且,只有指定的接收者才能对签字进行验证.针对以上问题,考虑到对原始信息的有效保护,通过将秘密共享技术与卡梅隆函数相结合,提出了一种新的基于双线性映射的卡梅隆门限签名方案.此方案所生成的签名,只有指定接收方可以验证签名的正确性,且指定接收方不能向第3方证明签名是否有效;具有不可否认性;当争议发生时,可以在不暴露原始签名的条件下,鉴别伪造的签名;可以防止联合欺诈行为的发生.

       

      Abstract: Consider the following situations: there are two companies A and B, and they want to communicate with each other over the Internet. In order to generate a secure signature on behalf of the company A, A requires that only enough members in A can generate a valid signature by cooperation. At the same time, company A wants only the designated receiver who can verify the signature. Motivated by this consideration and the necessity of protecting the security of original information, this paper, which combines the sharing secret technology and Chameleon function, presents a new signature based on bilinear pairing. It is only the designated receiver that can verify the signature and can't convince the third party of the valid signature. It is undeniable and when a dispute occurs, the signer can prove the sig

       

    /

    返回文章
    返回