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.

Key Words:

• Identity-based threshold signature
• provable security
• standard model

Additional information

Notes on contributors

H. Xiong

Hu Xiong received his B.S. and M.S. degrees from University of Electronic Science and Technology of China in 2004 and 2006 respectively. He is now a Ph.D. candidate in School of Computer Science and Engineering, University of Electronic Science and Technology of China. His recent research interests include information security and cryptography.

F. Li

Fagen Li received his B.S. degree from Luoyang Institute of Technology, Luoyang, P.R. China in 2001, M.S. degree from Hebei University of Technology, Tianjin, P.R. China in 2004, and Ph.D. degree in Cryptography from Xidian University, Xi’an, P.R. China in 2007. He is now a lecturer in the School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, P.R. China. His recent research interests include cryptography and network security.

Z. Qin

Zhiguang Qin isa professorinthe School of Computer Science and Engineering, University of Electronic Science and Technology of China. He received his Ph.D. degree from University of Electronic Science and Technology of China in 1996. His research interests include information security and computer network.