3 papers
quant-ph2019
Practical Relativistic Zero-Knowledge for NP
Claude Crépeau, Arnaud Massenet, Louis Salvail +2
In this work we consider the following problem: in a Multi-Prover environment, how close can we get to prove the validity of an NP statement in Zero-Knowledge ? We exhibit a set of…
quant-ph2019
Non-Locality and Zero-Knowledge MIPs
Claude Crépeau, Nan Yang
The foundation of zero-knowledge is the simulator: a weak machine capable of pretending to be a weak verifier talking with all-powerful provers. To achieve this, simulators need so…
quant-ph2018
Verifier Non-Locality in Interactive Proofs
Claude Crépeau, Nan Yang
In multi-prover interactive proofs, the verifier interrogates the provers and attempts to steal their knowledge. Other than that, the verifier's role has not been studied. We have…