Authentication codes in plaintext and chosen-content attacks
From MaRDI portal
Recommendations
Cites work
- A lower bound on authentication after having observed a sequence of messages
- Authentication Theory/Coding Theory
- Communication Theory of Secrecy Systems*
- 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?)
- Some constructions and bounds for authentication codes
- The combinatorics of authentication and secrecy codes
- Theory of perpendicular arrays
Cited in
(7)- Authentication With Distortion Criteria
- General lower bounds for chosen-content attacks against authentication codes
- scientific article; zbMATH DE number 1023995 (Why is no real title available?)
- scientific article; zbMATH DE number 1023997 (Why is no real title available?)
- scientific article; zbMATH DE number 1088920 (Why is no real title available?)
- Codes Which Detect Deception
- Authentication encryption based on authentication code with secrecy
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)