On the construction of perfect authentication codes that permit arbitration
From MaRDI portal
Recommendations
- On the construction of authentication codes that permit arbitration over projective spaces
- A construction for \(t\)-fold perfect authentication codes with arbitration
- scientific article; zbMATH DE number 6499266
- A construction of equally authentication codes with arbitration based on unitary spaces
- Characterization of optimal authentication codes with arbitration
Cited in
(15)- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- Further results on asymmetric authentication schemes
- Authentication codes for nontrusting parties obtained from rank metric codes
- On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
- Combinatorial characterisation of -optimal authentication codes with arbitration
- scientific article; zbMATH DE number 1810262 (Why is no real title available?)
- The role of arbiters in asymmetric authentication schemes
- scientific article; zbMATH DE number 6499266 (Why is no real title available?)
- A construction for \(t\)-fold perfect authentication codes with arbitration
- Lower bounds on the probability of deception in authentication with arbitration
- Practical proven secure authentication with arbitration
- scientific article; zbMATH DE number 1780080 (Why is no real title available?)
- New bound on authentication code with arbitration
- New bound for affine resolvable designs and its application to authentication codes
- Non-repudiation without public-key
This page was built for publication: On the construction of perfect authentication codes that permit arbitration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4341759)
