Secrecy without perfect randomness: cryptography with (bounded) weak sources

DOI10.1007/978-3-319-28166-7_33MaRDI QIDQ2794527zbMATH OpenOpenAlexFDO

Authors Michael Backes, Aniket Kate, Sebastian Meiser, Tim Ruffing

Publication date 10 March 2016

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28166-7_33

zbMATH Keywords

differential privacyrandomnessindistinguishabilitypseudorandom generatorsSantha-Vazirani sourcesweak sources

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Privacy with Imperfect Randomness
• On the Impossibility of Private Key Cryptography with Weakly Random Keys
• Does Privacy Require True Randomness?
• Theory of Cryptography
• Differential privacy with imperfect randomness

Cites work

• scientific article; zbMATH DE number 1088243 (Why is no real title available?)
• A note on negligible functions
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Computational Differential Privacy
• Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
• Differential privacy with imperfect randomness
• Distributed Computing
• Does Privacy Require True Randomness?
• Foundations of Cryptography
• Generating quasi-random sequences from semi-random sources
• Hedged public-key encryption: how to protect against bad randomness
• How to Encrypt with a Malicious Random Number Generator
• On the Impossibility of Private Key Cryptography with Weakly Random Keys
• On the impossibility of cryptography with tamperable randomness
• Overcoming weak expectations
• Privacy Amplification by Public Discussion
• Privacy with Imperfect Randomness
• Reducing Complexity Assumptions for Statistically-Hiding Commitment
• Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
• Secrecy without perfect randomness: cryptography with (bounded) weak sources
• Theory of Cryptography
• Theory of Cryptography

Cited in

(16)

• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• A Review of Secret Key Distribution Based on Bounded Observability
• Overcoming weak expectations via the Rényi entropy and the expanded computational entropy
• Does Privacy Require True Randomness?
• Seeing opportunity in every difficulty: protecting information with weak value techniques
• Theory of Cryptography
• Differential privacy with imperfect randomness
• Conditionally-perfect secrecy and a provably-secure randomized cipher
• scientific article; zbMATH DE number 1341864 (Why is no real title available?)
• On the Impossibility of Private Key Cryptography with Weakly Random Keys
• On secret sharing, randomness, and random-less reductions for secret sharing
• Secure Sketch and Fuzzy Extractor with Imperfect Randomness: An Information-Theoretic Study
• Barriers in cryptography with weak, correlated and leaky sources
• Overcoming weak expectations
• Secrecy without perfect randomness: cryptography with (bounded) weak sources

This page was built for publication: Secrecy without perfect randomness: cryptography with (bounded) weak sources

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