Short seed extractors against quantum storage
Amnon Ta-Shma
TL;DR
This paper demonstrates that Trevisan's extractor can resist adversaries with limited quantum storage, providing a new construction with logarithmic seed length that enhances security in quantum settings.
Contribution
It proves that Trevisan's extractor is secure against quantum storage adversaries, introducing a construction with logarithmic seed length.
Findings
Trevisan's extractor resists quantum storage adversaries.
Achieves logarithmic seed length in quantum-resistant extractors.
Advances security guarantees in quantum information theory.
Abstract
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 against quantum storage with logarithmic seed length.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Cryptography and Data Security