Certification of randomness without seed randomness
- URL: http://arxiv.org/abs/2307.11492v1
- Date: Fri, 21 Jul 2023 10:52:44 GMT
- Title: Certification of randomness without seed randomness
- Authors: Shubhayan Sarkar
- Abstract summary: Device-independently certified random number generators provide maximum security.
We propose a one-sided device-independent scheme to certify two bits of randomness without the initial seed randomness.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The security of any cryptographic scheme relies on access to random number
generators. Device-independently certified random number generators provide
maximum security as one can discard the presence of an intruder by considering
only the statistics generated by these devices. Any of the known
device-independent schemes to certify randomness require an initial feed of
randomness into the devices, which can be called seed randomness. In this work,
we propose a one-sided device-independent scheme to certify two bits of
randomness without the initial seed randomness. For our purpose, we utilise the
framework of quantum networks with no inputs and two independent sources shared
among two parties with one of them being trusted. Along with it, we also
certify the maximally entangled state and the Bell basis measurement with the
untrusted party which is then used to certify the randomness generated from the
untrusted device.
Related papers
- Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement [45.386403865847235]
Physical Unclonable Functions (PUFs) leverage inherent, non-clonable physical randomness to generate unique input-output pairs.
Quantum PUFs (QPUFs) extend this concept by using quantum states as input-output pairs.
We show that no random unitary QPUF can achieve existential unforgeability against Quantum Polynomial Time adversaries.
We introduce a second model where the QPUF functions as a nonunitary quantum channel, which also guarantees existential unforgeability.
arXiv Detail & Related papers (2024-04-17T12:16:41Z) - Pseudorandom unitaries with non-adaptive security [43.15464425520681]
We present a PRU construction that is a concatenation of a random Clifford unitary, a pseudorandom binary phase operator, and a pseudorandom permutation operator.
We prove that this PRU construction is secure against non-adaptive distinguishers assuming the existence of quantum-secure one-way functions.
arXiv Detail & Related papers (2024-02-22T18:56:37Z) - Randomness Certification from Multipartite Quantum Steering for
Arbitrary Dimensional Systems [18.328936600754016]
We show that the distributed structure of several parties leads to additional protection against possible attacks by an eavesdropper.
We prove that the necessary and sufficient resource for quantum randomness in this scenario is multipartite quantum steering.
arXiv Detail & Related papers (2023-07-05T06:58:41Z) - Certification of unbounded randomness without nonlocality [0.0]
We provide a scheme to certify unbounded randomness in a semi-device-independent way based on the maximal violation of Leggett-Garg inequalities.
The scheme is independent of the choice of the quantum state, and consequently even "quantum" noise could be utilized to self-test quantum measurements.
arXiv Detail & Related papers (2023-07-03T20:11:08Z) - A privacy-preserving publicly verifiable quantum random number generator [48.7576911714538]
We report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits.
limitations on computing power can restrict an end-user's ability to perform such verification.
arXiv Detail & Related papers (2023-05-18T12:13:48Z) - Testing randomness of series generated in Bell's experiment [62.997667081978825]
We use a toy fiber optic based setup to generate binary series, and evaluate their level of randomness according to Ville principle.
Series are tested with a battery of standard statistical indicators, Hurst, Kolmogorov complexity, minimum entropy, Takensarity dimension of embedding, and Augmented Dickey Fuller and Kwiatkowski Phillips Schmidt Shin to check station exponent.
The level of randomness of series obtained by applying Toeplitz extractor to rejected series is found to be indistinguishable from the level of non-rejected raw ones.
arXiv Detail & Related papers (2022-08-31T17:39:29Z) - Certified Random Number Generation from Quantum Steering [1.0820909926464386]
Certified randomness protocols have been developed which remove the need for trust in devices by taking advantage of nonlocality.
Here, we use a photonic platform to implement our protocol, which operates in the quantum steering scenario.
We demonstrate an approach for a steering-based generator of public or private randomness, and the first generation of certified random bits, with the detection loophole closed.
arXiv Detail & Related papers (2021-11-18T03:49:43Z) - Improved, Deterministic Smoothing for L1 Certified Robustness [119.86676998327864]
We propose a non-additive and deterministic smoothing method, Deterministic Smoothing with Splitting Noise (DSSN)
In contrast to uniform additive smoothing, the SSN certification does not require the random noise components used to be independent.
This is the first work to provide deterministic "randomized smoothing" for a norm-based adversarial threat model.
arXiv Detail & Related papers (2021-03-17T21:49:53Z) - Certified Randomness From Steering Using Sequential Measurements [0.0]
A single entangled two-qubit pure state can be used to produce arbitrary amounts of certified randomness.
Motivated by these difficulties in the device-independent setting, we consider the scenario of one-sided device independence.
We show how certain aspects of previous work can be adapted to this scenario and provide theoretical bounds on the amount of randomness which can be certified.
arXiv Detail & Related papers (2020-08-03T08:18:29Z) - Robustness Guarantees for Mode Estimation with an Application to Bandits [131.21717367564963]
We introduce a theory for multi-armed bandits where the values are the modes of the reward distributions instead of the mean.
We show in simulations that our algorithms are robust to perturbation of the arms by adversarial noise sequences.
arXiv Detail & Related papers (2020-03-05T21:29:27Z) - Semi-Device-Independent Random Number Generation with Flexible
Assumptions [0.0]
We propose a new framework for semi-device-independent randomness certification using a source of trusted vacuum in the form of a signal shutter.
We experimentally demonstrate our protocol with a photonic setup and generate secure random bits under three different assumptions with varying degrees of security and resulting data rates.
arXiv Detail & Related papers (2020-02-27T18:05:17Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.