高级检索

    基于离散对数的(t,n)门陷共享验证签名方案

    A(t,n)THRESHOLD SHARED VERIFICATION SIGNATURE SCHEME BASED ON DISCRETE LOGARITHMS

    • 摘要: 文中基于离散对数给出了一种安全的(t,n)门陷共享验证签名方案.该方案是信息恢复数字签名方案和(t,n)门陷方案的集成,并保留了它们的优点.在该方案中,签名者利用其个人密钥可以生成信息签名的密文并送给特定的验证组,采用(t,n)门陷方案的该验证组n位中的t位能共享对信息进行恢复的权力.该方案与已有文献所提出的(t,n)方案及其改进方案相比,数据传输更安全,所要求的通信代价小.

       

      Abstract: Based on discrete logarithms, a secure (t, n)threshold shared verification signature scheme is proposed in this paper. The scheme integrates signature scheme with message recovery and the (t, n)threshold scheme, and preserves the merits inherent in them. In the scheme, the signer may generate a ciphertext of signature for a message by using his own personal key,and transmit the ciphertext to a specified group of verifiers which adopts (t,n)threshold scheme. Any t out of n verifiers in the group can share the authoring for message recovery. Compared with Harn’s (t,n)scheme and its further modification, the proposed scheme achieves more secrecy of data transmission, and requires smaller communication cost.

       

    /

    返回文章
    返回