Insecurity of quantum secure computations
By: Hoi-Kwong Lo.
Contributors: Hewlett-Packard Laboratories.
Series: [Technical report] / HP Laboratories Bristol. Basic Research Institute in the Mathematical Sciences -- HPL-BRIMS-96-26.; BRIMS technical report -- HPL-BRIMS-96-26.
Publisher: Hewlett Packard
Published: 1996
Place of publication: Bristol [England]
Language: eng
Number of pages: 25
Subjects: Quantum theory; Data encryption (Computer science); Computer security
Description: Abstract: "It had been widely claimed that quantum mechanics can protect private information during public decision for example the so-called two-party secure computation. If this were the case, quantum smart-cards 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 so-called quantum bit commitment, the security of quantum two-party computation itself remains unaddressed. Here we answer this question directly by showing that all [\it one-sided] two-party computations (which allow only one of the two parties to learn the result) are necessarily insecure. As corollaries to our results, quantum oblivious password identification and the so-called quantum one-out-of-two oblivious transfer are impossible. We also construct a class of functions that cannot be computed securely in any [\it two-sided] two-party computation. Nevertheless, quantum cryptography remains useful in key distribution and can still provide partial security in 'quantum money' proposed by Wiesner."
Notes: Cover title.

"November, 1996."

Includes bibliographical references.

Supported in part by the National Science Foundation. PHY94-07194.