Trevisan's Extractor in the Presence of Quantum Side Information

De, Anindya; Portmann, Christopher; Vidick, Thomas; Renner, Renato

doi:10.1137/100813683

Cited by 125 publications

(200 citation statements)

References 35 publications

Supporting

Mentioning

199

Contrasting

Order By: Relevance

“…There exist other protocol families that extract the min-entropy against quantum adversaries, for example based on almost two-universal hashing [160] or Trevisan's extractors [46]. These families are considered mainly because they need a smaller seed or can be implemented more efficiently than two-universal hashing.…”

Section: Background and Further Readingmentioning

confidence: 99%

Quantum Information Processing with Finite Resources

Tomamichel¹

2016

SpringerBriefs in Mathematical Physics

288

398

View full text Add to dashboard Cite

Section: Background and Further Readingmentioning

confidence: 99%

Quantum Information Processing with Finite Resources

Tomamichel¹

2016

SpringerBriefs in Mathematical Physics

288

398

View full text Add to dashboard Cite

“…The concept of side-information-independent randomness, which includes privacy amplification and randomness extraction, is well established in both classical and quantuminformation theory [33][34][35][36]. This security aspect of randomness generation started to get considerable attention recently in the framework of QRNG [13, 20-23, 26, 27, 37].…”

Section: Entropy Quantificationmentioning

confidence: 99%

Maximization of Extractable Randomness in a Quantum Random-Number Generator

et al. 2015

View full text Add to dashboard Cite

The generation of random numbers via quantum processes is an efficient and reliable method to obtain true indeterministic random numbers that are of vital importance to cryptographic communication and large-scale computer modeling. However, in realistic scenarios, the raw output of a quantum random-number generator is inevitably tainted by classical technical noise. The integrity of the device can be compromised if this noise is tampered with, or even controlled by some malicious party. To safeguard against this, we propose and experimentally demonstrate an approach that produces side-information independent randomness that is quantified by min-entropy conditioned on this classical noise. We present a method for maximizing the conditional min-entropy of the number sequence generated from a given quantum-to-classical-noise ratio. The detected photocurrent in our experiment is shown to have a real-time random-number generation rate of 14 (Mbit/s)/MHz. The spectral response of the detection system shows the potential to deliver more than 70 Gbit/s of random numbers in our experimental setup.

show abstract

“…Needless to say, given more bits, there are more sophisticated ways of achieving secrecy, to mention only two-universal hash functions 47 …”

Section: Less Reality More Securitymentioning

confidence: 99%

The ultimate physical limits of privacy

Ekert

Renner

2014

Nature

Self Cite

128

104

View full text Add to dashboard Cite

Among those who make a living from the science of secrecy, worry and paranoia are just signs of professionalism. Can we protect our secrets against those who wield superior technological powers? Can we trust those who provide us with tools for protection? Can we even trust ourselves, our own freedom of choice? Recent developments in quantum cryptography show that some of these questions can be addressed and discussed in precise and operational terms, suggesting that privacy is indeed possible under surprisingly weak assumptions.Edgar Allan Poe, an American writer and an amateur cryptographer, once wrote "… it may be roundly asserted that human ingenuity cannot concoct a cipher which human ingenuity cannot resolve …" 1 . Is it true? Are we doomed to be deprived of our privacy, no matter how hard we try to retain it? If the history of secret communication is of any guidance here, the answer is a resounding 'yes'. There is hardly a shortage of examples illustrating how the most brilliant efforts of code-makers were matched by the ingenuity of code-breakers 2 . Even today, the best that modern cryptography can offer are security reductions, telling us, for example, that breaking RSA, one of the most widely used public key cryptographic systems, is at least as hard as factoring large integers 3 . But is factoring really hard? Not with quantum technology. Indeed, RSA, and many other public key cryptosystems, will become insecure once a quantum computer is built 4 . Admittedly, that day is probably decades away, but can anyone prove, or give any reliable assurance, that it is? Confidence in the slowness of technological progress is all that the security of our best ciphers now rests on.This said, the requirements for perfectly secure communication are well understood. When technical buzzwords are stripped away, all we need to construct a perfect cipher is shared private randomness, more precisely, a sequence of random bits known as a 'cryptographic key'. Any two parties who share the key, we call them Alice and Bob (not their real names, of course), can then use it to communicate secretly, using a simple encryption method known as the one-time pad 5 . The key is turned into a meaningful message by one party telling the other, in public, which bits of the key should be flipped. An eavesdropper, Eve, who has monitored the public communication and knows the general method of encryption but not the key will not be able to infer anything useful about the message. It is vital though that the key bits be truly random, never reused, and securely delivered to Alice and Bob, who may be miles apart. This is not easy, but it can be done, and one can only be amazed how well quantum physics lends itself to the task of key distribution.Quantum key distribution, proposed independently by Bennett and Brassard 6 and by Ekert 7 , derives its security either from the Heisenberg uncertainty principle (certain pairs of physical properties are complementary in the sense that knowing one property necessarily precludes knowledge about the othe...

show abstract

Trevisan's Extractor in the Presence of Quantum Side Information

Cited by 125 publications

References 35 publications

Quantum Information Processing with Finite Resources

Quantum Information Processing with Finite Resources

Maximization of Extractable Randomness in a Quantum Random-Number Generator

The ultimate physical limits of privacy

Contact Info

Product

Resources

About