Provably Secure Identity Based Threshold Signature Withoutrandom Oracles

Abstract Recently, Paterson and Schuldt proposed an Identity-based (ID-based) signature scheme which is provably secure in the absence of random oracles. In this paper, we propose an ID-based threshold signature scheme based on their signature scheme. The proposed construction is proved secure in the standard model and its security rests on the hardness of discrete log assumption along with the computational Diffe-Hellman problem. To the best of our knowledge, previous-related schemes could only be proved secure in the random oracle model.

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

[2]  Hong Wang,et al.  Short Threshold Signature Schemes Without Random Oracles , 2005, INDOCRYPT.

[3]  Joonsang Baek,et al.  Identity-based threshold signature scheme from the bilinear pairings (extended abstract) , 2004, International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004..

[4]  Kenneth G. Paterson,et al.  Efficient Identity-Based Signatures Secure in the Standard Model , 2006, ACISP.

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

[6]  Adi Shamir,et al.  Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.

[7]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[8]  Tsz Hon Yuen,et al.  Practical Threshold Signatures Without Random Oracles , 2007, ProvSec.

[9]  Douglas R. Stinson,et al.  Provably Secure Distributed Schnorr Signatures and a (t, n) Threshold Scheme for Implicit Certificates , 2001, ACISP.

[10]  Dan Boneh,et al.  Secure Identity Based Encryption Without Random Oracles , 2004, CRYPTO.

[11]  H. Imai,et al.  Efficient and secure multiparty generation of digital signatures based on discrete logarithms , 1993 .

[12]  Dan Boneh,et al.  Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles , 2004, IACR Cryptol. ePrint Arch..

[13]  Mihir Bellare,et al.  An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem , 2004, EUROCRYPT.

[14]  Hugo Krawczyk,et al.  Robust Threshold DSS Signatures , 1996, Inf. Comput..

[15]  Brent Waters,et al.  Efficient Identity-Based Encryption Without Random Oracles , 2005, EUROCRYPT.

[16]  Tal Rabin,et al.  On the Security of Joint Signature and Encryption , 2002, EUROCRYPT.

[17]  Clifford C. Cocks.  An Identity Based Encryption Scheme Based on Quadratic Residues , 2001, IMACC.

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

[19]  Kwangjo Kim,et al.  New ID-Based Threshold Signature Scheme from Bilinear Pairings , 2004, INDOCRYPT.

[20]  Joonsang Baek,et al.  Identity-Based Threshold Decryption , 2004, Public Key Cryptography.