# Insecurity of Quantum Secure Computations

@article{Lo1996InsecurityOQ, title={Insecurity of Quantum Secure Computations}, author={Hoi-Kwong Lo}, journal={ArXiv}, year={1996}, volume={quant-ph/9611031} }

It had been widely claimed that quantum mechanics can protect private information during public decision in, for example, the so-called two-party secure computation. If this were the case, quantum smart-cards, storing confidential information accessible only to a proper reader, could prevent fake teller machines from learning the PIN (personal identification number) from the customers' input. Although such optimism has been challenged by the recent surprising discovery of the insecurity of the…

## 347 Citations

Quantum preprocessing for information-theoretic security in two-party computation

- Computer Science, Mathematics
- 2019

It is shown how to use the generated one-time tables to achieve nontrivial informationtheoretic security in generic two-party classical or quantum computation tasks.

On the Everlasting Security of Password-Authenticated Quantum Key Exchange

- Computer Science, MathematicsArXiv
- 2019

This paper investigates the possibility of implementing this authenticated classical channel by the means of human-memorable passwords and presents a construction of a quantum PAKE scheme based on QKD, and proves its everlasting security in this simulation-based model.

Quantum preprocessing for information-theoretic security in two-party computation

- Computer Science, Mathematics
- 2019

It is shown how to use the generated one-time tables to achieve nontrivial information-theoretic security in generic two-party classical or quantum computation tasks, including (interactive) quantum homomorphic encryption.

Quantum preprocessing for information-theoretic security in two-party computation

- Computer Science, Mathematics
- 2019

It is shown how to use the generated one-time tables to achieve nontrivial information-theoretic security in generic two-party classical or quantum computation tasks, including (interactive) quantum homomorphic encryption.

Quantum preprocessing for information-theoretic security in two-party computation

- Computer Science, Mathematics
- 2019

It is shown how to use the generated one-time tables to achieve nontrivial information-theoretic security in generic two-party classical or quantum computation tasks, including (interactive) quantum homomorphic encryption.

Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries

- MathematicsCRYPTO
- 2010

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…

Imperfect Oblivious Transfer Extended Abstract

- Computer Science, Mathematics
- 2016

This paper addresses the theoretical question “How close to ideal can unconditionally secure OT protocols be?” and lists the optimal security parameters achievable for some important two-party computations.

An Attack on Zawadzki’s Quantum Authentication Scheme

- Computer Science, MathematicsEntropy
- 2021

An attack on Zawadzki’s protocol is presented and it is formally proved that the protocol must necessarily be insecure, through the use of the principal of conclusive exclusion on quantum measurements.

Secure identification and QKD in the bounded-quantum-storage model

- Computer Science, MathematicsTheor. Comput. Sci.
- 2007

On the Security of Password-Authenticated Quantum Key Exchange

- Computer Science, Mathematics
- 2019

This paper investigates the achievability of unconditionally secure password-authenticated quantum key exchange (quantum PAKE), where the authentication is implemented by the means of human-memorable passwords, and presents a construction for quantum PAKE that provably achieves everlasting security in the simulation-based model.

## References

SHOWING 1-10 OF 45 REFERENCES

Practical Quantum Oblivious Transfer

- Computer Science, MathematicsCRYPTO
- 1991

We describe a protocol for quantum oblivious transfer, utilizing faint pulses of polarized light, by which one of two mutually distrustful parties ("Alice") transmits two one-bit messages in such a…

Is Quantum Bit Commitment Really Possible?

- Computer ScienceArXiv
- 1996

At the heart of such optimism has been the widespread belief that unconditionally secure quantum bit commitment (QBC) schemes exist, which is put into very serious doubt by showing.

Unconditionally secure quantum bit commitment is impossible

- Computer Science, Mathematics
- 1997

It is shown that the claim that quantum cryptography can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction on the time, space, or technology available to the cheaters, does not hold for any quantum bit commitment protocol.

A simple quantum oblivious transfer protocol

- Computer Science
- 1995

A simple and efficient protocol for quantum oblivious transfer is proposed. The protocol can easily be implemented with present technology and is secure against cheaters with unlimited computing…

Short Distance Applications of Quantum Cryptography

- Computer Science, Physics
- 1996

An identification protocol based on quantum mechanics that ensures that somebody impersonating Bob, who only pretended to know Alice’s password, shall not be able to obtain information on the password from the exchange.

The Trouble with Quantum Bit Commitment

- Computer Science
- 1996

Here is the first complete proof that the BCJL protocol is insecure, and the required attack and proof are more subtle.

Algorithms for quantum computation: discrete logarithms and factoring

- Computer ScienceProceedings 35th Annual Symposium on Foundations of Computer Science
- 1994

Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.

Quantum cryptography using any two nonorthogonal states.

- PhysicsPhysical review letters
- 1992

It is shown that in principle any two nonorthogonal quantum states suffice, and a practical interferometric realization using low-intensity coherent light pulses is described.

25 years of quantum cryptography

- Computer ScienceSIGA
- 1996

The purpose of this column is to give an overview of the current research in quantum cryptography, to cite as much as possible all papers ever written on the subject, including unpublished manuscripts: there were 57 entries in total.