Trevisan's Extractor in the Presence of Quantum Side Information

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 cla...

Full description

Bibliographic Details
Main Authors: De, Anindya (Author), Portmann, Christopher (Author), Vidick, Thomas (Contributor), Renner, Renato (Author)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor)
Format: Article
Language:English
Published: Society for Industrial and Applied Mathematics, 2013-03-13T18:34:49Z.
Subjects:
Online Access:Get fulltext
LEADER 01702 am a22002173u 4500
001 77888
042 |a dc 
100 1 0 |a De, Anindya  |e author 
100 1 0 |a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory  |e contributor 
100 1 0 |a Vidick, Thomas  |e contributor 
700 1 0 |a Portmann, Christopher  |e author 
700 1 0 |a Vidick, Thomas  |e author 
700 1 0 |a Renner, Renato  |e author 
245 0 0 |a Trevisan's Extractor in the Presence of Quantum Side Information 
260 |b Society for Industrial and Applied Mathematics,   |c 2013-03-13T18:34:49Z. 
856 |z Get fulltext  |u http://hdl.handle.net/1721.1/77888 
520 |a 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. 
520 |a National Science Foundation (U.S.) (Grant 0844626.) 
546 |a en_US 
655 7 |a Article 
773 |t SIAM Journal on Computing