Privacy with Imperfect Randomness
From MaRDI portal
Publication:3457080
DOI10.1007/978-3-662-48000-7_23zbMath1369.94529OpenAlexW2295705587MaRDI QIDQ3457080
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_23
Related Items
A unified framework of identity-based sequential aggregate signatures from 2-level HIBE schemes ⋮ On secret sharing, randomness, and random-less reductions for secret sharing ⋮ Learning under \(p\)-tampering poisoning attacks ⋮ Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources ⋮ Cryptographic pseudorandom generators can make cryptosystems problematic
Cites Work
- Some extremal problems arising from discrete control processes
- Generating quasi-random sequences from semi-random sources
- Universal classes of hash functions
- Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
- Simulating BPP using a general weak random source
- Differential Privacy with Imperfect Randomness
- Cryptographic Extraction and Key Derivation: The HKDF Scheme
- Does Privacy Require True Randomness?
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Weak Random Sources, Hitting Sets, and BPP Simulations
- True Random Number Generators Secure in a Changing Environment
- Secure Remote Authentication Using Biometric Data
- Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
