Simple Protocols for Oblivious Transfer and Secure Identification in the Noisy-Quantum-Storage Model

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

27 pages, 4 figures; v2: corrected minor mistakes, added security proof of robust protocol

Scientific paper

10.1103/PhysRevA.82.032308

We present simple protocols for oblivious transfer and password-based identification which are secure against general attacks in the noisy-quantum-storage model as defined in [KWW09]. We argue that a technical tool from [KWW09] suffices to prove security of the known protocols. Whereas the more involved protocol for oblivious transfer from [KWW09] requires less noise in storage to achieve security, our "canonical" protocols have the advantage of being simpler to implement and the security error is easier control. Therefore, our protocols yield higher OT-rates for many realistic noise parameters. Furthermore, the first proof of security of a direct protocol for password-based identification against general noisy-quantum-storage attacks is given.

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

Simple Protocols for Oblivious Transfer and Secure Identification in the Noisy-Quantum-Storage Model 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 Simple Protocols for Oblivious Transfer and Secure Identification in the Noisy-Quantum-Storage Model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple Protocols for Oblivious Transfer and Secure Identification in the Noisy-Quantum-Storage Model will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-307403

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