Physics – Quantum Physics
Scientific paper
2001-10-05
Theory of Computing Systems vol.37(1), pp.221-246, 2004.
Physics
Quantum Physics
30 pages, appeared at 19th Symposium on Theoretical Aspects of Computer Science, STACS '02, to appear in Theory of Computing S
Scientific paper
10.1007/s00224-003-1113-7
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.
No associations
LandOfFree
On quantum and approximate privacy does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On quantum and approximate privacy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On quantum and approximate privacy will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-194277