Next: Using the FGLSS-reduction to
Up: Back at Weizmann (1998-2003)
Previous: Concurrent Zero-Knowledge With Timing,
Universal-arguments are computationally-sound proof systems
that combine instance-based prover-efficiency condition of CS-proofs
with the computational-soundness condition of argument systems.
This work shows that universal-arguments can be constructed based on
standard intractability assumptions that refer to polynomial-size circuits
(rather than assumptions referring to subexponential-size circuits
as used in the construction of CS-proofs), and that the former
suffice for Barak's non-black-box zero-knowledge arguments.
Comments:
Authored by B. Barak and O. Goldreich. Appeared in
- Proceedings of 17th CCC, pages 194-203, 2002.
Oded Goldreich
2003-07-30