Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments

  • University College London
  • Published 2017
We construct practical and efficient zero-knowledge arguments with sublinear communication complexity. The arguments have perfect completeness, perfect special honest verifier zero-knowledge and computational soundness. Our zero-knowledge arguments rely on two-tiered homomorphic commitments for which pairing-based constructions already exist. As a concrete… CONTINUE READING