Trevisan's Extractor in the Presence of Quantum Side Information
Name
De-2012-TREVISAN'S EXTRACTOR IN THE PRESENCE.pdf
Size
349.57 KB
Format
Adobe PDF
Checksum (MD5)
a9106028e4cdf6943203eaf79545f727
Author(s)
De, Anindya
Portmann, Christopher
Vidick, Thomas
Renner, Renato
Date Issued
August 2012
Journal
SIAM Journal on Computing
Publisher
Society for Industrial and Applied Mathematics
Citation
De, Anindya et al. “Trevisan’s Extractor in the Presence of Quantum Side Information.” SIAM Journal on Computing 41.4 (2012): 915–940. © 2012, Society for Industrial and Applied Mathematics
Version
Final published version
Abstract
Randomness extraction involves the processing of purely classical information and is therefore usually studied with in the framework of classical probability theory. However, such a classical treatment is generally too restrictive for applications where side information about the values taken by classical random variables may be represented by the state of a quantum system. This is particularly relevant in the context of cryptography, where an adversary may make use of quantum devices. Here, we show that the well-known construction paradigm for extractors proposed by Trevisan is sound in the presence of quantum side information. We exploit the modularity of this paradigm to give several concrete extractor constructions, which, e.g., extract all the conditional (smooth) min-entropy of the source using a seed of length polylogarithmic in the input, or only require the seed to be weakly random.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1137/100813683
