Practical Threshold Signatures Without Random Oracles

  • Jin Li
  • Tsz Hon Yuen
  • Kwangjo Kim
Conference paper

DOI: 10.1007/978-3-540-75670-5_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4784)
Cite this paper as:
Li J., Yuen T.H., Kim K. (2007) Practical Threshold Signatures Without Random Oracles. In: Susilo W., Liu J.K., Mu Y. (eds) Provable Security. ProvSec 2007. Lecture Notes in Computer Science, vol 4784. Springer, Berlin, Heidelberg

Abstract

We propose a secure threshold signature scheme without trusted dealer. Our construction is based on the recently proposed signature scheme of Waters in EUROCRYPT’05. The new threshold signature scheme is more efficient than the previous threshold signature schemes without random oracles. Meanwhile, the signature share generation and verification algorithms are non-interactive. Furthermore, it is the first threshold signature scheme based on the computational Diffie-Hellman (CDH) problem without random oracles.

Keywords

Threshold Signature Bilinear groups CDH problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Jin Li
    • 1
  • Tsz Hon Yuen
    • 2
  • Kwangjo Kim
    • 1
  1. 1.International Research center for Information Security (IRIS), Information and Communications University(ICU), 103-6 Munji-Dong, Yuseong-Gu, Daejeon, 305-732Korea
  2. 2.School of Information Technology and Computer Science, University of Wollongong, NSW 2522Australia

Personalised recommendations