277 citations · 384 across the 8 of their papers we have counts for
9 papers
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…
On the Commitment Capacity of Unfair Noisy Channels
Claude Crépeau, Rafael Dowsley, Anderson C. A. Nascimento
Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exchanging secret-keys as well as realizing other cryptographic primitives such as c…
The RGB No-Signalling Game
Xavier Coiteux-Roy, Claude Crépeau
Introducing the simplest of all No-Signalling Games: the RGB Game where two verifiers interrogate two provers, Alice and Bob, far enough from each other that communication between…
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…
Non-Locality in Interactive Proofs
Claude Crépeau, Nan Yang
In multi-prover interactive proofs (MIPs), the verifier is usually non-adaptive. This stems from an implicit problem which we call ``contamination'' by the verifier. We make explic…
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
Michael Ben-Or, Claude Crépeau, Daniel Gottesman +2
Secret sharing and multiparty computation (also called "secure function evaluation") are fundamental primitives in modern cryptography, allowing a group of mutually distrustful pla…