Showing quant-phShow all
3 papers · 1 filter
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-ph1998
Defeating classical bit commitments with a quantum computer
Gilles Brassard, Claude Crépeau, Dominic Mayers +1
It has been recently shown by Mayers that no bit commitment scheme is secure if the participants have unlimited computational power and technology. However it was noticed that a se…
quant-ph1997
A brief review on the impossibility of quantum bit commitment
Gilles Brassard, Claude Crépeau, Dominic Mayers +1
The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the first time thirteen years ago. Bit commitment is sufficient in…