Universal Security for Randomness Expansion from the Spot-Checking Protocol

@article{Miller2017UniversalSF,
  title={Universal Security for Randomness Expansion from the Spot-Checking Protocol},
  author={Carl A. Miller and Yaoyun Shi},
  journal={SIAM J. Comput.},
  year={2017},
  volume={46},
  pages={1304-1335}
}
Colbeck [Ph.D. thesis, 2006] proposed using Bell inequality violations to generate certified random numbers. While full quantum-security proofs have been given, it remains a major open problem to identify the broadest class of Bell inequalities and lowest performance requirements to achieve such security. In this paper, working within the broad class of spot-checking protocols, we prove exactly which Bell inequality violations can be used to achieve full security. Our result greatly improves… 
An adaptive framework for quantum-secure device-independent randomness expansion
A device-independent randomness expansion protocol aims to take an initial random seed and generate a longer one without relying on details of how the devices work for security. A large amount of
Simple and tight device-independent security proofs
TLDR
A flexible protocol is provided and a security proof is given that provides quantitative bounds that are asymptotically tight, even in the presence of general quantum adversaries, which is likely that these protocols can be practically implemented in the near future.
A Framework for Quantum-Secure Device-Independent Randomness Expansion
TLDR
A protocol that robustly generates up to two bits of randomness per entangled qubit pair, which is twice that established in existing analyses of the spot-checking CHSH protocol in the low noise regime.
Efficient Randomness Certification by Quantum Probability Estimation.
TLDR
This work implements quantum probability estimation for device-independent randomness generation in the CHSH Bell-test configuration, and it shows significant improvements in finite-data efficiency, particularly at small Bell violations which are typical in current photonic loophole-free Bell tests.
Randomness Expansion Secured by Quantum Contextuality
TLDR
A modified Klyachko-Can-Binicioglu-Shumovsky contextuality inequality is employed, which can ease the strict compatibility requirement on measurements for sequential measurements in contextuality tests and paves the way for the practical high-speed spot-checking quantum random number expansion and other secure information processing applications.
Experimentally generated randomness certified by the impossibility of superluminal signals
TLDR
1,024 random bits that are uniformly distributed to within 10−12 and unpredictable assuming the impossibility of superluminal communication are generated and certified using a loophole-free Bell test and a protocol is described that is optimized for devices that are characterized by a low per-trial violation of Bell inequalities.
Improved device-independent randomness expansion rates from tight bounds on the two sided randomness using CHSH tests
A device-independent randomness expansion protocol aims to take an initial random string and generate a longer one, where the security of the protocol does not rely on knowing the inner workings of
Calculation and application of various von Neumann entropies in CHSH-based device-independent randomness expansion
A device-independent randomness expansion protocol aims to take an initial random string and generate a longer one, where the security of the protocol does not rely on knowing the inner workings of
On Bit Commitment and Oblivious Transfer in Measurement-Device Independent settings
TLDR
This paper proposes for the first time protocols for Bit Commitment and Oblivious Transfer in the measurement-device independent (MDI) settings and analyzes their security, showing that there is a whole class of protocols that cannot be secure.
An Elementary Proof of Private Random Number Generation from Bell Inequalities
The field of device-independent quantum cryptography has seen enormous success in the past several years, including security proofs for key distribution and random number generation that account for
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 29 REFERENCES
Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices
TLDR
This work shows how to expand a random seed at an exponential rate without trusting the underlying quantum devices, and has the following new features: tolerating a constant level of implementation imprecision, requiring only a unit size quantum memory per device component for the honest implementation, and allowing a large natural class of constructions.
Security and Composability of Randomness Expansion from Bell Inequalities
TLDR
A meaningful lower bound on the min-entropy of the data produced by an untrusted device based on the observed nonlocal behavior of the device is obtained and confirms the essence of the (improperly formulated) claims of Pironio et al. and puts them on solid ground.
Physical Randomness Extractors: Generating Random Numbers with Minimal Assumptions
How to generate provably true randomness with minimal assumptions? This question is important not only for the efficiency and the security of information processing, but also for understanding how
Security of practical private randomness generation
Measurements on entangled quantum systems necessarily yield outcomes that are intrinsically unpredictable if they violate a Bell inequality. This property can be used to generate certified randomness
Bounding the seed length of Miller and Shi's unbounded randomness expansion protocol
Recent randomness expansion protocols have been proposed which are able to generate an unbounded amount of randomness from a finite amount of truly random initial seed. One such protocol, given by
Contextuality offers device-independent security
The discovery of quantum key distribution by Bennett and Brassard (BB84) bases on the fundamental quantum feature: incompatibility of measurements of quantum non-commuting observables. In 1991 Ekert
Certifiable quantum dice: or, true random number generation secure against quantum adversaries
TLDR
A modified protocol uses a seed of O(log3 n) uniformly random bits to generate n bits that are poly-1(n)-indistinguishable from uniform even from the point of view of a quantum adversary who may have had prior access to the devices, and may be entangled with them.
Quantum-Proof Randomness Extractors via Operator Space Theory
TLDR
It is argued that the theory of operator spaces offers a natural framework for studying to what extent extractors are secure against quantum adversaries: it is shown that very high min-entropy extractors as well as extractors with small output are always (approximately) quantum-proof.
Multi-Source Randomness Extractors Against Quantum Side Information, and their Applications
TLDR
A new model called General Entangled (GE) Adversary Model, which allows arbitrary entanglement in the side information and subsumes both the IA model and the BS model is proposed, and equivalence between strong OA-security and strong GE-security is established.
Optimal robust quantum self-testing by binary nonlocal XOR games
Self-testing a quantum device means verifying the existence of a certain quantum state as well as the effect of the associated measurements based only on the statistics of the measurement outcomes.
...
1
2
3
...