Related Experiment Video
Updated: Jun 26, 2025

09:23
Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators
Published on: May 30, 2014
14.5K
A privacy-preserving publicly verifiable quantum random number generator.
Tanvirul Islam1, Anindya Banerji2, Chin Jia Boon2
1Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore, 117543, Singapore. cqtmti@nus.edu.sg.
Scientific Reports
|May 17, 2024
Summary
Verifying random number generators requires extensive computation. An entanglement-based protocol enables public statistical testing without revealing the random bits, overcoming current limitations.
Area of Science:
- Quantum Information Science
- Cryptography
- Statistical Computing
Background:
- Verifying random number generator (RNG) quality necessitates computationally intensive statistical tests on large datasets (gigabytes).
- End-users face limitations in performing these verifications due to restricted computing power.
- Secure applications require public demonstration of RNG quality without compromising the privacy of the generated random bits.
Purpose of the Study:
- To implement an entanglement-based protocol for verifying RNG quality.
- To enable a third party to conduct public statistical tests on random bits.
- To ensure the privacy of random bits during public verification.
Main Methods:
- Utilized an entanglement-based quantum protocol.
- Developed a method for third-party verification of random bits.
- Focused on privacy-preserving statistical testing.
Main Results:
- Successfully implemented a protocol for public statistical verification of random bits.
- Demonstrated that the protocol allows testing without compromising random bit privacy.
- Overcame computational limitations for end-user verification.
Conclusions:
- The implemented entanglement-based protocol offers a novel solution for secure and private verification of random number generators.
- This approach enhances the trustworthiness of random bits in sensitive applications.
- It democratizes RNG quality assurance by removing computational barriers for end-users.
Related Concept Videos
Propagation of Uncertainty from Random Error
681
An experiment often consists of more than a single step. In this case, measurements at each step give rise to uncertainty. Because the measurements occur in successive steps, the uncertainty in one step necessarily contributes to that in the subsequent step. As we perform statistical analysis on these types of experiments, we must learn to account for the propagation of uncertainty from one step to the next. The propagation of uncertainty depends on the type of arithmetic operation performed on...
681
Random Sampling Method
11.0K
Sampling is a technique to select a portion (or subset) of the larger population and study that portion (the sample) to gain information about the population. Data are the result of sampling from a population. The sampling method ensures that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest. Among the various sampling methods used by...
11.0K
Randomized Experiments
6.9K
The randomization process involves assigning study participants randomly to experimental or control groups based on their probability of being equally assigned. Randomization is meant to eliminate selection bias and balance known and unknown confounding factors so that the control group is similar to the treatment group as much as possible. A computer program and a random number generator can be used to assign participants to groups in a way that minimizes bias.
Simple randomization
Simple...
Simple randomization
Simple...
6.9K
Random Variables
11.6K
A random variable is a single numerical value that indicates the outcome of a procedure. The concept of random variables is fundamental to the probability theory and was introduced by a Russian mathematician, Pafnuty Chebyshev, in the mid-nineteenth century.
Uppercase letters such as X or Y denote a random variable. Lowercase letters like x or y denote the value of a random variable. If X is a random variable, then X is written in words, and x is given as a number.
For example, let X = the...
Uppercase letters such as X or Y denote a random variable. Lowercase letters like x or y denote the value of a random variable. If X is a random variable, then X is written in words, and x is given as a number.
For example, let X = the...
11.6K
Wald-Wolfowitz Runs Test II
227
The Wald-Wolfowitz runs test, commonly referred to as the runs test, is a nonparametric test used to assess the randomness of ordered data. The test evaluates the number of runs, which are consecutive sequences of similar elements within the data. If the number of runs is significantly higher or lower than expected, the data is considered non-random, indicating a detectable pattern or structure.
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and...
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and...
227
Norton's Theorem
581
Norton's theorem is a fundamental principle stating that a linear two-terminal circuit can be substituted with an equivalent circuit, which comprises a current source (ⅠN) in parallel with a resistor (RN). Here, ⅠN represents the short-circuit current flowing through the terminals, and RN stands for the input or equivalent resistance at the terminals when all independent sources are deactivated. This implies that the circuit illustrated in Figure (a) can be exchanged with the...
581

