Authentication codes with perfect protection

DOI10.1007/3-540-57220-1_48MaRDI QIDQ4341668zbMATH OpenFDO

Authors L. M. Tombak, Reihaneh Safavi-Naini

Publication date 10 August 1997

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

Full work available at URL https://doi.org/10.1007/3-540-57220-1_48

zbMATH Keywords

authentication codeslower boundperfect protectionprobability of deception

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Authentication codes under impersonation attack
• Authentication codes in plaintext and chosen-content attacks
• Authentication codes: an area where coding and cryptology meet
• Authentication codes in plaintext and chosen-content attacks
• Three constructions of authentication codes with perfect secrecy

Cited in

(8)

• On a fallacious bound for authentication codes
• Authentication codes in plaintext and chosen-content attacks
• scientific article; zbMATH DE number 67089 (Why is no real title available?)
• scientific article; zbMATH DE number 493093 (Why is no real title available?)
• Bounds on the probability of deception in multiple authentication
• Authentication codes under impersonation attack
• scientific article; zbMATH DE number 1153455 (Why is no real title available?)
• Optimal authentication systems

This page was built for publication: Authentication codes with perfect protection

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