Skip to Main content Skip to Navigation
Conference papers

One Round Threshold Discrete-Log Key Generation without Private Channels

Abstract : Pedersen designed the first scheme for generating Discrete-Log keys without any trusted dealer in 1991. As this protocol is simple and efficient, it appeared to be very attractive. For a long time, this robust algorithm has been trusted as being secure. However, in 1999, Gennaro et al. proved that one of the requirements is not guaranteed: more precisely, the property that the key is uniformly distributed in the key space. Their main objective was to repair the security flow without sacrificing on efficiency. As a result, the protocol became secure but somehow unpractical. In particular, the complaint phase, in which cheaters are thrown out, makes the scheme overly complex and difficult to deal with in practical situations. In order to avoid this phase and other drawbacks such as the initialization phase where private channels have to be created, we present a one-round scheme which generates a discrete-log key with public channels only. Finally, we show how to improve the efficiency of our algorithm when the number of servers increases.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00565274
Contributor : Pierre-Alain Fouque Connect in order to contact the contributor
Submitted on : Friday, February 11, 2011 - 3:13:50 PM
Last modification on : Friday, October 15, 2021 - 1:39:44 PM
Long-term archiving on: : Thursday, May 12, 2011 - 2:48:02 AM

File

pkc01.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00565274, version 1

Collections

Citation

Pierre-Alain Fouque, Jacques Stern. One Round Threshold Discrete-Log Key Generation without Private Channels. Public Key Cryptography, 4th International Workshop on Practice and Theory in Public Key Cryptography : PKC 2001, 2001, Cheju Island, South Korea. pp.300-316. ⟨inria-00565274⟩

Share

Metrics

Record views

179

Files downloads

691