Proof of Mirror Theory for ξ max = 2

DOI10.1109/TIT.2022.3171178MaRDI QIDQ5040016zbMATH OpenOpenAlexFDO

Authors Avijit Dutta, Mridul Nandi, Abishanka Saha

Publication date 11 October 2022

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2022.3171178

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Cited in

(16)

• XOCB: beyond-birthday-bound secure authenticated encryption mode with rate-one computation
• Proof of mirror theory for a wide range of \(\xi_{\max }\)
• Improved multi-user security using the squared-ratio method
• Offset-based BBB-secure tweakable block-ciphers with updatable caches
• \textsf{LightMAC}: fork it and make it faster
• Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
• Information-theoretic security with asymmetries
• On the number of restricted solutions to constrained systems and their applications
• Minimizing beyond-birthday-bound secure permutation-based pseudorandom function
• Combining outputs of a random permutation: new constructions and tight security bounds by Fourier analysis
• Forking sums of permutations for highly secure and efficient PRFs
• Proving the security of the extended summation-truncation hybrid
• General practical cryptanalysis of the sum of round-reduced block ciphers and ZIP-AES
• How to build a short-input random oracle from public random permutations
• Block cipher doubling for a post-quantum world
• Sequential indifferentiability of STH and EDM

This page was built for publication: Proof of Mirror Theory for ξ _max = 2

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