Does Privacy Require True Randomness?

DOI10.1007/978-3-540-70936-7_1MaRDI QIDQ3596370zbMATH OpenOpenAlexFDO

Authors Carl Bosley, Yevgeniy Dodis

Publication date 30 August 2007

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70936-7_1

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Privacy with Imperfect Randomness
• Secrecy without perfect randomness: cryptography with (bounded) weak sources
• Theory of Cryptography
• On the Impossibility of Private Key Cryptography with Weakly Random Keys
• Differential privacy with imperfect randomness

Cited in

(9)

• Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
• Secrecy without perfect randomness: cryptography with (bounded) weak sources
• Differential privacy with imperfect randomness
• Is privacy compatible with truthfulness?
• Privacy with Imperfect Randomness
• scientific article; zbMATH DE number 1284001 (Why is no real title available?)
• Can the freedom-of-choice loophole be closed merely with genuine randomness?
• Theory of Cryptography
• On secret sharing, randomness, and random-less reductions for secret sharing

This page was built for publication: Does Privacy Require True Randomness?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596370)