A Simple and Unified Method of Proving Indistinguishability
From MaRDI portal
Publication:5458286
DOI10.1007/11941378_23zbMath1175.94115OpenAlexW2164014144MaRDI QIDQ5458286
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
Related Items (7)
The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC ⋮ Improved security analysis for OMAC as a pseudorandom function ⋮ On-line ciphers and the Hash-CBC constructions ⋮ Improved security analysis of PMAC ⋮ On the Indifferentiability of Fugue and Luffa ⋮ Compactness of hashing modes and efficiency beyond Merkle tree ⋮ Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
Uses Software
This page was built for publication: A Simple and Unified Method of Proving Indistinguishability