Universite de Montreal + (2007)
Gilles Brassard, Claude Crepeau, Dominic Mayers, Louis Salvail
Can quantum mechanics be harnessed to provide unconditionally secure bit commitment schemes and other cryptographic primitives beyond key distribution? We review the general impossibility proof of...
Howard Barnum, Claude Crepeau, Daniel Gottesman, Adam Smith
Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical private key want to exchange a classical message with the guarantee that the message...
Christian Cachin, Claude Crepeau, Julien Marcil
We propose a protocol for oblivious transfer that is unconditionally secure under the sole assumption that the memory size of the receiver is bounded. The model assumes that a random bit string...
Christian Cachin, Claude Crepeau, Julien Marcil
We propose a protocol for oblivious transfer that is unconditionally secure under the sole assumption that the memory size of the receiver is bounded. The model assumes that a random bit string...
Claude Crepeau, Daniel Gottesman, Adam Smith
Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical private key want to exchange a message with the guarantee that the message has not...
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes (2005)
Crepeau, Claude, Gottesman, Daniel, Smith, Adam
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding and encoded Hilbert...
Secure Multi-party Quantum Computing (2002)
Crepeau, Claude, Gottesman, Daniel, Smith, Adam
Secure multi-party computing, also called "secure function evaluation", has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum...
Authentication of Quantum Messages (2002)
Barnum, Howard, Crepeau, Claude, Gottesman, Daniel, Smith, Adam, Tapp, Alain
Authentication is a well-studied area of classical cryptography: a sender S and a receiver R sharing a classical private key want to exchange a classical message with the guarantee that the message...
Defeating Classical Bit Commitments With a Quantum Computer (1998)
Gilles Brassard, Claude Crepeau, Dominic Mayers, Louis Salvail
It has been recently shown by Mayers that no bit commitment is secure if the participants have unlimited computational power and technology. However it was noticed that a secure protocol could be...
Efficient Cryptographic Protocols based on Noisy Channels (1997)
. The Wire-Tap Channel of Wyner [19] shows that a Binary Symmetric Channel may be used as a basis for exchanging a secret key, in a cryptographic scenario of two honest people facing an eavesdropper....
Oblivious Transfers and Intersecting Codes (1996)
Gilles Brassard, Claude Crepeau, Miklos Santha, Ecole Normale Sup'erieure
Assume A owns t secret k--bit strings. She is willing to disclose one of them to B, at his choosing, provided he does not learn anything about the other strings. Conversely, B does not want A to...
Oblivious verification of common string (1995)
Abstract. We consider a situation where two parties,
Sorting Out Zero-Knowledge (1990)
Gilles Brassard, Claude Crepeau
this paper is to explain the various notions involved and to offer a new terminology that emphasizes their differences. There are two orthogonal aspects to zero-knowledge interactive proofs. One is...
Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds (1989)
Gilles Brassard, Departement Iro, Claude Crepeau, Moti Yung
A perfect zero-knowledge interactive protocol allows a prover to convince a verifier of the validity of a statement in a way that does not give the verifier any additional information [GMR,GMW]. Such...
Equivalence Between Two Flavours of Oblivious Transfers (1988)
This paper presents a proof that these two notions are computationally equivalent. Essentially, we show a protocol for "one-out-of-two oblivious transfer", based on the existence of a...
The Generation of Random Numbers That Are Probably Prime (1988)
Pierre Beauchemin, Gilles Brassard, Claude Crepeau, Claude Goutier, Carl Pomerance
In this paper we make two observations on Rabin's probabilistic primality test. The first is a provocative reason why Rabin's test is so good. It turned out that a single iteration has a...
Zero-Knowledge Simulation of Boolean Circuits (1987)
Gilles Brassard, Claude Crepeau
A zero-knowledge interactive proof is a protocol by which Alice can convince a polynomially-bounded Bob of the truth of some theorem without giving him any hint as to how the proof might proceed....
Two Observations on Probabilistic Primality Testing (1987)
Pierre Beauchemin, Gilles Brassard, Claude Crepeau, Claude Goutier
In this note, we make two loosely related observations on Rabin's probabilistic primality test. The first remark gives a rather strange and provocative reason as to why is Rabin's test so...
All-or Nothing Disclosure of Secrets (1987)
Gilles Brassard, Claude Crepeau, Canada Hc J, Jean-Marc Robert
this paper a practical computationally secure solution. This solution is inspired by our work on zero-knowledge interactive protocols [BC1, BC2]. In a companion paper [BCR], we show how to...
A secure poker protocol that minimizes the effect of player coalitions (1986)
What can we expect from a poker protocol? How close to reality can we come? From the outset of this research, we realized that a cryptographic protocol could achieve more security than its real life...
Gilles Brassard, Claude Crepeau
A perfect zero-knowledge interactive proof is a protocol by which Alice can convince Bob of the truth of some theorem in a way that yields no information as to how the proof might proceed (in the...