Trevisan's Extractor in the Presence of Quantum Side Information

DOI10.1137/100813683zbMath1279.68275OpenAlexW1508777461WikidataQ59792784 ScholiaQ59792784MaRDI QIDQ3143297

Thomas Vidick, Renato Renner, Christopher Portmann, Anindya De

Publication date: 29 November 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/77888

zbMATH Keywords

quantum cryptographyquantum informationrandomness extractorssmooth min-entropy

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (9)

A modular framework for quantum-proof randomness extractors ⋮ Trading locality for time: certifiable randomness from low-depth circuits ⋮ Universal Security for Randomness Expansion from the Spot-Checking Protocol ⋮ Simple and Tight Device-Independent Security Proofs ⋮ Secure Random Number Generation in Continuous Variable Systems ⋮ THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT ⋮ Better short-seed quantum-proof extractors ⋮ Randomness in post-selected events ⋮ Estimating security of the quantum key distribution from the guesswork

This page was built for publication: Trevisan's Extractor in the Presence of Quantum Side Information