In this paper we design a protocol to extract random bits with an arbitrarily low bias from a single arbitrarily weak min-entropy block source in a device independent setting. The protocol employs Mermin devices that exhibit super-classical correlations. Number of devices used scales polynomially in the length of the block n, containing entropy of at least two bits. Our protocol is robust, it can tolerate devices that malfunction with a probability dropping polynomially in n at the cost of constant increase of the number of devices used
Randomness is a central feature of quantum mechanics and an invaluable resource for both classical a...
AbstractIn this paper we construct a strong randomness extractor with two independent ℓ-bit input di...
We present a simple, self-contained extractor construction that produces good extractors for all min...
We show how to extract random bits from two or more independent weak random sources in cases where o...
Abstract—In this paper, we consider the task of deterministically extracting randomness from sources...
In this paper, we give explicit constructions of extractors which work for a source of any min-entro...
We revisit the classical problem: given a memoryless source having a certain amount of Shannon Entro...
In this thesis we study the problem of extracting almost truly random bits from imperfect sources of...
Device-independent randomness generation and quantum key distribution protocols rely on a fundamenta...
We study the problem of extracting a prescribed number of random bits by reading the smallest possib...
We study how to extract randomness from a C-interleaved source, that is, a source comprised of C ind...
The problem of device-independent randomness amplification against no-signaling adversaries has so f...
Recently the first physically realistic protocol amplifying the randomness of Santha-Vazirani source...
A “randomness extractor” is an algorithm that given a sample from a distribution with sufficiently h...
Randomness is a fundamental concept, with implications from security of modern data systems, to fund...
Randomness is a central feature of quantum mechanics and an invaluable resource for both classical a...
AbstractIn this paper we construct a strong randomness extractor with two independent ℓ-bit input di...
We present a simple, self-contained extractor construction that produces good extractors for all min...
We show how to extract random bits from two or more independent weak random sources in cases where o...
Abstract—In this paper, we consider the task of deterministically extracting randomness from sources...
In this paper, we give explicit constructions of extractors which work for a source of any min-entro...
We revisit the classical problem: given a memoryless source having a certain amount of Shannon Entro...
In this thesis we study the problem of extracting almost truly random bits from imperfect sources of...
Device-independent randomness generation and quantum key distribution protocols rely on a fundamenta...
We study the problem of extracting a prescribed number of random bits by reading the smallest possib...
We study how to extract randomness from a C-interleaved source, that is, a source comprised of C ind...
The problem of device-independent randomness amplification against no-signaling adversaries has so f...
Recently the first physically realistic protocol amplifying the randomness of Santha-Vazirani source...
A “randomness extractor” is an algorithm that given a sample from a distribution with sufficiently h...
Randomness is a fundamental concept, with implications from security of modern data systems, to fund...
Randomness is a central feature of quantum mechanics and an invaluable resource for both classical a...
AbstractIn this paper we construct a strong randomness extractor with two independent ℓ-bit input di...
We present a simple, self-contained extractor construction that produces good extractors for all min...