scientific article; zbMATH DE number 4045632
From MaRDI portal
Publication:3783202
Recommendations
- Some constructions and bounds for authentication codes
- scientific article; zbMATH DE number 4070794
- scientific article; zbMATH DE number 1302798
- scientific article; zbMATH DE number 2127882
- On the construction of authentication and secrecy codes
- scientific article; zbMATH DE number 1857521
- Linear authentication codes: bounds and constructions
- scientific article; zbMATH DE number 4057437
- A construction for authentication/secrecy codes from certain combinatorial designs
- On a fallacious bound for authentication codes
Cited in
(15)- Some constructions and bounds for authentication codes
- Combinatorial characterizations of authentication codes
- On the construction of authentication and secrecy codes
- Using an Error-Correction Code for Fast, Beyond-Birthday-Bound Authentication
- scientific article; zbMATH DE number 5846777 (Why is no real title available?)
- scientific article; zbMATH DE number 5283673 (Why is no real title available?)
- General lower bounds for chosen-content attacks against authentication codes
- scientific article; zbMATH DE number 1302854 (Why is no real title available?)
- Linear authentication codes: bounds and constructions
- scientific article; zbMATH DE number 842002 (Why is no real title available?)
- Message authentication with arbitration of transmitter/receiver disputes
- scientific article; zbMATH DE number 975409 (Why is no real title available?)
- New bound for affine resolvable designs and its application to authentication codes
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
- Authentication codes and bipartite graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783202)
