8,042 research outputs found
Multi-party Quantum Computation
We investigate definitions of and protocols for multi-party quantum computing
in the scenario where the secret data are quantum systems. We work in the
quantum information-theoretic model, where no assumptions are made on the
computational power of the adversary. For the slightly weaker task of
verifiable quantum secret sharing, we give a protocol which tolerates any t <
n/4 cheating parties (out of n). This is shown to be optimal. We use this new
tool to establish that any multi-party quantum computation can be securely
performed as long as the number of dishonest players is less than n/6.Comment: Masters Thesis. Based on Joint work with Claude Crepeau and Daniel
Gottesman. Full version is in preparatio
A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM
Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a
number of applications, in particular, as an essential building block for
two-party and multi-party computation. We construct a round-optimal (2 rounds)
universally composable (UC) protocol for oblivious transfer secure against
active adaptive adversaries from any OW-CPA secure public-key encryption scheme
with certain properties in the random oracle model (ROM). In terms of
computation, our protocol only requires the generation of a public/secret-key
pair, two encryption operations and one decryption operation, apart from a few
calls to the random oracle. In~terms of communication, our protocol only
requires the transfer of one public-key, two ciphertexts, and three binary
strings of roughly the same size as the message. Next, we show how to
instantiate our construction under the low noise LPN, McEliece, QC-MDPC, LWE,
and CDH assumptions. Our instantiations based on the low noise LPN, McEliece,
and QC-MDPC assumptions are the first UC-secure OT protocols based on coding
assumptions to achieve: 1) adaptive security, 2) optimal round complexity, 3)
low communication and computational complexities. Previous results in this
setting only achieved static security and used costly cut-and-choose
techniques.Our instantiation based on CDH achieves adaptive security at the
small cost of communicating only two more group elements as compared to the
gap-DH based Simplest OT protocol of Chou and Orlandi (Latincrypt 15), which
only achieves static security in the ROM
Secure certification of mixed quantum states with application to two-party randomness generation
We investigate sampling procedures that certify that an arbitrary quantum
state on subsystems is close to an ideal mixed state
for a given reference state , up to errors on a few positions. This
task makes no sense classically: it would correspond to certifying that a given
bitstring was generated according to some desired probability distribution.
However, in the quantum case, this is possible if one has access to a prover
who can supply a purification of the mixed state.
In this work, we introduce the concept of mixed-state certification, and we
show that a natural sampling protocol offers secure certification in the
presence of a possibly dishonest prover: if the verifier accepts then he can be
almost certain that the state in question has been correctly prepared, up to a
small number of errors.
We then apply this result to two-party quantum coin-tossing. Given that
strong coin tossing is impossible, it is natural to ask "how close can we get".
This question has been well studied and is nowadays well understood from the
perspective of the bias of individual coin tosses. We approach and answer this
question from a different---and somewhat orthogonal---perspective, where we do
not look at individual coin tosses but at the global entropy instead. We show
how two distrusting parties can produce a common high-entropy source, where the
entropy is an arbitrarily small fraction below the maximum (except with
negligible probability)
- …