Overcoming weak expectations via the Rényi entropy and the expanded computational entropy

DOI10.1007/978-3-319-04268-8_10zbMATH Open1395.94319OpenAlexW1438448914MaRDI QIDQ2948261FDOQ2948261

Authors: Yanqing Yao, Zhoujun Li 

Publication date: 30 September 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-319-04268-8_10

Recommendations

• Overcoming weak expectations
• Secrecy without perfect randomness: cryptography with (bounded) weak sources
• Computational analogues of entropy
• Theory of Cryptography
• Improved security evaluation techniques for imperfect randomness from arbitrary distributions

zbMATH Keywords

computational entropysymmetric-key encryption schemescomputational extractorsweak pseudorandom functionsweak secret sourcesRényi entropy

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Cryptography (94A60)

Cited In (2)

• Secure Sketch and Fuzzy Extractor with Imperfect Randomness: An Information-Theoretic Study
• Overcoming weak expectations

This page was built for publication: Overcoming weak expectations via the Rényi entropy and the expanded computational entropy

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