Sciweavers

19 search results - page 1 / 4
» Two-Source Extractors Secure against Quantum Adversaries
Sort
View
APPROX
2010
Springer
139views Algorithms» more  APPROX 2010»
13 years 6 months ago
Two-Source Extractors Secure against Quantum Adversaries
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
Roy Kasher, Julia Kempe
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 5 months ago
Short seed extractors against quantum storage
Some, but not all, extractors resist adversaries with limited quantum storage. In this paper we show that Trevisan's extractor has this property, thereby showing an extractor...
Amnon Ta-Shma
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
14 years 1 months ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick
TCS
2012
12 years 1 days ago
Better short-seed quantum-proof extractors
We construct a strong extractor against quantum storage that works for every min-entropy k, has logarithmic seed length, and outputs Ω(k) bits, provided that the quantum adversa...
Avraham Ben-Aroya, Amnon Ta-Shma
TIT
2008
111views more  TIT 2008»
13 years 4 months ago
The Bounded-Storage Model in the Presence of a Quantum Adversary
An extractor is a function that is used to extract randomness. Given an imperfect random source X and a uniform seed Y , the output (X; Y ) is close to uniform. We study properties...
Robert T. König, Barbara M. Terhal