The Impossibility Of Secure Two-Party Classical Computation

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

10 pages

Scientific paper

10.1103/PhysRevA.76.062308

We present attacks that show that unconditionally secure two-party classical
computation is impossible for many classes of function. Our analysis applies to
both quantum and relativistic protocols. We illustrate our results by showing
the impossibility of oblivious transfer.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The Impossibility Of Secure Two-Party Classical Computation 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 The Impossibility Of Secure Two-Party Classical Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Impossibility Of Secure Two-Party Classical Computation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-367256

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.