Authentication codes in plaintext and chosen-content attacks

DOI10.1007/BF00125077MaRDI QIDQ1910424zbMATH OpenFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 1088920
• General lower bounds for chosen-content attacks against authentication codes
• scientific article; zbMATH DE number 1023997
• scientific article; zbMATH DE number 1023995

Cites work

• scientific article; zbMATH DE number 3856985 (Why is no real title available?)
• scientific article; zbMATH DE number 53885 (Why is no real title available?)
• scientific article; zbMATH DE number 176540 (Why is no real title available?)
• scientific article; zbMATH DE number 503361 (Why is no real title available?)
• scientific article; zbMATH DE number 1394290 (Why is no real title available?)
• A lower bound on authentication after having observed a sequence of messages
• Authentication Theory/Coding Theory
• Communication Theory of Secrecy Systems*
• Some constructions and bounds for authentication codes
• The combinatorics of authentication and secrecy codes
• Theory of perpendicular arrays

Cited in

(4)

• Codes Which Detect Deception
• Authentication encryption based on authentication code with secrecy
• General lower bounds for chosen-content attacks against authentication codes
• Authentication With Distortion Criteria

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

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