Information-theoretic security with asymmetries

DOI10.1007/978-3-031-68385-5_15MaRDI QIDQ6652930

Yu Long Chen, Tim Beyne

Publication date: 13 December 2024

zbMATH Keywords

information-theoretic securitymulti-user securitypower boundsasymmetrical statistical costs

Mathematics Subject Classification ID

Information theory (general) (94A15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Information-theoretic indistinguishability via the chi-squared method
• The memory-tightness of authenticated encryption
• Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
• Multi-key Security: The Even-Mansour Construction Revisited
• A Provable-Security Treatment of the Key-Wrap Problem
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• The “Coefficients H” Technique
• IX. On the problem of the most efficient tests of statistical hypotheses
• Proof of Mirror Theory for ξ _max = 2
• Tight Security Bounds for Key-Alternating Ciphers
• The Multi-user Security of Double Encryption
• The query-complexity of preprocessing attacks
• Improved multi-user security using the squared-ratio method

This page was built for publication: Information-theoretic security with asymmetries