Quantum and Approximate Privacy
Reads0
Chats0
TLDR
It is shown that the privacy loss in computing a function can be decreased exponentially by using quantum protocols, while the class of privately computable functions (i.e., those with privacy loss 0) is not enlarged by quantum protocols.Abstract:
This paper studies privacy and secure function evaluation in communication complexity. The focus is on quantum versions of the model and on
protocols with only approximate privacy against honest players. We show that the privacy loss (the minimum divulged information) in computing a
function can be decreased exponentially by using quantum protocols, while the class of privately computable functions (i.e., those with privacy
loss 0) is not enlarged by quantum protocols. Quantum communication combined with small information leakage on the other hand makes certain
functions computable (almost) privately which are not computable using either quantum communication without leakage or classical communication
with leakage. We also give an example of an exponential reduction of the communication complexity of a function by allowing a privacy loss of
o(1) instead of privacy loss 0.read more
Citations
More filters
Proceedings ArticleDOI
Interactive information complexity
TL;DR: It is shown that IC(f) is equal to the amortized (randomized) communication complexity of f, and this connection implies that a non-trivial exchange of information is required when solving problems that have non-Trivial communication complexity.
Journal ArticleDOI
Interaction in Quantum Communication
TL;DR: It is shown that for any constant k, there is a problem such that its k+1 message classical communication complexity is exponentially smaller than its k message quantum communication complexity.
Proceedings ArticleDOI
Coding for interactive computation: Progress and challenges
TL;DR: This paper highlights some recent progress and challenges in the area of interactive coding and information complexity in the United States.
Posted Content
On the Power of Two-Party Quantum Cryptography
TL;DR: It is argued that leakage is a good measure for the privacy provided to the players by a given protocol because it extends known impossibility results to all non-trivial primitives.
References
More filters
Book
Quantum Computation and Quantum Information
TL;DR: In this article, the quantum Fourier transform and its application in quantum information theory is discussed, and distance measures for quantum information are defined. And quantum error-correction and entropy and information are discussed.
Proceedings ArticleDOI
A fast quantum mechanical algorithm for database search
TL;DR: In this paper, it was shown that a quantum mechanical computer can solve integer factorization problem in a finite power of O(log n) time, where n is the number of elements in a given integer.
Journal ArticleDOI
A single quantum cannot be cloned
TL;DR: In this article, the linearity of quantum mechanics has been shown to prevent the replication of a photon of definite polarization in the presence of an excited atom, and the authors show that this conclusion holds for all quantum systems.
Proceedings ArticleDOI
How to play ANY mental game
TL;DR: This work presents a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest.
Proceedings ArticleDOI
Protocols for secure computations
TL;DR: This paper describes three ways of solving the millionaires’ problem by use of one-way functions (i.e., functions which are easy to evaluate but hard to invert) and discusses the complexity question “How many bits need to be exchanged for the computation”.