Private Weakly-Random Sequences from Human Heart Rate for Quantum Amplification

@article{Stankiewicz2021PrivateWS,
  title={Private Weakly-Random Sequences from Human Heart Rate for Quantum Amplification},
  author={Maciej Stankiewicz and Karol Horodecki and Omer Sakarya and Danuta Makowiec},
  journal={Entropy},
  year={2021},
  volume={23}
}
We investigate whether the heart rate can be treated as a semi-random source with the aim of amplification by quantum devices. We use a semi-random source model called ε-Santha–Vazirani source, which can be amplified via quantum protocols to obtain a fully private random sequence. We analyze time intervals between consecutive heartbeats obtained from Holter electrocardiogram (ECG) recordings of people of different sex and age. We propose several transformations of the original time series into… Expand

Figures and Tables from this paper

References

SHOWING 1-10 OF 46 REFERENCES
Heartbeats Do Not Make Good Pseudo-Random Number Generators: An Analysis of the Randomness of Inter-Pulse Intervals
TLDR
Questions are raised about the use of IPI values as a good source of randomness for cryptographic purposes, both in the security of some of the protocols proposed up to now and also in the design of future IPI-based schemes. Expand
On Using a Von Neumann Extractor in Heart-Beat-Based Security
TLDR
It is shown that the von Neumann key-generator produces significantly more random bits than a non-extracting key generator with an average bit-extraction rate between 13.4% and 21.9%, and also finds a substantial increase in inter-key disparity, increasing the mismatch tolerance required for a given true-key pair. Expand
Amplifying the Randomness of Weak Sources Correlated With Devices
TLDR
This paper reconsiders the original protocol of Colbeck and Renner using a Santha-Vazirani (SV) source, and introduces an SV-like condition for devices, namely that any string of SV source bits remains weakly random conditioned upon any other bit string from the same SV source and the outputs obtained when this further string is input into the devices. Expand
Quantum-proof multi-source randomness extractors in the Markov model
TLDR
It is proved that any multi-source extractor remains secure in the presence of quantum side information of this type (albeit with weaker parameters), which improves on previous results in which more restricted models were considered and the security of only some types of extractors was shown. Expand
Device-Independent Randomness Amplification and Privatization
TLDR
This work is the first to achieve randomness amplification with all the following properties: amplification and “privatization” of a public Santha-Vazirani source with arbitrary bias, the use of a device with only two components, non-vanishing extraction rate and maximal noise tolerance. Expand
Randomness Amplification under Minimal Fundamental Assumptions on the Devices.
TLDR
A device-independent protocol for randomness amplification of Santha-Vazirani sources using a device consisting of two nonsignaling components is presented and it is shown that the protocol can amplify any such source that is not fully deterministic into a fully random source while tolerating a constant noise rate. Expand
Realistic noise-tolerant randomness amplification using finite number of devices
TLDR
This work provides an error-tolerant protocol using a finite number of devices for amplifying arbitrary weak randomness into nearly perfect random bits, which are secure against a no-signalling adversary. Expand
Advanced Statistical Testing of Quantum Random Number Generators
TLDR
A fairly simple method is presented that successfully generates non-deterministic maximally random sequences based on measurements of quantum states. Expand
Free randomness amplification using bipartite chain correlations
A direct analysis of the task of randomness amplification from Santha-Vazirani sources using the violation of the chained Bell inequality is performed in terms of the convex combination ofExpand
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 howExpand
...
1
2
3
4
5
...