New (t, n) threshold directed signature scheme with provable security

Directed signature scheme allows only a designated verifier to check the validity of the signature issued to him; and at the time of trouble or if necessary, any third party can verify the signature with the help of the signer or the designated verifier as well. Due to its merits, directed signature scheme is widely used in situations where the receiver's privacy should be protected. Threshold directed signature is an extension of the standard directed signature, in which several signers may be required to cooperatively sign messages for sharing the responsibility and authority. To the best of our knowledge, threshold directed signature has not been well studied till now. Therefore, in this paper, we would like to formalize the threshold directed signature and its security model, then present a new (t,n) threshold directed signature scheme from bilinear pairings and use the techniques from provable security to analyze its security.

[1]  Zhenfu Cao,et al.  A Directed Signature Scheme Based on RSA Assumption , 2006, Int. J. Netw. Secur..

[2]  Victor Shoup,et al.  Sequences of games: a tool for taming complexity in security proofs , 2004, IACR Cryptol. ePrint Arch..

[3]  Jean-Jacques Quisquater,et al.  A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory , 1988, EUROCRYPT.

[4]  Chin-Chen Chang,et al.  A novel efficient (t, n) threshold proxy signature scheme , 2006, Inf. Sci..

[5]  Matthew K. Franklin,et al.  Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[6]  Robert H. Deng,et al.  Variations of Diffie-Hellman Problem , 2003, ICICS.

[7]  Zhenfu Cao,et al.  Threshold undeniable signature scheme based on conic , 2005, Appl. Math. Comput..

[8]  Zhenfu Cao,et al.  A traceable threshold signature scheme with multiple signing policies , 2006, Comput. Secur..

[9]  Zhenfu Cao,et al.  A robust (k, n) + 1 threshold proxy signature scheme based on factoring , 2005, Appl. Math. Comput..

[10]  Torben P. Pedersen.  Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.

[11]  Hovav Shacham,et al.  Short Signatures from the Weil Pairing , 2001, J. Cryptol..

[12]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[13]  Silvio Micali,et al.  A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..

[14]  David Chaum,et al.  Designated Confirmer Signatures , 1994, EUROCRYPT.

[15]  Kuo-Yu Tsai,et al.  Cryptanalysis and improvement of nonrepudiable threshold multi-proxy multi-signature scheme with shared verification , 2007, Inf. Sci..

[16]  Fabien Laguillaumie,et al.  Universally Convertible Directed Signatures , 2005, ASIACRYPT.

[17]  B. C. Brookes,et al.  Information Sciences , 2020, Cognitive Skills You Need for the 21st Century.

[18]  David Chaum,et al.  Undeniable Signatures , 1989, CRYPTO.

[19]  David Chaum,et al.  Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer , 1991, CRYPTO.

[20]  Wen-Guey Tzeng,et al.  Optimal resilient threshold GQ signatures , 2007, Inf. Sci..

[21]  Chae Hoon Lim,et al.  Modified Maurer-Yacobi's scheme and its applications , 1992, AUSCRYPT.

[22]  Victor Shoup,et al.  OAEP Reconsidered , 2001, CRYPTO.

[23]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[24]  Xinmei Wang,et al.  An identity-based signature and its threshold version , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).

[25]  Zhenfu Cao,et al.  Simulatability and security of certificateless threshold signatures , 2007, Inf. Sci..