A Threshold Cryptosystem without a Trusted Party

(Extended abstract)
  • Torben Pryds Pedersen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 547)

Abstract

In a threshold cryptosystem n members share the secret key of an organization such that k members (1≤kn) must cooperate in order to decipher a given ciphertext. In this note it is shown how to implement such a scheme without having a trusted party, which selects the secret key and distributes it to the members. In stead, the members choose the secret key and distribute it verifiably among themselves. Subsequently, this key can be used for authentication as well as secret communication.

References

  1. [Des88]
    Y. Desmedt. Society and group oriented cryptography: A new concept. In Advances in Cryptology-proceedings of CRYPTO 87, Lecture Notes in Computer Science, pages 120–127, 1988.Google Scholar
  2. [DF90]
    Y. Desmedt and Y. Frankel. Threshold cryptosystems. In Advances in Cryptology-proceedings of CRYPTO 89, Lecture Notes in Computer Science, pages 307–315, 1990.CrossRefGoogle Scholar
  3. [EG85]
    T. El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In Advances in Cryptology-proceedings of CRYPTO 84, Lecture Notes in Computer Science. Springer-Verlag, 1985.Google Scholar
  4. [Fra90]
    Y. Frankel. A practical protocol for large group oriented networks. In Advances in Cryptology-proceedings of EUROCRYPT 89, Lecture Notes in Computer Science, pages 56–61. Springer-Verlag, 1990.Google Scholar
  5. [Hwa91]
    T. Hwang. Cryptosystem for group oriented cryptography. In Advances in Cryptology-proceedings of EUROCRYPT 90, Lecture Notes in Computer Science, pages 352–360. Springer-Verlag, 1991.Google Scholar
  6. [IS91]
    I. Ingemarsson and G. J. Simmons. A protocol to set up shared secret schemes without the assistance of a mutually trusted party. In Advances in Cryptology-proceedings of EUROCRYPT 90, Lecture Notes in Computer Science, pages 266–282. Springer-Verlag, 1991.Google Scholar
  7. [Sha79]
    A. Shamir. How to share a secret. CACM, 22:612–613, 1979.MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Torben Pryds Pedersen
    • 1
  1. 1.Computer Science DepartmentAarhus UniversityAarhus

Personalised recommendations