An enhanced (t,n) threshold directed signature scheme

被引:7
|
作者
Hwang, Jung Yeon [1 ]
Kim, Hyoung Joong [2 ]
Lee, Dong Hoon [2 ]
Song, Boyeon [3 ]
机构
[1] Elect & Telecommun Res Inst, Taejon 305700, South Korea
[2] Korea Univ, Grad Sch Informat Secur, Seoul 136701, South Korea
[3] Korea Inst Sci & Technol Informat, Taejon 305806, South Korea
基金
新加坡国家研究基金会;
关键词
Directed signature; Threshold; Designated verifier; Rogue-key attack; Forgery; SCALABLE PROTOCOLS; MULTISIGNATURES;
D O I
10.1016/j.ins.2014.02.038
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A directed signature scheme is devised to achieve directivity for verification such that only a designated verifier can check the validity of a signature and, in times of trouble, any third party can verify the signature with the help of the signer or the designated verifier. A threshold directed signature scheme distributes responsibility and authority for generating a directed signature to several users via a threshold mechanism. Lu et al. recently proposed a novel (t, n) threshold directed signature scheme. In this paper, we show that the scheme is vulnerable to a rogue-key attack which is mounted by an adversary who can arbitrarily select his or her public key. Through the rogue-key attack, the adversary can forge a signature on any message for a set of signers. In order to thwart such a rogue-key attack, we propose an enhanced (t, n) threshold directed signature scheme with a reliable key registration protocol. The protocol guarantees that a user should have access to the secret key corresponding to the user's public key. Under the computational Diffie-Hellman assumption, we prove that the improved scheme is secure, that is, it achieves existential unforgeability under the chosen message attack, invisibility, and transitivity in the registered key model. We stress that the security of our improved scheme does not depend on a specific broadcast channel for synchronous message transmission. (C) 2014 Elsevier Inc. All rights reserved.
引用
下载
收藏
页码:284 / 292
页数:9
相关论文
共 50 条
  • [31] Quantum (t,n) Threshold Proxy Blind Signature Scheme Based on Bell States
    Jing Yu
    Jianhua Zhang
    International Journal of Theoretical Physics, 61
  • [32] GROUP-ORIENTED (T,N) THRESHOLD DIGITAL SIGNATURE SCHEME AND DIGITAL MULTISIGNATURE
    HARN, L
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 1994, 141 (05): : 307 - 313
  • [33] An improved Authenticated (t, n) ECC Threshold Signature Encryption Scheme based on ECC
    Hu, Chao-Ju
    Zhang, Qun-Feng
    Wu, Fen-Lan
    PROCEEDINGS OF 2006 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2006, : 2674 - +
  • [34] Comments on "A practical (t,n) threshold proxy signature scheme based on the RSA cryptosystem"
    Wang, GL
    Bao, F
    Zhou, JY
    Deng, RH
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2004, 16 (10) : 1309 - 1311
  • [35] Digital Signature Scheme with a (t, l) Threshold Subliminal Channel Based on RSA Signature Scheme
    Li Wei
    Li Gang
    Xin Xiangjun
    2008 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, VOLS 1 AND 2, PROCEEDINGS, 2008, : 903 - +
  • [36] An enhanced pairing-free certificateless directed signature scheme
    Yang, Kaiqin
    PLOS ONE, 2022, 17 (02):
  • [37] Quantum (t, m, n) Threshold Group Blind Signature Scheme with Flexible Number of Participants
    Zhi-Ming Deng
    Dian-Jun Lu
    Teng Chen
    Hua-Jian Mou
    Xing-Jia Wei
    International Journal of Theoretical Physics, 62
  • [38] Quantum (t, m, n) Threshold Group Blind Signature Scheme with Flexible Number of Participants
    Deng, Zhi-Ming
    Lu, Dian-Jun
    Chen, Teng
    Mou, Hua-Jian
    Wei, Xing-Jia
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2023, 62 (09)
  • [39] Threshold-directed signature scheme based on hybrid number theoretic problems
    Mohamad, Mohd Saiful Adli
    ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2020, 13 (05)
  • [40] Secure(t,n) shared signature scheme
    Shi, Ronghua
    Hu, Xiangling
    Tiedao Xuebao/Journal of the China Railway Society, 2000, 22 (03): : 65 - 68