Some constructions for authentication-secrecy codes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4168392
- A construction of authentication codes with secrecy
- On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L 2
- Three constructions of authentication/secrecy codes
- Three constructions of authentication codes with perfect secrecy
Cited in
(28)- Some constructions and bounds for authentication codes
- New bounds and constructions for authentication/secrecy codes with splitting
- Combinatorial characterizations of authentication codes
- A lower bound on authentication after having observed a sequence of messages
- A shift register construction of unconditionally secure authentication codes
- Three constructions of authentication/secrecy codes
- On the construction of authentication and secrecy codes
- Information-theoretic bounds for authentication codes and block designs
- A class of authentication codes with secrecy
- Three constructions of authentication codes from power function over finite fields with perfect secrecy.
- A construction of authentication codes with secrecy
- Коды аутентификации с секретностью (обзор)
- scientific article; zbMATH DE number 4168392 (Why is no real title available?)
- scientific article; zbMATH DE number 5283673 (Why is no real title available?)
- scientific article; zbMATH DE number 4045632 (Why is no real title available?)
- Essentially \(\ell{}\)-fold secure authentication systems
- On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L 2
- Authentication, enhanced security and error correcting codes. (Extended abstract)
- Linear authentication codes: bounds and constructions
- scientific article; zbMATH DE number 2100047 (Why is no real title available?)
- scientific article; zbMATH DE number 842002 (Why is no real title available?)
- scientific article; zbMATH DE number 7310202 (Why is no real title available?)
- Description of non-endomorphic maximum perfect ciphers with two-valued plaintext alphabet
- Authentication-secrecy code based on conics over finite fields
- A construction for authentication/secrecy codes from 3-homogeneous permutation groups
- The combinatorics of authentication and secrecy codes
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
- Information-theoretic bounds for authentication schemes
This page was built for publication: Some constructions for authentication-secrecy codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3803022)