Verifiable Random Sampling

Anthony Alexiades Armenakas; Ruslan Shaydulin; Shaltiel Eloul; Soorya Rethinasamy; Yash Satsangi; Yeoh Wei Zhu

REVIEW 4 major objections 6 minor 300 references

Verifiable Random Sampling

T0 review · 4 major / 6 minor · reviewed 2026-07-30 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Verifiable random sampling produces fresh, publicly checkable samples from any target distribution using quantum circuit sampling and a timed public ledger.

desk verdict Solid packaging of RCS certified randomness into a publicly verifiable, composable sampling primitive; the security claim is real but narrower than the abstract suggests. read the letter →

arxiv 2607.26734 v1 pith:2DKPJJCJ submitted 2026-07-29 cs.CR

Yeoh Wei Zhu , Soorya Rethinasamy , Anthony Alexiades Armenakas , Yash Satsangi , Shaltiel Eloul , Ruslan Shaydulin This is my paper · ORCID

classification cs.CR

keywords verifiablerandomsamplingcircuitcertifiedrandomnessconstructivecryptographyquantum-proofextractorblockchaincross-entropybenchmarkingrejection

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Standard verifiable random functions fix a deterministic map once the public key is published, so colluding parties or grinders can precompute favorable input-output pairs. This paper defines verifiable random sampling (VRS): a multiparty protocol whose output is a fresh sample statistically close to a chosen target distribution, together with a transcript any third party can check. The concrete construction derives challenge circuits from a blockchain block hash, has a quantum provider run random circuit sampling under a block-interval deadline, and lets an honest verifier extract a near-uniform sample (then lift it to any distribution by rejection sampling with error). Security is proved in the constructive cryptography model so the protocol composes with other cryptography. The point is publicly verifiable freshness without relying on a secret key or trusting a beacon committee.

What carries the argument

The ideal resource VRS together with the real converters that attach client, provider, and verifier to a timed bulletin board, authenticated channels, and a private extractor seed. The load-bearing step is that a timely, XEB-passing response carries enough smooth min-entropy for a quantum-proof extractor to produce a near-uniform sample that third parties can re-verify from the public transcript.

What would settle it

Exhibit a classical algorithm that, within one block interval after the challenge circuits are fixed by the block hash, returns strings that pass the protocol’s XEB threshold while the smooth min-entropy of the response falls below the extractor’s requirement; the ideal-resource indistinguishability would then fail.

Watch

Extended reading notes

Core claim

The authors introduce VRS as a primitive and construct VRS from random quantum circuit sampling, a timed batched bulletin board with entropy, and a quantum-proof two-source extractor. With an honest verifier and a corrupted client and provider, the real protocol is indistinguishable from an ideal VRS resource that outputs a sample statistically close to the target distribution only when the transcript is timely, correctly derived, and passes the cross-entropy test. The same uniform sampler lifts to arbitrary distributions via a proved rejection-sampling-with-error lemma.

Load-bearing premise

Classical machines cannot usefully predict which random-circuit outputs are heavy versus light fast enough to spoof a high cross-entropy score inside the blockchain block deadline, so a passing response must still carry genuine quantum entropy.

Editorial extensions

If this is right

Smart contracts can derive near-uniform samples from on-chain transcripts without trusting a VRF key holder or a beacon committee.
e-lottery and leader-election protocols can enforce public fairness while keeping sample freshness against grinding and collusion.
Any distribution, not only uniform bits, becomes available by rejection sampling once a near-uniform VRS sample exists.
The same interface can later swap the RCS entropy source for a fault-tolerant NP-search certified-randomness protocol without redesigning the multiparty wrapping.
Composability in constructive cryptography lets VRS be plugged into larger multiparty protocols as a modular randomness resource.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

If block-interval timing is the only freshness clock, chain reorganizations or miner timestamp games become first-class attacks on the entropy bound and deserve explicit economic modeling.
Domain separation via context strings turns one public entropy drip into many independent per-application samples, which is a practical alternative to running many separate beacons.
Verification cost in GPU-hours remains the deployment bottleneck; parallelizing XEB checks or moving to preimage-sampling certified randomness would decide whether VRS is usable at high frequency.
The construction separates ‘prove quantum entropy existed’ from ‘expand to a named distribution,’ a split that could apply to other physical entropy sources once they have a public timing and scoring interface.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

The useful takeaway is definitional and architectural. They name VRS, give a CC ideal resource, and wrap existing RCS certified randomness (Aaronson–Hung, Liu et al.) with a timed bulletin board so a third party can check freshness and XEB without a private challenge or local clock. Domain separation, earliest-transcript selection, and the rejection-sampling-with-error lift to arbitrary D are the concrete engineering moves. That is genuinely new relative to VRF, beacons, and plain certified randomness, and it targets a real pain point: grinding and collusion once a VRF key is fixed.

What they do well: the threat model and use cases (smart contracts, e-lottery) are clear; the comparison table is honest; they flag that the adversary is the restricted one-shot model of [36], not the general one in [37], and leave the extension open. Correctness and the main hybrid sketch reduce cleanly to the imported smooth min-entropy bound plus a standard quantum-proof two-source extractor. The rejection-sampling-with-error lemma is a small but usable technical contribution.

Soft spots, in proportion: Theorem 9’s proof is a deferred hybrid sketch, not a full reduction that discharges every public-verifiability rule under multi-session side information. Security sits on Assumption 1 (unstructured RCS / XEB hardness) and on blockchain timing and computational entropy bounds. Those are load-bearing and external; the paper does not strengthen them. No new experiment or formal-verification artifact—feasibility rides on prior RCS demos. None of that sinks the contribution; it means the strongest claim holds inside a stated, restricted model, not for every adversary the conclusion gestures at.

Who it’s for: people building verifiable randomness for chains or composing quantum entropy sources in CC/UC-style frameworks. A serious editor should send it to referees. I’d engage—read the hybrids and the entropy import carefully—rather than dismiss or oversell it.

Referee Report

4 major / 6 minor

Summary. The paper introduces verifiable random sampling (VRS), a primitive that outputs a fresh sample statistically close to a target distribution D together with a publicly verifiable transcript, addressing collusion and grinding limitations of VRFs. It gives a concrete construction VRS^{B3^{T,E}}_U based on random circuit sampling (RCS) certified randomness, a timed batched bulletin board B3^{T,E} (instantiated by blockchain), domain separation, and a quantum-proof two-source extractor; a lift to arbitrary D uses a new rejection-sampling-with-error lemma. Security is argued in the constructive cryptography framework: correctness (Theorem 8) and the main claim that an honest verifier with corrupted client and provider obtains an ideal-resource sample (Theorem 9), with hybrids sketched in Appendix E reducing to an imported smooth min-entropy bound (Theorem 4) under Assumption 1 and block timing T ≤ τ_res.

Significance. If the security claim holds at the advertised strength, VRS would be a useful composable primitive for blockchain randomness, e-lotteries, and smart-contract sampling: it targets information-theoretic freshness and public verifiability where VRFs are deterministic and beacons lack strong consumer-side proofs. Strengths include a clean ideal-resource formulation in CC, an explicit multiparty protocol with on-chain timing and anti-post-selection checks, a nontrivial error-tolerant rejection-sampling lemma (Lemma 10), and grounding in experimentally demonstrated RCS certified-randomness work. The contribution is primarily definitional and architectural rather than a new hardness result; its lasting value depends on whether the security reduction can be completed for a realistic adversary class and whether the RCS/XEB assumptions and verification cost are acceptable in the intended deployments.

major comments (4)

[Theorem 9, Appendix E, Section 3.1] Theorem 9 / Appendix E: The central indistinguishability π_V(B3||AUT||Seed_V) ≈ VRS_U σ_{{P,E,T}} is only sketched. Hybrids H2–H3 import the smooth min-entropy bound of Theorem 4 for a classical PPT distinguisher limited to at most Q_C honest quantum-oracle queries (the one-shot model of [36]). The manuscript itself states (Section 3.1, Conclusion) that this is narrower than the general adversary of [37] and leaves the extension open. Without an explicit reduction from distinguishing advantage to a violation of Assumption 1 or of the B3 timing/entropy bounds—and without treating classical post-processing, cross-session quantum side information, or multi-client/multi-block interaction—the public-verifiability claim under fully corrupted T and P is not discharged at the strength advertised. Complete the proof or sharply restate the adversary class in the theorem statement and abstract.
[Section 3.1, Assumption 1, Theorem 4] Section 3.1, Assumption 1 and Theorem 4: The extractor step (Hybrid H3) and ideal-resource sample quality rest entirely on unstructuredness of RCS / hardness of spoofing XEB so that frugal rejection sampling is optimal, plus T ≤ τ_res. This is a strong, non-standard cryptographic assumption (related to but not identical to LLHA). The paper should state quantitative parameter regimes (n, M, χ, α, Q_min, E, BIDτ) under which κ_2 is large enough for a concrete extractor error, and clarify what breaks if the adversary has more classical simulation power than the frugal strategy or if block intervals are adversarially jittered within the consensus rules.
[Section 5.4, Section A.2, Section 2.2] Section 5.4 Figure 4 and Section A.2: Public verifiability for third-party observers and alternate corruption patterns (malicious V; all of T,P,V malicious) is handled by informal seed instantiations (future block hash, NIZK, attached seed). These are not modeled inside the ideal resource or the proven converter π_V; Theorem 9 only covers honest V with private Seed_V. Either extend the CC statement to these setups or clearly separate “core theorem” from “deployment sketches,” and specify how earliest-transcript / BIDmin / CTX checks compose when the observer is not V.
[Section 5.3, Section A.7] Section 5.3 / A.7: Security uses H^comp_min(Hash(B,aux)) ≥ E and honest mining for timestamps. Brief remarks on few-bit biasability are insufficient for a composable ideal resource: biased or withheld block entropy can correlate challenge circuits with a grinding client, and miner timestamp flexibility can stretch the effective response window beyond τ_res. The ideal B3^{T,E} should state precise failure conditions, and Theorem 9 should quantify degradation when E is reduced or T is only an honest-majority statistical bound.

minor comments (6)

[Table 1] Table 1 marks RB as not publicly verifiable and CR-RCS as not publicly verifiable; a short footnote defining the exact comparison criteria (who verifies, against what trust) would avoid ambiguity with existing beacon literature.
[Figure 1, Figure 4, Figure 6] Figure 1 and the Step 0–3 summary are helpful but the mapping from T/P/V interfaces in Figure 6 to the ideal resource commands in Figure 4 could be tabulated once for readability.
[Definition 6, Section 3] Notation: both Seed_chl / Seed_ext (Definition 6) and the ideal Seed^ℓ_I resource appear; unify naming. Also clarify whether Measure(⃗C|0^{n·M}⟩) is sequential single-circuit measurement or a joint measurement.
[Lemma 10, Section 6.1] Lemma 10: state whether M in the rejection bound is the usual envelope constant and give a short concrete example (e.g., sampling a biased bit or a small discrete D) so implementers can see 2Mε_u/(1−2Mε_u).
[Section 1.1] Related work: briefly position against other blockchain randomness designs (e.g., RANDAO + VDF, drand, threshold BLS beacons) beyond the high-level Table 1 categories.
[Section 5.5, Theorem 8] Typos / polish: “Prover P” vs “Provider P” in Section 5.5; “relabeling and inspection” in Theorem 8 proof is too thin even for correctness—cite extractor parameters explicitly; arXiv ID formatting and repeated author-affiliation blocks are fine for preprint but should be cleaned for journal submission.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: VRS security is a standard ideal/real composition around an externally cited entropy engine, not a result forced by its own inputs.

full rationale

The paper’s load-bearing chain is: (i) RCS + XEB under Assumption 1 / the min-entropy bound of Theorem 4 imported from Liu et al. [36] and complexity background from Aaronson–Hung [3]; (ii) a quantum-proof two-source extractor (Definition 5); (iii) a timed bulletin board B3^{T,E} and domain-separation/earliest-transcript rules; (iv) CC converters that construct an independently specified ideal resource VRS^{B3}_D (Figure 4), with Theorem 9 argued via hybrids that replace the extractor output by uniform and relabel interfaces. The ideal resource is not defined to equal the real protocol: honest P samples from the circuit distribution and honest V outputs u∼D only after TestXEB, timing, and uniqueness checks; corrupted interfaces allow arbitrary C′/R′/u. Lemma 10 (rejection sampling with error) is proved from first principles in Appendix D and is not a fit renamed as a prediction. Overlap of one coauthor with the cited RCS experiments [36, 37] is ordinary engineering reuse of an externally published, experimentally falsifiable entropy source; the hardness premise remains the external unstructuredness/LLHA-style assumptions, not a self-referential uniqueness theorem or a parameter fitted to the claimed output. No step reduces a claimed prediction to its defining input by construction.

Assumptions & free parameters 4 free parameters · 7 assumptions · 2 invented entities

The central security claim rests on imported hardness/entropy results for RCS, standard extractor and CC composition theorems, and several blockchain and timing modeling assumptions. No numerical parameters are fitted to new data in this text; free parameters are protocol thresholds inherited from the entropy theorem and blockchain model.

free parameters (4)

XEB threshold χ and test-set size α
Protocol accept/reject thresholds that determine Q_min and the entropy lower bound; chosen to match the imported certified-randomness analysis rather than derived here.
Block time bound T and BIDτ (with T ≤ τ_res)
Timing parameters that enforce the response deadline ruling out classical simulation; set relative to the hardware/adversary model of the cited RCS protocols.
Blockchain hash computational min-entropy lower bound E
Assumed entropy in block headers used to freshen challenge circuits; taken from prior Bitcoin-style analyses, not re-estimated.
Extractor error parameters (ε_s, ε_ext, ε_2) and output length ℓ
Statistical distance and seed-length knobs that make the extracted sample close to uniform; standard cryptographic parameters, not fitted to new experiments in this paper.

assumptions (7)

domain assumption Assumption 1: RCS output distributions are unstructured; best classical XEB optimization is frugal rejection sampling.
Stated in Section 3.1; load-bearing for the min-entropy bound used in Hybrids H2–H3 and Theorem 9.
domain assumption Entropy guarantee of Theorem 4 (from Liu et al. / related RCS certified-randomness work) under Q-query oracle access and non-abort.
Imported as the quantitative entropy engine; without it the extractor precondition fails.
standard math Existence of a quantum-proof strong two-source extractor (Definition 5 / Lemma 74 of cited work).
Standard cryptographic primitive used to turn smooth min-entropy into near-uniform bits.
domain assumption Ideal batched bulletin board B3^{T,E} with honest miner, chronological timestamps, inter-block time < T, and H_comp_min(block hash) ≥ E.
Section 5.3 modeling assumption that supplies both freshness for circuits and the public deadline.
standard math Constructive cryptography composition and distinguishing advantage definitions (Maurer–Renner).
Framework in which real≈ideal is proved; not re-derived.
domain assumption LLHA / hardness of spoofing related to LLQSV in the background complexity justification (Section C).
Used to motivate Assumption 1 and the entropy theorems; experimental path relies more on Assumption 1 than on a fully instantiated LLHA protocol.
domain assumption Seed (extractor second source) remains independent of the provider’s response until response publication.
Required by the extractor theorem; enforced by modeling Seed_V as private or as a future block hash depending on corruption pattern.

invented entities (2)

Verifiable Random Sampling (VRS) primitive and ideal resource VRS^{B3}_{T,E}_D
purpose: Name and ideal functionality for publicly verifiable sampling from a target distribution with freshness, as a replacement for deterministic VRFs in multiparty settings.
New interface (Gen/Chal/Res/Eval) and CC resource capturing honest-V / corrupt-T+P behavior; the main conceptual contribution.
Timed batched bulletin board resource B3^{T,E}
purpose: Abstract the blockchain (or similar) features needed: timed batches, public posts, and entropy-bearing auxiliary headers.
Ideal resource invented for the model; intended to be instantiated by Bitcoin/Ethereum-style ledgers under extra assumptions.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Verifiable Random Sampling." pith.science (2026). https://pith.science/paper/2DKPJJCJ

@misc{pith2026260726734,
  author       = {Pith},
  title        = {Pith review of: Verifiable Random Sampling},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2DKPJJCJ}},
  note         = {Machine review of arXiv:2607.26734}
}

read the original abstract

Verifiable random functions (VRF) underpin a wide range of applications that require publicly verifiable evaluations of a pseudorandom function on a given input. However, once the public key is published, the induced function is fixed and is a deterministic function of the input. This determinism can enable collusion and grinding-style attacks in which adversaries precompute and selectively exploit favorable input-output pairs. To address these limitations, we introduce the formal notion of verifiable random sampling (VRS). We propose a concrete VRS construction based on random quantum circuit sampling (RCS) executable on today's quantum computing devices. VRS supports multiparty protocols in which the verifier's final output is a sample that is statistically close to a specified target distribution, while remaining publicly verifiable. We model the construction and prove its security within the constructive cryptography (CC) framework, thereby ensuring composability with other cryptographic protocols. Overall, our results provide a mechanism for verifiable random sampling that simultaneously guarantees sample freshness and public verifiability, enabling applications that require unpredictable, fresh randomness while preserving fairness through public verifiability.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

300 extracted references · 18 canonical work pages

[36]

NIZKs with an untrusted CRS: security in the face of parameter subversion , author=. Advances in Cryptology--ASIACRYPT 2016: 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II 22 , pages=. 2016 , organization=

2016
[37]

Annual International Conference on the Theory and Applications of Cryptographic Techniques , pages=

Towards accountability in CRS generation , author=. Annual International Conference on the Theory and Applications of Cryptographic Techniques , pages=. 2021 , organization=

2021
[1]

Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security , pages=

Security analysis of pseudo-random number generators with input: /dev/random is not robust , author=. Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security , pages=

2013
[2]

International Conference on Financial Cryptography and Data Security , pages=

Practical post-quantum few-time verifiable random function with applications to algorand , author=. International Conference on Financial Cryptography and Data Security , pages=. 2021 , organization=

2021
[3]

Advances in Cryptology-EUROCRYPT 2006: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St

Perfect non-interactive zero knowledge for NP , author=. Advances in Cryptology-EUROCRYPT 2006: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28-June 1, 2006. Proceedings 25 , pages=. 2006 , organization=

2006
[4]

IACR Transactions on Cryptographic Hardware and Embedded Systems , pages=

Crystals-dilithium: A lattice-based digital signature scheme , author=. IACR Transactions on Cryptographic Hardware and Embedded Systems , pages=
[5]

Proceedings of the 27th annual computer security applications conference , pages=

Key escrow from a safe distance: looking back at the clipper chip , author=. Proceedings of the 27th annual computer security applications conference , pages=
[6]

Nature , volume=

Certified randomness in quantum physics , author=. Nature , volume=. 2016 , publisher=

2016

Show all 300 references

[7]

21st USENIX Security Symposium , pages=

Mining your Ps and Qs: Detection of widespread weak keys in network devices , author=. 21st USENIX Security Symposium , pages=
[8]

45th Annual IEEE Symposium on Foundations of Computer Science , pages=

On the (im) possibility of cryptography with imperfect randomness , author=. 45th Annual IEEE Symposium on Foundations of Computer Science , pages=. 2004 , organization=

2004
[9]

ACM Sigkdd Explorations Newsletter , volume=

Randomization in privacy preserving data mining , author=. ACM Sigkdd Explorations Newsletter , volume=. 2002 , publisher=

2002
[10]

Proceedings of the 11th ACM conference on Electronic commerce , pages=

The power of randomness in bayesian optimal mechanism design , author=. Proceedings of the 11th ACM conference on Electronic commerce , pages=
[11]

Annual international cryptology conference , pages=

Verifiable delay functions , author=. Annual international cryptology conference , pages=. 2018 , organization=

2018
[12]

Proceedings of the 2019 ACM SIGSAC conference on computer and communications security , pages=

The SPHINCS+ signature framework , author=. Proceedings of the 2019 ACM SIGSAC conference on computer and communications security , pages=

2019
[13]

Lecture notes-monograph series , pages=

Generalized accept-reject sampling schemes , author=. Lecture notes-monograph series , pages=. 2004 , publisher=

2004
[14]

Handbooks in operations research and management science , volume=

Nonuniform random variate generation , author=. Handbooks in operations research and management science , volume=. 2006 , publisher=

2006
[15]

2013 , publisher=

Understanding advanced statistical methods , author=. 2013 , publisher=

2013
[16]

Acta Numerica , volume=

Randomized numerical linear algebra: Foundations and algorithms , author=. Acta Numerica , volume=. 2020 , publisher=

2020
[17]

2015 , isbn =

Tomamichel, Marco , title =. 2015 , isbn =

2015
[18]

Journal of cryptology , volume=

An algebraic framework for Diffie--Hellman assumptions , author=. Journal of cryptology , volume=. 2017 , publisher=

2017
[19]

IEEE Transactions on Signal Processing , volume=

Privacy-preserving distributed machine learning via local randomization and ADMM perturbation , author=. IEEE Transactions on Signal Processing , volume=. 2020 , publisher=

2020
[20]

Designs, Codes and Cryptography , volume=

The diffie--hellman protocol , author=. Designs, Codes and Cryptography , volume=. 2000 , publisher=

2000
[21]

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) , pages=

On the cunning power of cheating verifiers: Some observations about zero knowledge proofs , author=. 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) , pages=. 1987 , organization=

1987
[22]

Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing , pages =

Ben-Or, Michael and Goldwasser, Shafi and Wigderson, Avi , title =. Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing , pages =. 1988 , isbn =

1988
[23]

Journal of Cryptology , volume=

A full proof of the BGW protocol for perfectly secure multiparty computation , author=. Journal of Cryptology , volume=. 2017 , publisher=

2017
[24]

Theory of Cryptography Conference , pages=

An optimally fair coin toss , author=. Theory of Cryptography Conference , pages=. 2009 , organization=

2009
[25]

National Institute of Standards and Technology , title =
[26]

2019 , institution=

A reference for randomness beacons: Format and protocol version 2 , author=. 2019 , institution=

2019
[27]

The New Codebreakers: Essays Dedicated to David Kahn on the Occasion of His 85th Birthday , pages=

Dual EC: A standardized back door , author=. The New Codebreakers: Essays Dedicated to David Kahn on the Occasion of His 85th Birthday , pages=. 2016 , publisher=

2016
[28]

Journal of Computer and System Sciences , volume=

Transaction protection by beacons , author=. Journal of Computer and System Sciences , volume=. 1983 , publisher=

1983
[29]

Advances in Cryptology--CRYPTO 2016: 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part I 36 , pages=

Backdoors in pseudorandom number generators: Possibility and impossibility results , author=. Advances in Cryptology--CRYPTO 2016: 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part I 36 , pages=. 2016 , organization=

2016
[30]

A formal treatment of backdoored pseudorandom generators , author=. Advances in Cryptology--EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part I 34 , pages=. 201...

2015
[31]

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security , pages=

Practical state recovery attacks against legacy RNG implementations , author=. Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security , pages=

2018
[32]

Ke Wu and Gilad Asharov and Elaine Shi , title =
[33]

1990 , publisher=

Non-interactive zero-knowledge with preprocessing , author=. 1990 , publisher=

1990
[34]

Theory of Cryptography: First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004

Secret-key zero-knowlegde and non-interactive verifiable exponentiation , author=. Theory of Cryptography: First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004. Proceedings 1 , pages=. 2004 , organization=

2004
[35]

International Conference on the Theory and Applications of Cryptographic Techniques , pages=

Efficient concurrent zero-knowledge in the auxiliary string model , author=. International Conference on the Theory and Applications of Cryptographic Techniques , pages=. 2000 , organization=

2000
[38]

Cryptology ePrint Archive , year=

NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness , author=. Cryptology ePrint Archive , year=
[39]

Journal of cryptology , volume=

Cryptography in the multi-string model , author=. Journal of cryptology , volume=. 2014 , publisher=

2014
[40]

2004 , publisher=

Foundations of Cryptography, Volume 2 , author=. 2004 , publisher=

2004
[41]

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) , pages=

Cryptography from sunspots: How to use an imperfect reference string , author=. 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) , pages=. 2007 , organization=

2007
[42]

Annual international cryptology conference , pages=

Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack , author=. Annual international cryptology conference , pages=. 1991 , organization=

1991
[43]

Proceedings 42nd IEEE Symposium on Foundations of Computer Science , pages=

Universally composable security: A new paradigm for cryptographic protocols , author=. Proceedings 42nd IEEE Symposium on Foundations of Computer Science , pages=. 2001 , organization=

2001
[44]

Journal of Cryptology , volume=

Definitions and properties of zero-knowledge proof systems , author=. Journal of Cryptology , volume=. 1994 , publisher=

1994
[45]

Journal of Computer and System Sciences , volume=

Lower bounds for non-black-box zero knowledge , author=. Journal of Computer and System Sciences , volume=. 2006 , publisher=

2006
[46]

Applied Cryptography and Network Security: Third International Conference, ACNS 2005, New York, NY, USA, June 7-10, 2005

Non-interactive zero-knowledge arguments for voting , author=. Applied Cryptography and Network Security: Third International Conference, ACNS 2005, New York, NY, USA, June 7-10, 2005. Proceedings 3 , pages=. 2005 , organization=

2005
[47]

Ad Hoc Networks , volume=

Non-interactive zero knowledge proofs for the authentication of IoT devices in reduced connectivity environments , author=. Ad Hoc Networks , volume=. 2019 , publisher=

2019
[48]

2020 IEEE International Conference on Blockchain (Blockchain) , pages=

Enabling privacy and traceability in supply chains using blockchain and zero knowledge proofs , author=. 2020 IEEE International Conference on Blockchain (Blockchain) , pages=. 2020 , organization=

2020
[49]

SN Applied Sciences , volume=

A survey on zero knowledge range proofs and applications , author=. SN Applied Sciences , volume=. 2019 , publisher=

2019
[50]

A survey of zero-knowledge proofs with applications to cryptography , author=
[51]

IEEE network , volume=

A survey on zero-knowledge proof in blockchain , author=. IEEE network , volume=. 2021 , publisher=

2021
[52]

Computers & Security , volume=

A zero-knowledge-proof-based digital identity management scheme in blockchain , author=. Computers & Security , volume=. 2020 , publisher=

2020
[53]

Providing sound foundations for cryptography: On the work of shafi goldwasser and silvio micali , pages=

The knowledge complexity of interactive proof-systems , author=. Providing sound foundations for cryptography: On the work of shafi goldwasser and silvio micali , pages=
[54]

Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali , pages=

Non-interactive zero-knowledge and its applications , author=. Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali , pages=
[55]

SIAM Journal on Computing , volume=

Noninteractive zero-knowledge , author=. SIAM Journal on Computing , volume=. 1991 , publisher=

1991
[56]

Proceedings of the 4th International Conference on Progress in Cryptology in Africa , pages =

Lunemann, Carolin and Nielsen, Jesper Buus , title =. Proceedings of the 4th International Conference on Progress in Cryptology in Africa , pages =. 2011 , isbn =

2011
[57]

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science , pages=

Multiple non-interactive zero knowledge proofs based on a single random string , author=. Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science , pages=. 1990 , organization=

1990
[58]

arXiv preprint arXiv:2308.07030 , year=

Expanding bipartite Bell inequalities for maximum multi-partite randomness , author=. arXiv preprint arXiv:2308.07030 , year=
[59]

IACR International Conference on Public-Key Cryptography , pages=

On the possibility of a backdoor in the Micali-Schnorr generator , author=. IACR International Conference on Public-Key Cryptography , pages=. 2024 , organization=

2024
[60]

Theory of Cryptography Conference , pages=

Immunizing Backdoored PRGs , author=. Theory of Cryptography Conference , pages=. 2023 , organization=

2023
[61]

Journal of Economic theory , volume=

Haggling over substitutes , author=. Journal of Economic theory , volume=. 2004 , publisher=

2004
[62]

Advances in Cryptology--CRYPTO 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part I 34 , pages=

On the impossibility of cryptography with tamperable randomness , author=. Advances in Cryptology--CRYPTO 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part I 34 , pages=. 2014 , organization=

2014
[63]

PRX Quantum , volume =

Density-Matrix Renormalization Group Algorithm for Simulating Quantum Circuits with a Finite Fidelity , author =. PRX Quantum , volume =. 2023 , month =

2023
[64]

NIST, Gaithersburg, MD, USA, Tech

Users guide to running the draft NIST SP 800-90B entropy estimation suite , author=. NIST, Gaithersburg, MD, USA, Tech. Rep. SP , year=
[65]

Preprint https://arxiv.org/abs/2005.02421 , year=

Spoofing linear cross-entropy benchmarking in shallow quantum circuits , author=. Preprint https://arxiv.org/abs/2005.02421 , year=

2005 arXiv
[66]

Communications in Mathematical Physics , volume=

Entropy accumulation , author=. Communications in Mathematical Physics , volume=. 2020 , publisher=

2020
[67]

2024 , journal=

Phase transition in Random Circuit Sampling , author=. 2024 , journal=

2024
[68]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages =

Aaronson, Scott and Hung, Shih-Han , title =. Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages =. 2023 , isbn =

2023
[69]

2023 , journal =

Scott Aaronson and Shih-Han Hung , Title =. 2023 , journal =

2023
[70]

Certified Randomness from Quantum Supremacy , author =
[71]

Hung, Shih-Han , note =
[72]

2005 , month =

Koenraad M R Audenaert and Martin B Plenio , title =. 2005 , month =

2005
[73]

Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates , author =. Phys. Rev. Lett. , volume =. 2016 , month =

2016
[74]

npj Quantum Inf , volume=

Estimating the randomness of quantum circuit ensembles up to 50 qubits , author =. npj Quantum Inf , volume=
[75]

T. A. N. Brandão, Luís and Peralta, René , year =. Notes on Interrogating Random Quantum Circuits , howpublished=
[76]

A Reference for Randomness Beacons: Format and Protocol Version 2 , year=
[77]

The New Randomness Beacon Format Standard: An Exercise in Limiting the Power of a Trusted Third Party , ISBN =

Kelsey, John , year =. The New Randomness Beacon Format Standard: An Exercise in Limiting the Power of a Trusted Third Party , ISBN =. Lecture Notes in Computer Science , publisher =
[78]

2019 , month = oct, publisher =

Frank Arute and others , title =. 2019 , month = oct, publisher =

2019
[79]

Nature , volume =

Suppressing quantum errors by scaling a surface code logical qubit , author=. Nature , volume =. 2022 , pages =

2022
[80]

Improved Decoding of Circuit Noise and Fragile Boundaries of Tailored Surface Codes , author =. Phys. Rev. X , volume =. 2023 , month =

2023
[81]

Efficient algorithms for maximum likelihood decoding in the surface code , author =. Phys. Rev. A , volume =. 2014 , month =

2014
[82]

Statistical mechanical models for quantum codes with correlated noise , author =. Ann. Inst. Henri Poincaré Comb. Phys. Interact. , volume =
[83]

Equivalence of restricted Boltzmann machines and tensor network states , author =. Phys. Rev. B , volume =. 2018 , month =

2018
[84]

Trends Mach

Found. Trends Mach. Learn. , title =. 2016 , volume =

2016
[85]

Trends Mach

Found. Trends Mach. Learn. , title =. 2017 , volume =

2017
[86]

Ding Liu and Shi-Ju Ran and Peter Wittek and Cheng Peng and Raul Blázquez García and Gang Su and Maciej Lewenstein , title =. New J. Phys. , year =
[87]

Density matrix formulation for quantum renormalization groups , author =. Phys. Rev. Lett. , volume =. 1992 , month =

1992
[88]

Entanglement in Quantum Critical Phenomena , author =. Phys. Rev. Lett. , volume =. 2003 , month =

2003
[89]

arXiv preprint cond-mat/0407066 , year=

Renormalization algorithms for quantum-many body systems in two and higher dimensions , author=. arXiv preprint cond-mat/0407066 , year=

arXiv
[90]

Infinite time-evolving block decimation algorithm beyond unitary evolution , author =. Phys. Rev. B , volume =. 2008 , month =

2008
[91]

Klümper and A

A. Klümper and A. Schadschneider and J. Zittartz , title =. 1993 , month =

1993
[92]

Efficient Simulation of One-Dimensional Quantum Many-Body Systems , author =. Phys. Rev. Lett. , volume =. 2004 , month =

2004
[93]

Classical simulation of lossy boson sampling using matrix product operators , author =. Phys. Rev. A , volume =. 2021 , month =

2021
[94]

Simulating the dynamics of single photons in boson sampling devices with matrix product states , author=. Phys. Rev. A , volume=. 2019 , publisher=

2019
[95]

Embedding Learning in Hybrid Quantum-Classical Neural Networks , year=

Liu, Minzhao and Liu, Junyu and Liu, Rui and Makhanov, Henry and Lykov, Danylo and Apte, Anuj and Alexeev, Yuri , booktitle=. Embedding Learning in Hybrid Quantum-Classical Neural Networks , year=
[96]

Simulating lossy Gaussian boson sampling with matrix-product operators , author =. Phys. Rev. A , volume =. 2023 , month =

2023
[97]

Classical algorithm for simulating experimental Gaussian boson sampling , author =. Nat. Phys. , volume =
[98]

and Shi, Yaoyun , title =

Markov, Igor L. and Shi, Yaoyun , title =. SIAM Journal on Computing , volume =
[99]

PRX Quantum , volume =

Random Quantum Circuits Anticoncentrate in Log Depth , author =. PRX Quantum , volume =. 2022 , month =

2022
[100]

Experimental certification of more than one bit of quantum randomness in the two inputs and two outputs scenario , volume =

Jean-Marie Seguinard, Alban and Piveteau, Amélie and Mironowicz, Piotr and Bourennane, Mohamed , year =. Experimental certification of more than one bit of quantum randomness in the two inputs and two outputs scenario , volume =. New Journal of Physics , publisher =
[101]

Certified randomness in quantum physics , volume =

Acín, Antonio and Masanes, Lluis , year =. Certified randomness in quantum physics , volume =. Nature , publisher =
[102]

, year =

Foreman, Cameron and Wright, Sherilyn and Edgington, Alec and Berta, Mario and Curchod, Florian J. , year =. Practical randomness amplification and privatisation with implementations on quantum computers , volume =. Quantum , publisher =
[103]

On Extracting Private Randomness over a Public Channel , ISBN =

Dodis, Yevgeniy and Oliveira, Roberto , year =. On Extracting Private Randomness over a Public Channel , ISBN =. Lecture Notes in Computer Science , publisher =
[104]

Does Privacy Require True Randomness? , ISBN =

Bosley, Carl and Dodis, Yevgeniy , pages =. Does Privacy Require True Randomness? , ISBN =. Lecture Notes in Computer Science , publisher =
[105]

The power of randomness in Bayesian optimal mechanism design , journal =

Shuchi Chawla and David Malec and Balasubramanian Sivan , keywords =. The power of randomness in Bayesian optimal mechanism design , journal =. 2015 , issn =

2015
[106]

SIAM Journal on Computing , volume=

On the power of randomization in algorithmic mechanism design , author=. SIAM Journal on Computing , volume=. 2013 , publisher=

2013
[107]

and Shi, Yaoyun , year =

Miller, Carl A. and Shi, Yaoyun , year =. Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices , volume =. Journal of the ACM , publisher =
[108]

International Conference on the Theory and Application of Cryptology and Information Security , pages=

Obtaining universally compoable security: Towards the bare bones of trust , author=. International Conference on the Theory and Application of Cryptology and Information Security , pages=. 2007 , organization=

2007
[109]

Australasian Conference on Information Security and Privacy , pages=

Sok: Decentralized randomness beacon protocols , author=. Australasian Conference on Information Security and Privacy , pages=. 2022 , organization=

2022
[110]

zkBeacon: Proven Randomness Beacon Based on Zero-Knowledge Verifiable Computation , author=
[111]

Inside the hypersecure room where Powerball millionaires are made , author=
[112]

2013 , month=

Perlroth, Nicole and Larson, Jeﬀ and Shane, Scott , title=. 2013 , month=

2013
[113]

Fair algorithms for selecting citizens’ assemblies , volume =

Flanigan, Bailey and G\". Fair algorithms for selecting citizens’ assemblies , volume =. Nature , publisher =. 2021 , month = aug, pages =

2021
[114]

Quantum random number generators , volume =

Herrero-Collantes, Miguel and Garcia-Escartin, Juan Carlos , year =. Quantum random number generators , volume =. Reviews of Modern Physics , publisher =
[115]

Notes by GE Forsythe , pages=

Various techniques used in connection with random digits , author=. Notes by GE Forsythe , pages=
[116]

A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness , volume =

Mannalatha, Vaisakh and Mishra, Sandeep and Pathak, Anirban , year =. A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness , volume =. Quantum Information Processing , publisher =
[117]

Military Operations Research , pages=

The stochastic versus deterministic argument for combat simulations: Tales of when the average won't do , author=. Military Operations Research , pages=. 2000 , publisher=

2000
[118]

Proceedings of the Winter Simulation Conference , volume=

Exploring the world of agent-based simulations: Simple models, complex analyses , author=. Proceedings of the Winter Simulation Conference , volume=. 2002 , organization=

2002
[119]

Law Enforcement Science and Technology II, Proceedings of the Second National Symposium on Law Enforcement Science and Technology , pages=

Random patrol , author=. Law Enforcement Science and Technology II, Proceedings of the Second National Symposium on Law Enforcement Science and Technology , pages=
[120]

2021 IEEE International Symposium on Information Theory (ISIT) , pages=

Efficient distributed coin-tossing protocols , author=. 2021 IEEE International Symposium on Information Theory (ISIT) , pages=. 2021 , organization=

2021
[121]

Threshold Signatures using Secure Multiparty Computation , author=
[122]

Proceedings of the eighteenth annual ACM symposium on Theory of computing , pages=

Limits on the security of coin flips when half the processors are faulty , author=. Proceedings of the eighteenth annual ACM symposium on Theory of computing , pages=
[123]

2009 , eprint=

Improving the Security of Quantum Protocols via Commit-and-Open , author=. 2009 , eprint=

2009
[124]

arXiv preprint arXiv:1312.6199 , year=

Intriguing properties of neural networks , author=. arXiv preprint arXiv:1312.6199 , year=

arXiv
[125]

international conference on machine learning , pages=

Certified adversarial robustness via randomized smoothing , author=. international conference on machine learning , pages=. 2019 , organization=

2019
[126]

Proceedings of the IEEE conference on computer vision and pattern recognition , pages=

Universal adversarial perturbations , author=. Proceedings of the IEEE conference on computer vision and pattern recognition , pages=
[127]

2017 ieee symposium on security and privacy (sp) , pages=

Towards evaluating the robustness of neural networks , author=. 2017 ieee symposium on security and privacy (sp) , pages=. 2017 , organization=

2017
[128]

Joint European Conference on Machine Learning and Knowledge Discovery in Databases , pages=

Taking Over the Stock Market: Adversarial Perturbations Against Algorithmic Traders , author=. Joint European Conference on Machine Learning and Knowledge Discovery in Databases , pages=. 2021 , organization=

2021
[129]

ACM Trans

Cheng, Jiezhu and Huang, Kaizhu and Zheng, Zibin , title =. ACM Trans. Inf. Syst. , month =. 2024 , publisher =

2024
[130]

Advances in neural information processing systems , volume=

Fooling neural network interpretations via adversarial model manipulation , author=. Advances in neural information processing systems , volume=
[131]

Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006

Calibrating noise to sensitivity in private data analysis , author=. Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006. Proceedings 3 , pages=. 2006 , organization=

2006
[132]

Foundations and Trends

The algorithmic foundations of differential privacy , author=. Foundations and Trends. 2014 , publisher=

2014
[133]

Advances in Cryptology--CRYPTO 2015: 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part II 35 , pages=

Privacy with imperfect randomness , author=. Advances in Cryptology--CRYPTO 2015: 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part II 35 , pages=. 2015 , organization=

2015
[134]

Proceedings of the thirty-first annual ACM symposium on Theory of computing , pages=

Algorithmic mechanism design , author=. Proceedings of the thirty-first annual ACM symposium on Theory of computing , pages=
[135]

Brakerski, Zvika and Christiano, Paul and Mahadev, Urmila and Vazirani, Umesh and Vidick, Thomas , title =. J. ACM , month =. 2021 , issue_date =

2021
[136]

Preprint at https://arxiv.org/abs/2204.11353 , year=

Efficient certifiable randomness from a single quantum device , author=. Preprint at https://arxiv.org/abs/2204.11353 , year=

arXiv
[137]

2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) , pages=

Verifiable quantum advantage without structure , author=. 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) , pages=. 2022 , organization=

2022
[138]

Proceedings 41st Annual Symposium on Foundations of Computer Science , pages=

Extracting randomness from samplable distributions , author=. Proceedings 41st Annual Symposium on Foundations of Computer Science , pages=. 2000 , organization=

2000
[139]

IEEE 25th Annual Symposium on Foundations of Computer Science (FOCS’84) , pages=

Generating quasi-random sequences fromslightly-random sources , author=. IEEE 25th Annual Symposium on Foundations of Computer Science (FOCS’84) , pages=
[140]

2024 , eprint=

Cryptomite: A versatile and user-friendly library of randomness extractors , author=. 2024 , eprint=

2024
[141]

Extractors and pseudorandom generators , year =. J. ACM , month =
[142]

and Ben-Or, M

Rabin, T. and Ben-Or, M. , title =. Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing , pages =. 1989 , isbn =

1989
[143]

Conference on the Theory and Application of Cryptology , pages=

Bit commitment using pseudo-randomness , author=. Conference on the Theory and Application of Cryptology , pages=. 1989 , organization=

1989
[144]

Journal of Cryptology , volume=

Protocols for multiparty coin toss with a dishonest majority , author=. Journal of Cryptology , volume=. 2015 , publisher=

2015
[145]

ACM SIGACT News , volume=

Coin flipping by telephone a protocol for solving impossible problems , author=. ACM SIGACT News , volume=. 1983 , publisher=

1983
[146]

Scalable and Probabilistic Leaderless

Team Rocket and Maofan Yin and Kevin Sekniqi and Robbert van Renesse and Emin G. Scalable and Probabilistic Leaderless. CoRR , year =
[147]

Information Sciences , volume=

DRBFT: Delegated randomization Byzantine fault tolerance consensus protocol for blockchains , author=. Information Sciences , volume=. 2021 , publisher=

2021
[148]

2019 IEEE international conference on Blockchain (Blockchain) , pages=

Proteus: A scalable bft consensus protocol for blockchains , author=. 2019 IEEE international conference on Blockchain (Blockchain) , pages=. 2019 , organization=

2019
[149]

Bitcoin: A peer-to-peer electronic cash system , author=
[150]

Ethereum project yellow paper , volume=

Ethereum: A secure decentralised generalised transaction ledger , author=. Ethereum project yellow paper , volume=
[151]

Preprint at https://arxiv.org/abs/1707.01873 , year=

Blockchain consensus protocols in the wild , author=. Preprint at https://arxiv.org/abs/1707.01873 , year=

arXiv
[152]

Chainlink Labs , volume=

Chainlink 2.0: Next steps in the evolution of decentralized oracle networks , author=. Chainlink Labs , volume=
[153]

40th annual symposium on foundations of computer science (cat

Verifiable random functions , author=. 40th annual symposium on foundations of computer science (cat. No. 99CB37039) , pages=. 1999 , organization=

1999
[154]

Future Generation Computer Systems , volume=

Blockchain-based random auditor committee for integrity verification , author=. Future Generation Computer Systems , volume=. 2022 , publisher=

2022
[155]

A research agenda for creative industries , pages=

Web3 and the creative industries: how blockchains are reshaping business models , author=. A research agenda for creative industries , pages=. 2019 , publisher=

2019
[156]

Internet of Things and Cyber-Physical Systems , year=

Web3: A comprehensive review on background, technologies, applications, zero-trust architectures, challenges and future directions , author=. Internet of Things and Cyber-Physical Systems , year=
[157]

2010 , publisher=

Game-based marketing: inspire customer loyalty through rewards, challenges, and contests , author=. 2010 , publisher=

2010
[158]

IEEE Communications Surveys & Tutorials , volume=

Integration of blockchain and auction models: A survey, some applications, and challenges , author=. IEEE Communications Surveys & Tutorials , volume=. 2022 , publisher=

2022
[159]

Cryptology ePrint Archive , year=

Making NSEC5 practical for DNSSEC , author=. Cryptology ePrint Archive , year=
[160]

2024 , eprint=

RANDAO-based RNG: Last Revealer Attacks in Ethereum 2.0 Randomness and a Potential Solution , author=. 2024 , eprint=

2024
[161]

2018 , institution=

Recommendation for key management, part 2: best practices for key management organization , author=. 2018 , institution=

2018
[162]

URL: https://cryptonote

Cryptonote v 2.0 (2013) , author=. URL: https://cryptonote. org/whitepaper. pdf. White Paper. , pages=

2013
[163]

2014 IEEE symposium on security and privacy , pages=

Zerocash: Decentralized anonymous payments from bitcoin , author=. 2014 IEEE symposium on security and privacy , pages=. 2014 , organization=

2014
[164]

Narula, Neha and Vasquez, Willy and Virza, Madars , booktitle=
[165]

Proceedings of the 31st ACM International Conference on Information & Knowledge Management , pages=

Ledgit: A Service to Diagnose Illicit Addresses on Blockchain using Multi-modal Unsupervised Learning , author=. Proceedings of the 31st ACM International Conference on Information & Knowledge Management , pages=
[166]

IEEE Transactions on Industrial Informatics , volume=

Blockchain-enabled federated learning data protection aggregation scheme with differential privacy and homomorphic encryption in IIoT , author=. IEEE Transactions on Industrial Informatics , volume=. 2021 , publisher=

2021
[167]

ACM Computing Surveys , volume=

Blockchain-based federated learning for securing internet of things: A comprehensive survey , author=. ACM Computing Surveys , volume=. 2023 , publisher=

2023
[168]

5th Conference on Advances in Financial Technologies (AFT 2023) , year=

Privacy-Preserving Transactions with Verifiable Local Differential Privacy , author=. 5th Conference on Advances in Financial Technologies (AFT 2023) , year=

2023
[169]

, author=

Using randomized response for differential privacy preserving data collection. , author=. EDBT/ICDT Workshops , volume=
[170]

Bridging the gap between computer science and legal approaches to privacy , author=. Harv. JL & Tech. , volume=. 2017 , publisher=

2017
[171]

AEA papers and proceedings , volume=

Differential privacy and census data: Implications for social and economic research , author=. AEA papers and proceedings , volume=. 2019 , organization=

2019
[172]

2023 , institution=

Guidelines for Evaluating Differential Privacy Guarantees , author=. 2023 , institution=

2023
[173]

FAT’18: Proceedings of the Conference on Fairness, Accountability, and Transparency , pages=

The role of differential privacy in gdpr compliance , author=. FAT’18: Proceedings of the Conference on Fairness, Accountability, and Transparency , pages=
[174]

2015 , publisher=

Secure multiparty computation , author=. 2015 , publisher=

2015
[175]

The Sad History of Random Bits , volume =

Markowsky, George , year =. The Sad History of Random Bits , volume =. Journal of Cyber Security and Mobility , publisher =
[176]

SIAM Journal on Computing , volume=

Trevisan's extractor in the presence of quantum side information , author=. SIAM Journal on Computing , volume=. 2012 , publisher=

2012
[177]

On the Possibility of a Back Door in the NIST SP800-90 Dual

Shumow, Dan and Feguson, Niels , howpublished=. On the Possibility of a Back Door in the NIST SP800-90 Dual
[178]

Exclusive: Secret Contract Tied

Menn, Joseph , journal=. Exclusive: Secret Contract Tied. 2013 , mon=

2013
[179]

Quantum computational advantage via 60-qubit 24-cycle random circuit sampling , volume =

Zhu, Qingling and others , year =. Quantum computational advantage via 60-qubit 24-cycle random circuit sampling , volume =. Sci. Bull. , publisher =
[180]

Preprint at https://arxiv.org/abs/2406.02501 , year =

DeCross, Matthew and others , title =. Preprint at https://arxiv.org/abs/2406.02501 , year =

arXiv
[181]

On the classical hardness of spoofing linear cross-entropy benchmarking , volume =

Aaronson, Scott and Gunn, Sam , year =. On the classical hardness of spoofing linear cross-entropy benchmarking , volume =. Theory Comput. , publisher =
[182]

Proceedings of the 32nd Computational Complexity Conference , articleno =

Aaronson, Scott and Chen, Lijie , title =. Proceedings of the 32nd Computational Complexity Conference , articleno =. 2017 , isbn =

2017
[183]

Noise and the Frontier of Quantum Supremacy , booktitle =

Bouland, Adam and Fefferman, Bill and Landau, Zeph and Liu, Yunchao , year =. Noise and the Frontier of Quantum Supremacy , booktitle =
[184]

On the complexity and verification of quantum random circuit sampling , volume =

Bouland, Adam and Fefferman, Bill and Nirkhe, Chinmay and Vazirani, Umesh , year =. On the complexity and verification of quantum random circuit sampling , volume =. Nat. Phys. , publisher =
[185]

Preprint at https://arxiv.org/abs/2111.14846 , year=

On certified randomness from quantum advantage experiments , author=. Preprint at https://arxiv.org/abs/2111.14846 , year=
[186]

Nature , volume =

Liu, Minzhao and others , title =. Nature , volume =
[187]

2022 , howpublished=

Chainlink Lab with Zach Obront and Or Cyngiser , title=. 2022 , howpublished=

2022
[188]

Matthew , title =

Alpturer, Kaya and Weinberg, S. Matthew , title =. 6th Conference on Advances in Financial Technologies (AFT 2024) , pages =. 2024 , volume =

2024
[189]

Digital Threats , month = mar, articleno =

Amiet, Nils , title =. Digital Threats , month = mar, articleno =. 2021 , issue_date =

2021
[190]

, year =

Caflisch, Russel E. , year =. Monte Carlo and quasi-Monte Carlo methods , volume =. Acta Numerica , publisher =
[191]

System/360 Scientific Subroutine Package, Version III , volume =

International Business Machines Corporation , editor =. System/360 Scientific Subroutine Package, Version III , volume =. Stan’s Library , publisher =
[192]

Wichmann, B. A. and Hill, I. D. , year =. Algorithm AS 183: An Efficient and Portable Pseudo-Random Number Generator , volume =. Applied Statistics , publisher =
[193]

2013 , eprint=

True randomness from realistic quantum devices , author=. 2013 , eprint=

2013
[194]

Round-Optimal Secure Multiparty Computation with Honest Majority

Ananth, Prabhanjan and Choudhuri, Arka Rai and Goel, Aarushi and Jain, Abhishek. Round-Optimal Secure Multiparty Computation with Honest Majority. Advances in Cryptology -- CRYPTO 2018. 2018

2018
[195]

Theory Comput

The need for structure in quantum speedups , author=. Theory Comput. , volume=
[196]

arXiv preprint arXiv:0911.3814 , year=

Quantum and relativistic protocols for secure multi-party computation , author=. arXiv preprint arXiv:0911.3814 , year=

arXiv
[197]

International Conference on Principles of Security and Trust , pages=

Practical everlasting privacy , author=. International Conference on Principles of Security and Trust , pages=. 2013 , organization=

2013
[198]

Advances in Cryptology-CRYPTO 2006: 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006

Receipt-free universally-verifiable voting with everlasting privacy , author=. Advances in Cryptology-CRYPTO 2006: 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006. Proceedings 26 , pages=. 2006 , organization=

2006
[199]

Coercion-resistant internet voting with everlasting privacy , author=. Financial Cryptography and Data Security: FC 2016 International Workshops, BITCOIN, VOTING, and WAHC, Christ Church, Barbados, February 26, 2016, Revised Selected Papers 20 , pages=. 2016 , organization=

2016
[200]

, author=

Helios: Web-based Open-Audit Voting. , author=. USENIX security symposium , volume=
[201]

Foundations of Security, Protocols, and Equational Reasoning: Essays Dedicated to Catherine A

Belenios: a simple private and verifiable electronic voting system , author=. Foundations of Security, Protocols, and Equational Reasoning: Essays Dedicated to Catherine A. Meadows , pages=. 2019 , publisher=

2019
[202]

2008 IEEE Symposium on Security and Privacy (sp 2008) , pages=

Civitas: Toward a secure voting system , author=. 2008 IEEE Symposium on Security and Privacy (sp 2008) , pages=. 2008 , organization=

2008
[203]

2016 IEEE 29th Computer Security Foundations Symposium (CSF) , pages=

sElect: a lightweight verifiable remote voting system , author=. 2016 IEEE 29th Computer Security Foundations Symposium (CSF) , pages=. 2016 , organization=

2016
[204]

2020 IEEE European Symposium on Security and Privacy (EuroS&P) , pages=

Ordinos: A verifiable tally-hiding e-voting system , author=. 2020 IEEE European Symposium on Security and Privacy (EuroS&P) , pages=. 2020 , organization=

2020
[205]

Privacy Enhancing Technologies Symposium (PETS) , year=

Sok: Secure e-voting with everlasting privacy , author=. Privacy Enhancing Technologies Symposium (PETS) , year=
[206]

Mathematics , volume=

Netvote: a strict-coercion resistance re-voting based internet voting scheme with linear filtering , author=. Mathematics , volume=. 2020 , publisher=

2020
[207]

Financial Cryptography and Data Security: FC 2017 International Workshops, WAHC, BITCOIN, VOTING, WTSC, and TA, Sliema, Malta, April 7, 2017, Revised Selected Papers 21 , pages=

Using selene to verify your vote in JCJ , author=. Financial Cryptography and Data Security: FC 2017 International Workshops, WAHC, BITCOIN, VOTING, WTSC, and TA, Sliema, Malta, April 7, 2017, Revised Selected Papers 21 , pages=. 2017 , organization=

2017
[208]

1995 , publisher=

Randomized Algorithms , author=. 1995 , publisher=

1995
[209]

Proceedings of the 19th Workshop on Privacy in the Electronic Society , author =

Randomness concerns when Deploying differential privacy , volume =. Proceedings of the 19th Workshop on Privacy in the Electronic Society , author =. 2020 , month = nov, pages =

2020
[210]

and Pinkas, B

Gutterman, Z. and Pinkas, B. and Reinman, T. , year =. Analysis of the Linux random number generator , booktitle =
[211]

Intel Digital Random Number Generator (DRNG) Software Implementation Guide , howpublished =
[212]

AMD Secure Random Number Generator Library , howpublished =
[213]

, title =

Amazon Web Services, Inc. , title =
[214]

Seth , year =

Shrimpton, Thomas and Terashima, R. Seth , year =. A Provable-Security Analysis of Intel’s Secure Key RNG , ISBN =. Advances in Cryptology -- EUROCRYPT 2015 , publisher =

2015
[215]

Theodore Ts'o , title =
[216]

Journal of Statistics Education , volume=

Nonrandom risk: The 1970 draft lottery , author=. Journal of Statistics Education , volume=

1970
[217]

and Chatfield, Sara , year =

Berinsky, Adam J. and Chatfield, Sara , year =. An Empirical Justification for the Use of Draft Lottery Numbers as a Random Treatment in Political Science Research , volume =. Political Analysis , publisher =
[218]

Assessing randomness in case assignment: the case study of the Brazilian Supreme Court , volume =

Marcondes, Diego and Peixoto, Cláudia and Stern, Julio Michael , year =. Assessing randomness in case assignment: the case study of the Brazilian Supreme Court , volume =. Law, Probability and Risk , publisher =
[219]

PyGellermann: a Python tool to generate pseudorandom series for human and non-human animal behavioural experiments , volume =

Jadoul, Yannick and Duengen, Diandra and Ravignani, Andrea , year =. PyGellermann: a Python tool to generate pseudorandom series for human and non-human animal behavioural experiments , volume =. BMC Research Notes , publisher =
[220]

Establishing a New Benchmark in Quantum Computational Advantage with 105-qubit Zuchongzhi 3.0 Processor , author =. Phys. Rev. Lett. , volume =. 2025 , month =

2025
[221]

and Kelsey, John M

Barker, Elaine B. and Kelsey, John M. , journal=. Recommendation for Random Number Generation Using Deterministic Random Bit Generators , institution =
[222]

Special Publication (NIST SP) , note =

Recommendation for the entropy sources used for random bit generation , author =. Special Publication (NIST SP) , note =
[223]

Recommendation for Random Bit Generator (RBG) Constructions , institution =

Barker, Elaine , journal=. Recommendation for Random Bit Generator (RBG) Constructions , institution =
[224]

Annual International Cryptology Conference , pages=

Security-preserving distributed samplers: how to generate any CRS in one round without random oracles , author=. Annual International Cryptology Conference , pages=. 2023 , organization=

2023
[225]

Preprint at https://arxiv.org/abs/2411.05247 , year=

Traceable random numbers from a nonlocal quantum advantage , author=. Preprint at https://arxiv.org/abs/2411.05247 , year=
[226]

Preprint at https://arxiv.org/abs/2410.03982 , year=

Certified randomness implies secure classical position-verification , author=. Preprint at https://arxiv.org/abs/2410.03982 , year=

arXiv
[227]

Nature , volume=

Random numbers certified by Bell’s theorem , author=. Nature , volume=. 2010 , publisher=

2010
[228]

Journal of Physics A: Mathematical and Theoretical , volume=

Private randomness expansion with untrusted devices , author=. Journal of Physics A: Mathematical and Theoretical , volume=. 2011 , publisher=

2011
[229]

2004 , publisher=

Speakable and unspeakable in quantum mechanics: Collected papers on quantum philosophy , author=. 2004 , publisher=

2004
[230]

Nature , volume=

Experimentally generated randomness certified by the impossibility of superluminal signals , author=. Nature , volume=. 2018 , publisher=

2018
[231]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages=

Quantum advantage from any non-local game , author=. Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages=
[232]

SIAM Journal on Computing , volume=

Classical homomorphic encryption for quantum circuits , author=. SIAM Journal on Computing , volume=. 2020 , publisher=

2020
[233]

Annual International Cryptology Conference , pages=

Quantum FHE (almost) as secure as classical , author=. Annual International Cryptology Conference , pages=. 2018 , organization=

2018
[234]

Nature , volume=

Loophole-free Bell inequality violation using electron spins separated by 1.3 kilometres , author=. Nature , volume=. 2015 , publisher=

2015
[235]

Physical review letters , volume=

Strong loophole-free test of local realism , author=. Physical review letters , volume=. 2015 , publisher=

2015
[236]

Bell nonlocality , author=. Rev. Mod. Phys. , volume=. 2014 , publisher=

2014
[237]

Endowment Effects in the Field: Evidence from India’s IPO Lotteries , volume =

Anagol, Santosh and Balasubramaniam, Vimal and Ramadorai, Tarun , year =. Endowment Effects in the Field: Evidence from India’s IPO Lotteries , volume =. The Review of Economic Studies , publisher =
[238]

The FX Race to Zero: Electronification and Market Structural Issues in Foreign Exchange Trading , ISSN =

Marcus, Dan and Kellerman, Miles , year =. The FX Race to Zero: Electronification and Market Structural Issues in Foreign Exchange Trading , ISSN =. SSRN Electronic Journal , publisher =
[239]

High-Frequency Spoofing, Market Fairness and Regulation , publisher =

Oriol, Nathalie and Ladley, Daniel and Veryzhenko, Iryna , year =. High-Frequency Spoofing, Market Fairness and Regulation , publisher =
[240]

Do speed bumps curb low-latency investment? Evidence from a laboratory market , volume =

Khapko, Mariana and Zoican, Marius , year =. Do speed bumps curb low-latency investment? Evidence from a laboratory market , volume =. Journal of Financial Markets , publisher =
[241]

Priming and Stock Preferences: Evidence From IPO Lotteries , ISSN =

Hu, Conghui and Liu, Yu-Jane and Xu, Xin and Yu, Jianfeng , year =. Priming and Stock Preferences: Evidence From IPO Lotteries , ISSN =. SSRN Electronic Journal , publisher =
[242]

Schwartz , journal =

Kyle J. Schwartz , journal =. INVESTOR PARTICIPATION IN INITIAL PUBLIC OFFERINGS , urldate =
[243]

PRX Quantum , volume =

Loophole-Free Interferometric Test of Macrorealism Using Heralded Single Photons , author =. PRX Quantum , volume =. 2022 , month =

2022
[244]

Single-System-Based Generation of Certified Randomness Using Leggett-Garg Inequality , author =. Phys. Rev. Lett. , volume =. 2024 , month =

2024
[245]

Generalized measurements on qubits in quantum randomness certification and expansion , author =. Phys. Rev. Appl. , volume =. 2024 , month =

2024
[246]

Chainlink VRF Best Practices , howpublished =
[247]

Chainlink VRF Coordinator Contract , howpublished =
[248]

2025 , issue_date =

Pavloff, Ulysse and Amoussou-Guenou, Yackolley and Tucci-Piergiovanni, Sara , title =. 2025 , issue_date =. doi:10.1145/3705615 , journal =

2025 doi
[249]

Alturki, Musab A. and Ro. Statistical Model Checking of RANDAO’s Resilience to Pre-computed Reveal Strategies , year =. doi:10.1007/978-3-030-54994-7_25 , booktitle =

doi
[250]

2025 , eprint=

Certified randomness amplification by dynamically probing remote random quantum states , author=. 2025 , eprint=

2025
[251]

Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) , year =

Jens Groth , title =. Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) , year =
[252]

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference , year =

Bitansky, Nir and Canetti, Ran and Chiesa, Alessandro and Tromer, Eran , title =. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference , year =
[253]

Bitansky, Nir and Canetti, Ran and Chiesa, Alessandro and Goldwasser, Shafi and Lin, Huijia and Rubinstein, Aviad and Tromer, Eran , title =. J. Cryptol. , year =. doi:10.1007/s00145-016-9241-9 , url =

doi
[254]

IEEE Transactions on information theory , volume=

A fully quantum asymptotic equipartition property , author=. IEEE Transactions on information theory , volume=. 2009 , publisher=

2009
[255]

2015 , url =

Joseph Bonneau and Jeremy Clark and Steven Goldfeder , title =. 2015 , url =

2015
[256]

LucidiTEE: Scalable Policy-Based Multiparty Computation with Fairness , ISBN =

Gaddam, Sivanarayana and Kumaresan, Ranjit and Raghuraman, Srinivasan and Sinha, Rohit , year =. LucidiTEE: Scalable Policy-Based Multiparty Computation with Fairness , ISBN =. doi:10.1007/978-981-99-7563-1_16 , booktitle =

doi
[257]

Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards , url =

Choudhuri, Arka Rai and Green, Matthew and Jain, Abhishek and Kaptchuk, Gabriel and Miers, Ian , year =. Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards , url =. doi:10.1145/3133956.3134092 , booktitle =
[258]

Incentives in Ethereum’s Hybrid Casper Protocol , url =

Buterin, Vitalik and Reijsbergen, Daniel and Leonardos, Stefanos and Piliouras, Georgios , year =. Incentives in Ethereum’s Hybrid Casper Protocol , url =. doi:10.1109/bloc.2019.8751241 , booktitle =

2019
[259]

Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol , ISBN =

Kiayias, Aggelos and Russell, Alexander and David, Bernardo and Oliynykov, Roman , year =. Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol , ISBN =. doi:10.1007/978-3-319-63688-7_12 , booktitle =

doi
[260]

, year =

Nash, John F. , year =. Equilibrium points in n-person games , volume =. Proceedings of the National Academy of Sciences , publisher =. doi:10.1073/pnas.36.1.48 , number =

doi
[261]

Synchronous Constructive Cryptography , ISBN =

Liu-Zhang, Chen-Da and Maurer, Ueli , year =. Synchronous Constructive Cryptography , ISBN =. doi:10.1007/978-3-030-64378-2_16 , booktitle =

doi
[262]

TARDIS: A Foundation of Time-Lock Puzzles in UC , ISBN =

Baum, Carsten and David, Bernardo and Dowsley, Rafael and Nielsen, Jesper Buus and Oechsner, Sabine , year =. TARDIS: A Foundation of Time-Lock Puzzles in UC , ISBN =. doi:10.1007/978-3-030-77883-5_15 , booktitle =

doi
[263]

Fair and Robust Multi-party Computation Using a Global Transaction Ledger , ISBN =

Kiayias, Aggelos and Zhou, Hong-Sheng and Zikas, Vassilis , year =. Fair and Robust Multi-party Computation Using a Global Transaction Ledger , ISBN =. doi:10.1007/978-3-662-49896-5_25 , booktitle =

doi
[264]

Randomness is Linear in Space , volume =

Nisan, Noam and Zuckerman, David , year =. Randomness is Linear in Space , volume =. Journal of Computer and System Sciences , publisher =. doi:10.1006/jcss.1996.0004 , number =

1996
[265]

International Conference on Supercomputing , year=

Abstract Cryptography , author=. International Conference on Supercomputing , year=
[266]

Constructive Cryptography -- A New Paradigm for Security Definitions and Proofs

Maurer, Ueli. Constructive Cryptography -- A New Paradigm for Security Definitions and Proofs. Theory of Security and Applications. 2012

2012
[267]

From Indifferentiability to Constructive Cryptography (and Back) , ISBN =

Maurer, Ueli and Renner, Renato , year =. From Indifferentiability to Constructive Cryptography (and Back) , ISBN =. doi:10.1007/978-3-662-53641-4_1 , booktitle =

doi
[268]

What Did Come Out of It? Analysis and Improvements of DIDComm Messaging , url =

Badertscher, Christian and Banfi, Fabio and Diaz, Jesus , year =. What Did Come Out of It? Analysis and Improvements of DIDComm Messaging , url =. doi:10.1145/3658644.3690300 , booktitle =
[269]

Security in quantum cryptography , volume =

Portmann, Christopher and Renner, Renato , year =. Security in quantum cryptography , volume =. Reviews of Modern Physics , publisher =. doi:10.1103/revmodphys.94.025008 , number =

doi
[270]

Composition with Knowledge Assumptions , ISBN =

Kerber, Thomas and Kiayias, Aggelos and Kohlweiss, Markulf , year =. Composition with Knowledge Assumptions , ISBN =. doi:10.1007/978-3-030-84259-8_13 , booktitle =

doi
[271]

A Unified and Composable Take on Ratcheting , ISBN =

Jost, Daniel and Maurer, Ueli and Mularczyk, Marta , year =. A Unified and Composable Take on Ratcheting , ISBN =. doi:10.1007/978-3-030-36033-7_7 , booktitle =

doi
[272]

Quantum Authentication with Key Recycling , ISBN =

Portmann, Christopher , year =. Quantum Authentication with Key Recycling , ISBN =. doi:10.1007/978-3-319-56617-7_12 , booktitle =

doi
[273]

Quantum computing and the entanglement frontier , publisher =

Preskill, John , keywords =. Quantum computing and the entanglement frontier , publisher =. 2012 , copyright =. doi:10.48550/ARXIV.1203.5813 , url =

2012 doi arXiv
[274]

A Definitional Framework for Functional Encryption , url =

Matt, Christian and Maurer, Ueli , year =. A Definitional Framework for Functional Encryption , url =. doi:10.1109/csf.2015.22 , booktitle =

2015 doi
[275]

Lattice Signatures without Trapdoors

Lyubashevsky, Vadim. Lattice Signatures without Trapdoors. Advances in Cryptology -- EUROCRYPT 2012. 2012

2012
[276]

various techniques used in connection with random digits , author=

13. various techniques used in connection with random digits , author=. Appl. Math Ser , volume=
[277]

Everlasting UC Commitments from Fully Malicious PUFs , volume =

Magri, Bernardo and Malavolta, Giulio and Schr\". Everlasting UC Commitments from Fully Malicious PUFs , volume =. Journal of Cryptology , publisher =. doi:10.1007/s00145-022-09432-4 , number =

doi
[278]

Brandão, Fernando G. S. L. and Harrow, Aram W. and Horodecki, Michał , year =. Local Random Quantum Circuits are Approximate Polynomial-Designs , volume =. Communications in Mathematical Physics , publisher =. doi:10.1007/s00220-016-2706-8 , number =

doi
[279]

Simple Constructions of Linear-Depth t-Designs and Pseudorandom Unitaries , url =

Metger, Tony and Poremba, Alexander and Sinha, Makrand and Yuen, Henry , year =. Simple Constructions of Linear-Depth t-Designs and Pseudorandom Unitaries , url =. doi:10.1109/focs61266.2024.00038 , booktitle =

2024
[280]

Verifiable Quantum Advantage without Structure , volume =

Yamakawa, Takashi and Zhandry, Mark , year =. Verifiable Quantum Advantage without Structure , volume =. Journal of the ACM , publisher =. doi:10.1145/3658665 , number =

doi
[281]

Entropy Accumulation , volume =

Dupuis, Frédéric and Fawzi, Omar and Renner, Renato , year =. Entropy Accumulation , volume =. Communications in Mathematical Physics , publisher =. doi:10.1007/s00220-020-03839-5 , number =

doi
[282]

Random oracles are practical: a paradigm for designing efficient protocols , url =

Bellare, Mihir and Rogaway, Phillip , year =. Random oracles are practical: a paradigm for designing efficient protocols , url =. doi:10.1145/168588.168596 , booktitle =
[283]

Separate Your Domains: NIST PQC KEMs, Oracle Cloning and Read-Only Indifferentiability , ISBN =

Bellare, Mihir and Davis, Hannah and G\". Separate Your Domains: NIST PQC KEMs, Oracle Cloning and Read-Only Indifferentiability , ISBN =. 2020 , pages =. doi:10.1007/978-3-030-45724-2_1 , booktitle =

2020 doi
[284]

On the Concrete Security of TLS 1.3 PSK Mode , ISBN =

Davis, Hannah and Diemert, Denis and G\". On the Concrete Security of TLS 1.3 PSK Mode , ISBN =. 2022 , pages =. doi:10.1007/978-3-031-07085-3_30 , booktitle =

2022 doi
[285]

Cryptographic Extraction and Key Derivation: The HKDF Scheme , ISBN =

Krawczyk, Hugo , year =. Cryptographic Extraction and Key Derivation: The HKDF Scheme , ISBN =. doi:10.1007/978-3-642-14623-7_34 , booktitle =

doi
[286]

True Random Number Generator Embedded in Reconfigurable Hardware , ISBN =

Fischer, Viktor and Drutarovský, Miloš , year =. True Random Number Generator Embedded in Reconfigurable Hardware , ISBN =. doi:10.1007/3-540-36400-5_30 , booktitle =

doi
[287]

and Acín, A

Pironio, S. and Acín, A. and Massar, S. and de la Giroday, A. Boyer and Matsukevich, D. N. and Maunz, P. and Olmschenk, S. and Hayes, D. and Luo, L. and Manning, T. A. and Monroe, C. , year =. Random numbers certified by Bell’s theorem , volume =. Nature , publisher =. doi:10....

doi
[288]

FPLotto: A fair blockchain-based lottery scheme for privacy protection , year=

Pan, Yuechen and Zhao, Yiwen and Liu, Xiaoguang and Wang, Gang and Su, Ming , booktitle=. FPLotto: A fair blockchain-based lottery scheme for privacy protection , year=
[289]

2025 , howpublished =

Chainlink , title =. 2025 , howpublished =

2025
[290]

Secure Distributed Key Generation for Discrete-Log Based Cryptosystems , volume =

Gennaro, Rosario and Jarecki, Stanislaw and Krawczyk, Hugo and Rabin, Tal , year =. Secure Distributed Key Generation for Discrete-Log Based Cryptosystems , volume =. Journal of Cryptology , publisher =. doi:10.1007/s00145-006-0347-3 , number =

doi
[291]

and Smelyanskiy, Vadim N

Boixo, Sergio and Isakov, Sergei V. and Smelyanskiy, Vadim N. and Babbush, Ryan and Ding, Nan and Jiang, Zhang and Bremner, Michael J. and Martinis, John M. and Neven, Hartmut , year =. Characterizing quantum supremacy in near-term devices , volume =. Nature Physics , publishe...

doi
[292]

SCRAPE: Scalable Randomness Attested by Public Entities , ISBN =

Cascudo, Ignacio and David, Bernardo , year =. SCRAPE: Scalable Randomness Attested by Public Entities , ISBN =. doi:10.1007/978-3-319-61204-1_27 , booktitle =

doi
[293]

and Ford, Bryan , booktitle=

Syta, Ewa and Jovanovic, Philipp and Kogias, Eleftherios Kokoris and Gailly, Nicolas and Gasser, Linus and Khoffi, Ismail and Fischer, Michael J. and Ford, Bryan , booktitle=. Scalable Bias-Resistant Distributed Randomness , year=
[294]

Unbiasable Verifiable Random Functions , ISBN =

Giunta, Emanuele and Stewart, Alistair , year =. Unbiasable Verifiable Random Functions , ISBN =. doi:10.1007/978-3-031-58737-5_6 , booktitle =

doi
[295]

Silicon physical random functions , DOI =

Gassend, Blaise and Clarke, Dwaine and van Dijk, Marten and Devadas, Srinivas , year =. Silicon physical random functions , DOI =. Proceedings of the 9th ACM conference on Computer and communications security , publisher =
[296]

Modeling attacks on physical unclonable functions , DOI =

R\". Modeling attacks on physical unclonable functions , DOI =. Proceedings of the 17th ACM conference on Computer and communications security , publisher =. 2010 , month = Oct, pages =

2010
[297]

PUF Enrollment and Life Cycle Management: Solutions and Perspectives for the Test Community , url =

Pour, Amir Ali and Beroulle, Vincent and Cambou, Bertrand and Danger, Jean-Luc and Di Natale, Giorgio and Hely, David and Guilley, Sylvain and Karimi, Naghmeh , year =. PUF Enrollment and Life Cycle Management: Solutions and Perspectives for the Test Community , url =. doi:10....

2020
[298]

MIT CSAIL CSG Technical Memo , volume=

PUF-based random number generation , author=. MIT CSAIL CSG Technical Memo , volume=. 2004 , publisher=

2004
[299]

2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) , pages=

PUF-based authentication , author=. 2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) , pages=. 2015 , organization=

2015
[300]

and Luby, Michael , year =

HÅstad, Johan and Impagliazzo, Russell and Levin, Leonid A. and Luby, Michael , year =. A Pseudorandom Generator from any One-way Function , volume =. SIAM Journal on Computing , publisher =. doi:10.1137/s0097539793244708 , number =

doi

Pith tools

Reviewed July 30, 2026 · model on record in the stance chip above.

[1] [36]

NIZKs with an untrusted CRS: security in the face of parameter subversion , author=. Advances in Cryptology--ASIACRYPT 2016: 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II 22 , pages=. 2016 , organization=

2016

[2] [37]

Annual International Conference on the Theory and Applications of Cryptographic Techniques , pages=

Towards accountability in CRS generation , author=. Annual International Conference on the Theory and Applications of Cryptographic Techniques , pages=. 2021 , organization=

2021

[3] [1]

Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security , pages=

Security analysis of pseudo-random number generators with input: /dev/random is not robust , author=. Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security , pages=

2013

[4] [2]

International Conference on Financial Cryptography and Data Security , pages=

Practical post-quantum few-time verifiable random function with applications to algorand , author=. International Conference on Financial Cryptography and Data Security , pages=. 2021 , organization=

2021

[5] [3]

Advances in Cryptology-EUROCRYPT 2006: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St

Perfect non-interactive zero knowledge for NP , author=. Advances in Cryptology-EUROCRYPT 2006: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28-June 1, 2006. Proceedings 25 , pages=. 2006 , organization=

2006

[6] [4]

IACR Transactions on Cryptographic Hardware and Embedded Systems , pages=

Crystals-dilithium: A lattice-based digital signature scheme , author=. IACR Transactions on Cryptographic Hardware and Embedded Systems , pages=

[7] [5]

Proceedings of the 27th annual computer security applications conference , pages=

Key escrow from a safe distance: looking back at the clipper chip , author=. Proceedings of the 27th annual computer security applications conference , pages=

[8] [6]

Nature , volume=

Certified randomness in quantum physics , author=. Nature , volume=. 2016 , publisher=

2016