Linear Zero-Knowledge - A Note on Efficient Zero-Knowledge Proofs and Arguments

@article{Cramer1996LinearZ,
  title={Linear Zero-Knowledge - A Note on Efficient Zero-Knowledge Proofs and Arguments},
  author={Ronald Cramer and Ivan Damg{\aa}rd},
  journal={IACR Cryptology ePrint Archive},
  year={1996},
  volume={1996},
  pages={4}
}
We present a 4-move zero-knowledge proof system [21] for any NP language L, which allows showing that z E L with error probability y less than 2–k using communication corresponding to O(lsl=) + O(k) bit commitments, where c is a constant depending only on L. We also present a 4-move perfect zero knowledge interactive argument for any NP-language L. On input z c L, the communication complexity is O(lzlc) ~maz(k, 1) bits, where 1 is the security parameter for the prover 1. The protocols can be… CONTINUE READING
Highly Cited
This paper has 42 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…