Basic Questions about Zero Knowledge(II)
Q3: Concurrent Executions ? [Fe,DNS]
- Commitment schemes +timing assumptions constant rounds concurrent ZK arguments for NP [DNS,DS]
- Commitment schemes O(poly log) rounds concurrent ZK interactive proofs for NP [KR]
- O(log n) lower bounds on number of rounds necessary if black box simulation techniques used[KP+CR]