Robust Cryptography in the Noisy-Quantum-Storage Model

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

34 pages, 2 figures. v2: clarified novelty of results, improved security analysis using fidelity-based smooth min-entropy, v3:

Scientific paper

It was shown in [WST08] that cryptographic primitives can be implemented based on the assumption that quantum storage of qubits is noisy. In this work we analyze a protocol for the universal task of oblivious transfer that can be implemented using quantum-key-distribution (QKD) hardware in the practical setting where honest participants are unable to perform noise-free operations. We derive trade-offs between the amount of storage noise, the amount of noise in the operations performed by the honest participants and the security of oblivious transfer which are greatly improved compared to the results in [WST08]. As an example, we show that for the case of depolarizing noise in storage we can obtain secure oblivious transfer as long as the quantum bit-error rate of the channel does not exceed 11% and the noise on the channel is strictly less than the quantum storage noise. This is optimal for the protocol considered. Finally, we show that our analysis easily carries over to quantum protocols for secure identification.

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

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

Rate now

     

Profile ID: LFWR-SCP-O-686967

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