A Simple and Unified Method of Proving Indistinguishability

DOI10.1007/11941378_23zbMATH Open1175.94115OpenAlexW2164014144MaRDI QIDQ5458286FDOQ5458286

Authors Mridul Nandi 

Publication date 11 April 2008

Published in Progress in Cryptology - INDOCRYPT 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11941378_23

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Indistinguishability Amplification
• scientific article; zbMATH DE number 2086702
• Publication:4940708
• Fast and Secure CBC-Type MAC Algorithms
• The security of the cipher block chaining message authentication code

Cited In (10)

• The exact PRF security of truncation: tight bounds for keyed sponges and truncated CBC
• Witness-indistinguishable arguments with \(\varSigma\)-protocols for bundled witness spaces and its application to global identities
• Improved security analysis for OMAC as a pseudorandom function
• On-line ciphers and the Hash-CBC constructions
• Key-alternating ciphers and key-length extension: exact bounds and multi-user security
• Improved security analysis of PMAC
• On the indifferentiability of Fugue and Luffa
• Compactness of hashing modes and efficiency beyond Merkle tree
• A measure-theoretic proof of Turing incomparability
• A note on computational indistinguishability

Uses Software

• OMAC

This page was built for publication: A Simple and Unified Method of Proving Indistinguishability

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