13 citations · 18 across the 3 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2001
Lower Bounds for Zero-knowledge on the Internet
Joe Kilian, Erez Petrank, Charles Rackoff
We consider zero knowledge interactive proofs in a richer, more realistic communication environment. In this setting, one may simultaneously engage in many interactive proofs, and…
cs.CR2001★ 5 cited
On Concurrent and Resettable Zero-Knowledge Proofs for NP
Joe Kilian, Erez Petrank, Ransom Richardson
A proof is concurrent zero-knowledge if it remains zero-knowledge when many copies of the proof are run in an asynchronous environment, such as the Internet. It is known that zero-…