Skip to main navigation Skip to search Skip to main content

Adaptively secure threshold signature scheme in the standard model

  • Zecheng Wang*
  • , Haifeng Qian
  • , Zhibin Li
  • *Corresponding author for this work
  • East China Normal University
  • Anhui University of Finance and Economics

Research output: Contribution to journal › Article › peer-review

Abstract

We propose a distributed key generation protocol for pairing-based cryptosystems which is adaptively secure in the erasure-free and secure channel model, and at the same time completely avoids the use of interactive zero-knowledge proofs. Utilizing it as the threshold key generation protocol, we present a secure (t,n) threshold signature scheme based on the Waters' signature scheme. We prove that our scheme is unforgeable and robust against any adaptive adversary who can choose players for corruption at any time during the run of the protocols and make adaptive chosen-message attacks. And the security proof of ours is in the standard model (without random oracles). In addition our scheme achieves optimal resilience, that is, the adversary can corrupt any t<n/2 players.

Original languageEnglish
Pages (from-to)591-612
Number of pages22
JournalInformatica (Netherlands)
Volume20
Issue number4
StatePublished - 2009

Keywords

  • Adaptively secure
  • Computational Diffie-Hellman problem
  • Distributed key generation
  • Provable security
  • Threshold signature

Fingerprint

Dive into the research topics of 'Adaptively secure threshold signature scheme in the standard model'. Together they form a unique fingerprint.

Cite this