6,175 research outputs found
Implementation vulnerabilities in general quantum cryptography
Quantum cryptography is information-theoretically secure owing to its solid
basis in quantum mechanics. However, generally, initial implementations with
practical imperfections might open loopholes, allowing an eavesdropper to
compromise the security of a quantum cryptographic system. This has been shown
to happen for quantum key distribution (QKD). Here we apply experience from
implementation security of QKD to several other quantum cryptographic
primitives. We survey quantum digital signatures, quantum secret sharing,
source-independent quantum random number generation, quantum secure direct
communication, and blind quantum computing. We propose how the eavesdropper
could in principle exploit the loopholes to violate assumptions in these
protocols, breaking their security properties. Applicable countermeasures are
also discussed. It is important to consider potential implementation security
issues early in protocol design, to shorten the path to future applications.Comment: 13 pages, 8 figure
Quantum-enhanced Secure Delegated Classical Computing
We present a quantumly-enhanced protocol to achieve unconditionally secure
delegated classical computation where the client and the server have both
limited classical and quantum computing capacity. We prove the same task cannot
be achieved using only classical protocols. This extends the work of Anders and
Browne on the computational power of correlations to a security setting.
Concretely, we present how a client with access to a non-universal classical
gate such as a parity gate could achieve unconditionally secure delegated
universal classical computation by exploiting minimal quantum gadgets. In
particular, unlike the universal blind quantum computing protocols, the
restriction of the task to classical computing removes the need for a full
universal quantum machine on the side of the server and makes these new
protocols readily implementable with the currently available quantum technology
in the lab
Secure two-party quantum evaluation of unitaries against specious adversaries
We describe how any two-party quantum computation, specified by a unitary
which simultaneously acts on the registers of both parties, can be privately
implemented against a quantum version of classical semi-honest adversaries that
we call specious. Our construction requires two ideal functionalities to
garantee privacy: a private SWAP between registers held by the two parties and
a classical private AND-box equivalent to oblivious transfer. If the unitary to
be evaluated is in the Clifford group then only one call to SWAP is required
for privacy. On the other hand, any unitary not in the Clifford requires one
call to an AND-box per R-gate in the circuit. Since SWAP is itself in the
Clifford group, this functionality is universal for the private evaluation of
any unitary in that group. SWAP can be built from a classical bit commitment
scheme or an AND-box but an AND-box cannot be constructed from SWAP. It follows
that unitaries in the Clifford group are to some extent the easy ones. We also
show that SWAP cannot be implemented privately in the bare model
- …