Rapid demonstration of linear relations connected by boolean operators

  • Authors:
  • Stefan Brands

  • Affiliations:
  • DigiCash, VA, Amsterdam, The Netherlands

  • Venue:
  • EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Consider a polynomial-time prover holding a set of secrets. We describe how the prover can rapidly demonstrate any satisfiable boolean formula for which the atomic propositions are relations that are linear in the secrets, without revealing more information about the secrets than what is conveyed by the formula itself. Our protocols support many proof modes, and are as secure as the Discrete Logarithm assumption or the RSA/factoring assumption.