Short seed extractors against quantum storage

Amnon Ta-Shma*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


In this paper we show that a construction of Trevisan, solving the privacy amplification problem in the classical setting, also solves the problem when the adversary may keep quantum storage, thereby giving the first such construction with logarithmic seed length. The technique we use is a combination of Trevisan's approach of constructing an extractor from a black-box pseudorandom generator, together with locally list-decodable codes and previous work done on quantum random access codes.

Original languageEnglish
Pages (from-to)664-677
Number of pages14
JournalSIAM Journal on Computing
Issue number3
StatePublished - 2011


  • Extractors
  • List-decodable code
  • Quantum storage
  • Random access codes


Dive into the research topics of 'Short seed extractors against quantum storage'. Together they form a unique fingerprint.

Cite this