Tools for proving zero knowledge

  • Authors:

  • Ingrid Biehl;Johannes Buchmann;Bernd Meyer;Christian Thiel;Christoph Thiel

  • Affiliations:

  • Universität des Saarlandes, Fachbereich Informatik, Saarbrücken, Germany;Universität des Saarlandes, Fachbereich Informatik, Saarbrücken, Germany;Universität des Saarlandes, Fachbereich Informatik, Saarbrücken, Germany;Universität des Saarlandes, Fachbereich Informatik, Saarbrücken, Germany;Universität des Saarlandes, Fachbereich Informatik, Saarbrücken, Germany

  • Venue:
  • EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

We develop general techniques that can be used to prove the zero knowledge property of most of the known zero knowledge protocols. Those techniques consist in reducing the circuit indistinguishability of the output distributions of two probabilistic Turing machines to the indistinguishability of the output distributions of certain subroutines.