Information-theoretic security with asymmetries

DOI10.1007/978-3-031-68385-5_15MaRDI QIDQ6652930zbMATH OpenFDO

Authors Tim Beyne, Yu Long Chen

Publication date 13 December 2024

Full work available at URL https://doi.org/10.1007/978-3-031-68385-5_15

zbMATH Keywords

asymmetrical statistical costsinformation-theoretic securitymulti-user securitypower bounds

Mathematics Subject Classification ID

Information theory (general) (94A15)

Recommendations

• Improved multi-user security using the squared-ratio method
• Information-theoretic indistinguishability via the chi-squared method
• Indistinguishability Amplification
• Tight security bounds for key-alternating ciphers
• Advances in Cryptology - EUROCRYPT 2004

Cites work

• A Provable-Security Treatment of the Key-Wrap Problem
• scientific article; zbMATH DE number 5009203 (Why is no real title available?)
• scientific article; zbMATH DE number 1302860 (Why is no real title available?)
• scientific article; zbMATH DE number 1303128 (Why is no real title available?)
• scientific article; zbMATH DE number 697813 (Why is no real title available?)
• scientific article; zbMATH DE number 1406792 (Why is no real title available?)
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• Improved multi-user security using the squared-ratio method
• Information-theoretic indistinguishability via the chi-squared method
• IX. On the problem of the most efficient tests of statistical hypotheses
• Key-alternating ciphers and key-length extension: exact bounds and multi-user security
• Multi-key security: the Even-Mansour construction revisited
• Proof of Mirror Theory for ξ _max = 2
• The memory-tightness of authenticated encryption
• The Multi-user Security of Double Encryption
• The query-complexity of preprocessing attacks
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• The “Coefficients H” Technique
• Tight security bounds for key-alternating ciphers

Cited in

(2)

• Improved multi-user security using the squared-ratio method
• Combining outputs of a random permutation: new constructions and tight security bounds by Fourier analysis

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

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