Asset Details
Do you wish to reserve the book?
Short Seed Extractors against Quantum Storage
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Short Seed Extractors against Quantum Storage
Do you wish to request the book?
Short Seed Extractors against Quantum Storage
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Short Seed Extractors against Quantum Storage
2011
Overview
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 pseudo-random generator, together with locally list-decodable codes and previous work done on quantum random access codes. [PUBLICATION ABSTRACT]
Publisher
Society for Industrial and Applied Mathematics
