Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

How to Extract Useful Randomness from Unreliable Sources.

Divesh Aggarwal, Maciej Obremski, João Ribeiro, Luisa Siniscalchi, Ivan Visconti

Published Jan 1, 2019• 0 citations
OpenAlex

Abstract

For more than 30 years, cryptographers have been looking for public sources of uniform randomness in order to use them as a set-up to run appealing cryptographic protocols without relying on trusted third parties. Unfortunately, nowadays it is fair to assess that assuming the existence of physical phenomena producing public uniform randomness is far from reality.

Related papers

Public-Randomness in Public-Key Cryptography

Alfredo De Santis, Giuseppe Persiano

Lecture notes in computer science•Jan 1, 1991•16 citations

A Simple Five-Bit Quantum Random Digit Generator

Eric Thompson

Quantum random number generators provide physical randomness by converting intrinsically probabilistic measurement outcomes into usable digital values. This white paper presents a simple five-bit protocol for generating uniformly distributed decimal digits from an ideal 50/50 quantum source. Five independent binary outcomes produce 2⁵ = 32 possible sequences. By rejecting the two extreme runs, 00000 and 11111, exactly 30 admissible sequences remain, allowing a direct uniform mapping onto the ten decimal digits.The main contribution of this note is not entropy-optimal extraction, but transparency: the protocol is easy to inspect, easy to implement, and easy to explain to nontechnical users. This makes it especially relevant for trust-critical public-facing applications where visible fairness may matter more than maximum entropy efficiency. A small efficiency improvement is also introduced. Instead of discarding a rejected extreme run entirely, the rejected all-A or all-B sequence is recycled as a single fair starting bit for the next five-bit candidate block. Under the assumption of independent fair input bits, this carry-forward rule preserves exact decimal uniformity while improving the expected raw-bit cost from 16/3 ≈ 5.333 bits per digit to 79/15 ≈ 5.267 bits per digit.The paper also discusses practical implementation using a beam-splitter-style quantum randomness source, limitations under detector imbalance, and the proper cryptographic positioning of the method. The protocol can serve as a transparent entropy source or educational QRNG digitization scheme, but cryptographic deployment would still require standard health testing, calibration, and extraction.

•May 7, 2026•0 citations

Cryptographic Constructions of Randomness Resources

Grégory Demay

•Jan 1, 2016•0 citations

A Hybrid Cryptosystem-Based Non-Repudiation Protocol and Its Formal Analysis

Li Yan

A non-repudiation cryptographic protocol based on hybrid cryptosystem is proposed and it is a more perfect protocol.It can realize the true fairness and non-repudiation of both parties even the channels are unreliable and insecure.Usually the protocol only needs three interactions of participants and the transferring data keep confidential for others except for the sender and the receiver,whose transactions are protected.The Trusted Third Party(TTP) performs evidences verification,generation and publication and its bottleneck problem is solved completely.Finally,we give its formal analysis and prove the protocol's fairness,correctness and security.

Journal of the Graduate School of the Chinese Academy of Sciences•Jan 1, 2004•0 citations

On the Impossibility of Cryptography with Tamperable Randomness

Per Austrin, Kai-Min Chung, Mohammad Mahmoody +2 more

Lecture notes in computer science•Jan 1, 2014•28 citations

Efficient and practical fair exchange protocols with off-line TTP

Feng Bao, Robert Huijie Deng, Wenbo Mao

We present protocols for fair exchange of electronic data (digital signatures, payment and confidential data) between two parties A and B. Novel properties of the proposed protocols include: 1) offline trusted third party (TTP), i.e., TTP does not take part in the exchange unless one of the parties behaves improperly; 2) only three message exchanges are required in the normal situation; 3) true fair exchange, i.e., either A and B obtain each other's data or no party receives anything useful; no loss can be incurred to a party no matter how maliciously the other party behaves during the exchange. This last property is in contrast to previously proposed protocols with offline TTP ([1] and [21]), where a misbehaving party may get another party's data while refusing to send his document to the other party, and the TTP can provide affidavits attesting to what happened during the exchange. To our knowledge, the protocols presented here are the first exchange protocols which use offline TTP and at the same time guarantee true fair exchange of digital messages. We introduce a novel cryptographic primitive, called the Certificate of Encrypted Message Being a Signature (CEMBS), as the basic building block of the fair exchange protocols. It is used to prove that an encrypted message is a certain party's signature on a public file, without revealing the signature. We also give two examples to show in detail how the certificate can be constructed.

IEEE Symposium on Security and Privacy (S&P)•Nov 27, 2002•291 citations
For more than 30 years, cryptographers have been looking for public sources of uniform randomness in order to use them as a set-up to run appealing cryptographic protocols without relying on trusted third parties. Unfortunately, nowadays it is fair to assess that assuming the existence of physical phenomena producing public uniform randomness is far from reality.
Quantum random number generators provide physical randomness by converting intrinsically probabilistic measurement outcomes into usable digital values. This white paper presents a simple five-bit protocol for generating uniformly distributed decimal digits from an ideal 50/50 quantum source. Five independent binary outcomes produce 2⁵ = 32 possible sequences. By rejecting the two extreme runs, 00000 and 11111, exactly 30 admissible sequences remain, allowing a direct uniform mapping onto the ten decimal digits.The main contribution of this note is not entropy-optimal extraction, but transparency: the protocol is easy to inspect, easy to implement, and easy to explain to nontechnical users. This makes it especially relevant for trust-critical public-facing applications where visible fairness may matter more than maximum entropy efficiency. A small efficiency improvement is also introduced. Instead of discarding a rejected extreme run entirely, the rejected all-A or all-B sequence is recycled as a single fair starting bit for the next five-bit candidate block. Under the assumption of independent fair input bits, this carry-forward rule preserves exact decimal uniformity while improving the expected raw-bit cost from 16/3 ≈ 5.333 bits per digit to 79/15 ≈ 5.267 bits per digit.The paper also discusses practical implementation using a beam-splitter-style quantum randomness source, limitations under detector imbalance, and the proper cryptographic positioning of the method. The protocol can serve as a transparent entropy source or educational QRNG digitization scheme, but cryptographic deployment would still require standard health testing, calibration, and extraction.
A non-repudiation cryptographic protocol based on hybrid cryptosystem is proposed and it is a more perfect protocol.It can realize the true fairness and non-repudiation of both parties even the channels are unreliable and insecure.Usually the protocol only needs three interactions of participants and the transferring data keep confidential for others except for the sender and the receiver,whose transactions are protected.The Trusted Third Party(TTP) performs evidences verification,generation and publication and its bottleneck problem is solved completely.Finally,we give its formal analysis and prove the protocol's fairness,correctness and security.
We present protocols for fair exchange of electronic data (digital signatures, payment and confidential data) between two parties A and B. Novel properties of the proposed protocols include: 1) offline trusted third party (TTP), i.e., TTP does not take part in the exchange unless one of the parties behaves improperly; 2) only three message exchanges are required in the normal situation; 3) true fair exchange, i.e., either A and B obtain each other's data or no party receives anything useful; no loss can be incurred to a party no matter how maliciously the other party behaves during the exchange. This last property is in contrast to previously proposed protocols with offline TTP ([1] and [21]), where a misbehaving party may get another party's data while refusing to send his document to the other party, and the TTP can provide affidavits attesting to what happened during the exchange. To our knowledge, the protocols presented here are the first exchange protocols which use offline TTP and at the same time guarantee true fair exchange of digital messages. We introduce a novel cryptographic primitive, called the Certificate of Encrypted Message Being a Signature (CEMBS), as the basic building block of the fair exchange protocols. It is used to prove that an encrypted message is a certain party's signature on a public file, without revealing the signature. We also give two examples to show in detail how the certificate can be constructed.