Lower bound on linear authenticated encryption

DOI10.1007/B96837MaRDI QIDQ5713970zbMATH OpenOpenAlexFDO

Authors C. S. Jutla

Publication date 27 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Encryption modes with almost free message integrity
• Encryption modes with almost free message integrity
• Authenticated encryption: relations among notions and analysis of the generic composition paradigm
• Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
• The memory-tightness of authenticated encryption

Cited in

(7)

• Encryption modes with almost free message integrity
• On the optimality of non-linear computations for symmetric key primitives
• IBE Under k-LIN with Shorter Ciphertexts and Private Keys
• Нижние оценки для практической секретности ключа
• scientific article; zbMATH DE number 6862149 (Why is no real title available?)
• Linear authentication codes: bounds and constructions
• Lower Bounds in the Hardware Token Model

This page was built for publication: Lower bound on linear authenticated encryption

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