Advertisement

Distributed Provers with Applications to Undeniable Signatures

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

Abstract

This paper introduces distributed prover protocols. Such a protocol is a proof system in which a polynomially bounded prover is replaced by many provers each having partial information about the witness owned by the original prover. As an application of this concept, it is shown how the signer of undeniable signatures can distribute part of his secret key to n agents such that any k of these can verify a signature. This facility is useful in most applications of undeniable signatures, and as the proposed protocols are practical, the results in this paper makes undeniable signatures more useful. The first part of the paper describes a method for verifiable secret sharing, which allows non-interactive verification of the shares and is as secure as the Shamir secret sharing scheme in the proposed applications.

Keywords

Secret Sharing Proof System Discrete Logarithm Secret Sharing Scheme Auxiliary Input 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [BCDP90]
    J. Boyar, D. Chaum, I. Damgård, and T. Pedersen. Convertible undeniable signatures, 1990. To appear in the proceedings of Crypto’90.Google Scholar
  2. [BOGKW88]
    M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multiprover interactive proofs: How to remove intractability. In Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, pages 113–131, 1988.Google Scholar
  3. [CDvdG88]
    D. Chaum, I. Damgård, and J. van de Graaf. Multiparty computations ensuring privacy of each party’s input and correctness of the result. In Advances in Cryptology — proceedings of CRYPTO 87, Lecture Notes in Computer Science, pages 87–119. Springer-Verlag, 1988.Google Scholar
  4. [Cha91]
    D. Chaum. Zero-knowledge undeniable signatures. In Advances in Cryptology — proceedings of EUROCRYPT 90, Lecture Notes in Computer Science, pages 458–464. Springer Verlag, 1991.Google Scholar
  5. [CvA90]
    D. Chaum and H. van Antwerpen. Undeniable signatures. In Advances in Cryptology — proceedings of CRYPTO 89, Lecture Notes in Computer Science. Springer Verlag, 1990.Google Scholar
  6. [P.F87]
    P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science, pages 427–437, 1987.Google Scholar
  7. [Sha79]
    A. Shamir. How to share a secret. CACM, 22:612–613, 1979.zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Torben Pryds Pedersen
    • 1
  1. 1.Computer Science DepartmentAarhus UniversityÅrhus CDenmark

Personalised recommendations