REVIEW 2 cited by
Random Number Generators and Seeding for Differential Privacy
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Differential Privacy (DP) relies on random numbers to preserve privacy, typically utilising Pseudorandom Number Generators (PRNGs) as a source of randomness. In order to allow for consistent reproducibility, testing and bug-fixing in DP algorithms and results, it is important to allow for the seeding of the PRNGs used therein. In this work, we examine the landscape of Random Number Generators (RNGs), and the considerations software engineers should make when choosing and seeding a PRNG for DP. We hope it serves as a suitable guide for DP practitioners, and includes many lessons learned when implementing seeding for diffprivlib.
Forward citations
Cited by 2 Pith papers
-
Energy-Efficient Sampling Using Stochastic Magnetic Tunnel Junctions
A bit-by-bit configuration of stochastic magnetic tunnel junctions produces uniform Float16 samples and enables low-energy sampling from arbitrary 1D distributions.
-
Entropy Mixing Networks: Enhancing Pseudo-Random Number Generators with Lightweight Dynamic Entropy Injection
A hybrid generator that hashes OS entropy into a Mersenne Twister reports higher chi-squared p-value and entropy than two baselines, but the differences are tiny and the runs test numbers are inconsistent.
Discussion (0). Continue with ORCID to comment.