4 citations · 7 across the 2 of their papers we have counts for
5 papers · 1 filter
The Universal Composable Security of Quantum Key Distribution
M. Ben-Or, Michal Horodecki, D. W. Leung +2
The existing unconditional security definitions of quantum key distribution (QKD) do not apply to joint attacks over QKD and the subsequent use of the resulting key. In this paper,…
General Security Definition and Composability for Quantum & Classical Protocols
Michael Ben-Or, Dominic Mayers
We generalize the universally composable definition of Canetti to the Quantum World. The basic idea is the same as in the classical world. The main contribution is that we unfold t…
Fault-Tolerant Quantum Computation With Constant Error Rate
Dorit Aharonov, Michael Ben-Or
This paper proves the threshold result, which asserts that quantum computation can be made robust against errors and inaccuracies, when the error rate, , is smaller than a const…
Polynomial Simulations of Decohered Quantum Computers
Dorit Aharonov, Michael Ben-Or
We define formally decohered quantum computers (using density matrices), and present a simulation of them by a probabalistic classical Turing Machine. We study the slowdown of the…
Limitations of Noisy Reversible Computation
D. Aharonov, M. Ben-Or, R. Impagliazzo +1
Noisy computation and reversible computation have been studied separately, and it is known that they are as powerful as unrestricted computation. We study the case where both noise…