activity
19962004
most citedSelf testing quantum apparatus

23 citations · 34 across the 4 of their papers we have counts for

collaborators
Showing quant-phShow all

9 papers · 1 filter

quant-ph20044 cited

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,…

quant-ph20043 cited

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…

quant-ph200323 cited

Self testing quantum apparatus

Dominic Mayers, Andrew Yao

We study a configuration of devices that includes (1) a source of some unknown bipartite quantum state that is claimed to be the Bell state and (2) two commuting but otherwis…

quant-ph20024 cited

Superselection Rules in Quantum Cryptography

Dominic Mayers

It is believed that superselection rules in quantum mechanics can restrict the possible operation on a qbit. If this was true, the model used by Mayers for the impossibility of bit…

quant-ph1998

Quantum Cryptography with Imperfect Apparatus

Dominic Mayers, Andrew Yao

Quantum key distribution, first proposed by Bennett and Brassard, provides a possible key distribution scheme whose security depends only on the quantum laws of physics. So far the…

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…