Gambling, computational information and encryption security

DOI10.1007/978-3-319-17470-9_9MaRDI QIDQ2947527zbMATH OpenOpenAlexFDO

Authors Mohammad Hajiabadi, Bruce M. Kapron

Publication date 24 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-17470-9_9

zbMATH Keywords

computational entropyKelly criterionKL-hardnessrational adversariessemantic security

Mathematics Subject Classification ID

Probabilistic games; gambling (91A60) Measures of information, entropy (94A17) Cryptography (94A60)

Recommendations

• Theory of Cryptography
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• On hiding information from an oracle
• Probabilistic encryption
• scientific article; zbMATH DE number 1088242

Cites work

• A Pseudorandom Generator from any One-way Function
• Adaptive game playing using multiplicative weights
• Communication Theory of Secrecy Systems*
• Comparing notions of computational entropy
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Elements of Information Theory
• Foundations of Cryptography
• scientific article; zbMATH DE number 194098 (Why is no real title available?)
• Prediction, Learning, and Games
• Probabilistic encryption
• Semantic security for the wiretap channel
• Shannon impossibility, revisited
• The Notion of Security for Probabilistic Cryptosystems

Cited in

(1)

• Bit security as computational cost for winning games with high probability

This page was built for publication: Gambling, computational information and encryption security

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