Multi-key authenticated encryption with corruptions: reductions are lossy

DOI10.1007/978-3-319-70500-2_14zbMath1410.94083OpenAlexW2730189116MaRDI QIDQ1690202

Tibor Jager, Ryan Stanley-Oakes, Martijn Stam, Bogdan Warinschi

Publication date: 19 January 2018

Full work available at URL: https://eprint.iacr.org/2017/495

zbMATH Keywords

tightnessreductionsencryptioncorruptionmulti-key

Mathematics Subject Classification ID

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

Related Items (7)

Tightness subtleties for multi-user PKE notions ⋮ On fingerprinting attacks and length-hiding encryption ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ Flexible password-based encryption: securing cloud storage and provably resisting partitioning-oracle attacks ⋮ Almost tight multi-user security under adaptive corruptions \& leakages in the standard model ⋮ Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness ⋮ On the adaptive security of MACs and PRFs

This page was built for publication: Multi-key authenticated encryption with corruptions: reductions are lossy