Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources
From MaRDI portal
Publication:2794527
DOI10.1007/978-3-319-28166-7_33zbMath1423.94047OpenAlexW2188498508MaRDI QIDQ2794527
Michael Backes, Aniket Kate, Tim Ruffing, Sebastian Meiser
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
pseudorandom generatorsindistinguishabilityrandomnessdifferential privacySantha-Vazirani sourcesweak sources
Related Items (2)
On secret sharing, randomness, and random-less reductions for secret sharing ⋮ Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources
Cites Work
- Unnamed Item
- Generating quasi-random sequences from semi-random sources
- A note on negligible functions
- Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources
- On the Impossibility of Cryptography with Tamperable Randomness
- Differential Privacy with Imperfect Randomness
- Computational Differential Privacy
- Privacy with Imperfect Randomness
- How to Encrypt with a Malicious Random Number Generator
- Does Privacy Require True Randomness?
- Hedged Public-Key Encryption: How to Protect against Bad Randomness
- Privacy Amplification by Public Discussion
- On the Impossibility of Private Key Cryptography with Weakly Random Keys
- Foundations of Cryptography
- Overcoming Weak Expectations
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Reducing Complexity Assumptions for Statistically-Hiding Commitment
- Distributed Computing
- Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
- Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources
