Quantum-Proof Randomness Extractors via Operator Space Theory
نویسندگان
چکیده
منابع مشابه
Quantum-Proof Multi-Source Randomness Extractors in the Markov Model
Randomness extractors, widely used in classical and quantum cryptography and other fields of computer science, e.g., derandomization, are functions which generate almost uniform randomness from weak sources of randomness. In the quantum setting one must take into account the quantum side information held by an adversary which might be used to break the security of the extractor. In the case of ...
متن کامل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 adversary has at most βk qubits of memory, for any β < 1 2 . The construction works by first condensing the source (with minimal entropy-loss) and then applying an extractor that works well against quantum adversaries when the ...
متن کاملLecture 17: Randomness Extractors
This lecture is about randomness extractors. Extractors are functions that map samples from a non-uniform distribution to samples that are close to being uniformly distributed. The length of the output will in general be smaller than the length of the input of the extractor. The input distribution of the extractor is called the source. A source is a random variable which maps text values to bit...
متن کاملRandomness Extractors – An Exposition
Randomness is crucial to computer science, both in theory and applications. In complexity theory, randomness augments computers to offer more powerful models. In cryptography, randomness is essential for seed generation, where the computational model used is generally probabilistic. However, ideal randomness, which is usually assumed to be available in computer science theory and applications, ...
متن کاملSecurity Against Related Randomness Attacks via Reconstructive Extractors
This paper revisits related randomness attacks against public key encryption schemes as introduced by Paterson, Schuldt and Sibborn (PKC 2014). We present a general transform achieving security for public key encryption in the related randomness setting using as input any secure public key encryption scheme in combination with an auxiliaryinput reconstructive extractor. Specifically, we achieve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2627531