• Publications
  • Influence
Multiparty unconditionally secure protocols
It is shown that any reasonable multiparty protocol can be achieved if at least 2n/3 of the participants are honest and the secrecy achieved is unconditional.
Generalized privacy amplification
This paper provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett, Brassard and Robert (1988) for a special scenario. The results have
Minimum Disclosure Proofs of Knowledge
This paper unifies and extends models and techniques previously put forward by the authors, and compares some independent related work.
Generalized privacy amplification
This paper provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett, Brassard, and Robert for a special scenario, and yields results on wiretap and broadcast channels for a considerably strengthened definition of secrecy capacity.
Achieving oblivious transfer using weakened security assumptions
The authors present some general techniques for establishing the cryptographic strength of a wide variety of games and show that a noisy telephone line is in fact a very sophisticated cryptographic device.
All-or-Nothing Disclosure of Secrets
An all-or-nothing disclosure is one by which, as soon as Bob has gained any information whatsoever on one of Alice’s secrets, he has wasted his chances to learn anything about the other secrets.
Teleporting an unknown quantum state via dual classical and EPR channels
An unknown quantum state ji can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical EPR correlations. To do so the sender, \Alice," and the
Authentication of quantum messages
A non-interactive scheme that enables A to both encrypt and authenticate an m qubit message by encoding it into m+s qubits, where the error probability decreases exponentially in the security parameter s, and a lower bound of 2m key bits for authenticating m qubits is given, which makes the protocol asymptotically optimal.
Efficient Cryptographic Protocols Based on Noisy Channels
  • C. Crépeau
  • Computer Science, Mathematics
  • 11 May 1997
These protocols provide efficient protocols to achieve the cryptographic primitives of Bit Commitment and Oblivious Transfer based on the existence of a Binary Symmetric Channel that allow two people to extract secret information from partially compromised data.