An experimental implementation of oblivious transfer in the noisy storage model.
Reads0
Chats0
TLDR
This work reports on the first experimental implementation of 1-2 random oblivious transfer in the noisy storage model using a modified entangled quantum key distribution (QKD) system implementing Schaffner's simple protocol.Abstract:
The oblivious transfer protocol is a cryptographic primitive used to create many different secure two-party schemes. Here, Erven et al. provide the first implementation of the oblivious transfer protocol using entangled photons, within the noisy storage model.read more
Citations
More filters
Journal ArticleDOI
Advances in quantum cryptography
Stefano Pirandola,Ulrik L. Andersen,Leonardo Banchi,Mario Berta,Darius Bunandar,Roger Colbeck,Dirk Englund,Tobias Gehring,Cosmo Lupo,Carlo Ottaviani,Jason Pereira,Mohsen Razavi,Jesni Shamsul Shaari,Marco Tomamichel,Vladyslav C. Usenko,Giuseppe Vallone,Paolo Villoresi,Petros Wallden +17 more
TL;DR: This review begins by reviewing protocols of quantum key distribution based on discrete variable systems, and considers aspects of device independence, satellite challenges, and high rate protocols based on continuous variable systems.
Journal ArticleDOI
Secure quantum key distribution with realistic devices
TL;DR: This review gives both sides of the story, with the current best theory of quantum security, and an extensive survey of what makes quantum cryptosystem safe in practice.
Journal ArticleDOI
Advances in Quantum Cryptography
Stefano Pirandola,Ulrik L. Andersen,Leonardo Banchi,Mario Berta,Darius Bunandar,Roger Colbeck,Dirk Englund,Tobias Gehring,Cosmo Lupo,Carlo Ottaviani,Jason Pereira,Mohsen Razavi,Jesni Shamsul Shaari,Marco Tomamichel,Vladyslav C. Usenko,Giuseppe Vallone,Paolo Villoresi,Petros Wallden +17 more
TL;DR: Quantum cryptography is arguably the fastest growing area in quantum information science as mentioned in this paper, and many quantum key distribution protocols have been proposed, both theoretically and experimentally, over the last few decades.
Journal ArticleDOI
Finite blocklength converse bounds for quantum channels
TL;DR: This work derives upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying framework of quantum hypothesis testing with restricted measurements.
Journal ArticleDOI
Quantum cryptography beyond quantum key distribution
TL;DR: In this paper, the authors survey the area of theoretical quantum cryptography, with an emphasis on the constructions and limitations beyond the realm of QKD, including the impossibility of quantum bit commitment, the difficulty of quantum rewinding and the definition of quantum security models for classical primitives.
References
More filters
Book
Low-Density Parity-Check Codes
TL;DR: A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.
Book ChapterDOI
Probability Inequalities for sums of Bounded Random Variables
TL;DR: In this article, upper bounds for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt are derived for certain sums of dependent random variables such as U statistics.
Journal ArticleDOI
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms on a quantum computer and gave an efficient randomized algorithm for these two problems, which takes a number of steps polynomial in the input size of the integer to be factored.
Journal ArticleDOI
Near Shannon limit performance of low density parity check codes
TL;DR: The authors report the empirical performance of Gallager's low density parity check codes on Gaussian channels, showing that performance substantially better than that of standard convolutional and concatenated codes can be achieved.
Journal ArticleDOI
Universal classes of hash functions
TL;DR: An input independent average linear time algorithm for storage and retrieval on keys that makes a random choice of hash function from a suitable class of hash functions.