Authentication codes in plaintext and chosen-content attacks

DOI10.1007/BF00125077zbMath0853.94018MaRDI QIDQ1910424

Reihaneh Safavi-Naini, L. M. Tombak

Publication date: 14 January 1997

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

authentication codeschosen-content attackscodes with perfect protectioninformation theoretic bounds

Mathematics Subject Classification ID

Cryptography (94A60) Information theory (general) (94A15)

Related Items (1)

General lower bounds for chosen-content attacks against authentication codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The combinatorics of authentication and secrecy codes
• Some constructions and bounds for authentication codes
• A lower bound on authentication after having observed a sequence of messages
• Communication Theory of Secrecy Systems*
• Authentication Theory/Coding Theory
• Theory of perpendicular arrays

This page was built for publication: Authentication codes in plaintext and chosen-content attacks