Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited
From MaRDI portal
Publication:3577962
DOI10.1007/978-3-642-13858-4_14zbMATH Open1279.94141OpenAlexW1895415033MaRDI QIDQ3577962FDOQ3577962
Peng Wang, Lei Zhang, Bo Liang, Wenling Wu, Liting Zhang, Shuang Wu
Publication date: 13 July 2010
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13858-4_14
Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Cited In (3)
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC π π
- A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs π π
- Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations π π
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs π π
- Blockcipher-based MACs: beyond the birthday bound without message length π π
- $\mathcal{E}$ -MACs: Towards More Secure and More Efficient Constructions of Secure Channels π π
This page was built for publication: Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3577962)