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 flaw 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.
Chapter PDF
Similar content being viewed by others
References
M. Bellare, J. A. Garay, and T. Rabin. Fast Batch Verification for Modular Exponentiation and Digital Signatures. In Eurocrypt’ 98, LNCS 1403, pages 236–250. Springer-Verlag, 1998. Available at http://www-cse.ucsd.edu/users/mihir/.
M. Ben-Or, S. Goldwasser, and A. Widgerson. Completeness theorems for noncryptographic fault-tolerant distributed computing. In Proceedings of the 20th STOC, ACM, pages 1–10, 1988.
J. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, 1987.
D. Boneh and M. Franklin. Efficient Generation of Shared RSA Keys. In Crypto’ 97, LNCS 1294, pages 425–439. Springer-Verlag, 1997.
J. Camenisch and I. Damg∢rd. Verifiable Encryption and Applications to Group Signatures and Signature Sharing. Available at http://philby.ucsd.edu/cryptolib/1999/99-08.html, march 1999.
R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. In Journal of Cryptology, Volume 13, pages 143–202. Springer-Verlag, 2000.
C. Canetti, R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Adaptive Security for Threshold Cryptosystems. In Crypto’ 99, LNCS 1666, pages 98–115. Springer-Verlag, 1999.
Y. Dodis and S. Micali. Parallel Reducibility for Information-Theretically Secure Computation. In Crypto’ 00, LNCS 1880, pages 74–92. Springer-Verlag, 2000.
P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In Proceedings of the 28th annual Symposium on the Foundations of Computer Science. IEEE, 1987.
Y. Frankel, P. Gemmel, Ph. Mac Kenzie, and M. Yung. Optimal-Resilience Proactive Public-Key Cryptosystems. In Proc. 38th FOCS, pages 384–393. IEEE, 1997.
Y. Frankel, P. Gemmel, Ph. Mac Kenzie, and M. Yung. Proactive RSA. In Crypto’ 97, LNCS 1294, pages 440–454. Springer-Verlag, 1997.
Y. Frankel, P. Mac Kenzie, and M. Yung. Adaptively-Secure Optimal-Resilience Proactive RSA. In Asiacrypt’ 99, LNCS. Springer-Verlag, 1999.
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure Distributed Key Generation for Discrete-Log Cryptosystems. In Eurocrypt’ 99, LNCS 1592, pages 295–310. Springer-Verlag, 1999.
N. Gilboa. Two Party RSA Key Generation. In Crypto’ 99, LNCS 1666, pages 116–129. Springer-Verlag, 1999.
S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Sciences, 28:270–299, 1984.
S. Jarecki and A. Lysyanskaya. Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures. In Eurocrypt’ 00, LNCS 1807, pages 221–242. Springer-Verlag, 2000.
D. Naccache and J. Stern. A New Cryptosystem based on Higher Residues. In Proc. of the 5th CCS, pages 59–66. ACM press, 1998.
T. Okamoto and S. Uchiyama. A New Public Key Cryptosystem as Secure as Factoring. In Eurocrypt’ 98, LNCS 1403, pages 308–318. Springer-Verlag, 1998.
P. Paillier. Public-Key Cryptosystems Based on Discrete Logarithms Residues. In Eurocrypt’ 99, LNCS 1592. Springer-Verlag, 1999.
T.P. Pedersen. A Threshold Cryptosystem without a Trusted Party. In Eurocrypt’ 91, LNCS 547, pages 522–526. Springer-Verlag, 1991.
T.P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In Crypto’91, LNCS 576, pages 129–140. Springer-Verlag, 1991.
G. Poupard and J. Stern. Generation of Shared RSA Keys by Two Parties. In Asiacrypt’ 98, LNCS 1514, pages 11–24. Springer-Verlag, 1998.
G. Poupard and J. Stern. Fair Encryption of RSA Keys. In Proceedings of Eurocrypt 2000, Lecture Notes in Computer Science. Springer-Verlag, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fouque, PA., Stern, J. (2001). One Round Threshold Discrete-Log Key Generation without Private Channels. In: Kim, K. (eds) Public Key Cryptography. PKC 2001. Lecture Notes in Computer Science, vol 1992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44586-2_22
Download citation
DOI: https://doi.org/10.1007/3-540-44586-2_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41658-6
Online ISBN: 978-3-540-44586-9
eBook Packages: Springer Book Archive