Sharp lower bounds on the extractable randomness from non-uniform sources
From MaRDI portal
Publication:719242
DOI10.1016/j.ic.2011.06.001zbMath1235.68114OpenAlexW1993376464MaRDI QIDQ719242
Evgeny Verbitskiy, Chibuzo Obi, Boris Škorić, Berry Schoenmakers
Publication date: 10 October 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2011.06.001
Cryptography (94A60) Measures of information, entropy (94A17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Universal classes of hash functions
- Universal hashing and authentication codes
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- A Pseudorandom Generator from any One-way Function
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sharp lower bounds on the extractable randomness from non-uniform sources
