The combinatorics of authentication and secrecy codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4172989 (Why is no real title available?)
- scientific article; zbMATH DE number 3856985 (Why is no real title available?)
- scientific article; zbMATH DE number 4210147 (Why is no real title available?)
- scientific article; zbMATH DE number 3908438 (Why is no real title available?)
- scientific article; zbMATH DE number 4053509 (Why is no real title available?)
- scientific article; zbMATH DE number 4070794 (Why is no real title available?)
- scientific article; zbMATH DE number 3715579 (Why is no real title available?)
- scientific article; zbMATH DE number 3893245 (Why is no real title available?)
- scientific article; zbMATH DE number 3895109 (Why is no real title available?)
- A class of three-designs
- A construction for authentication/secrecy codes from 3-homogeneous permutation groups
- A method for obtaining digital signatures and public-key cryptosystems
- Authentication Theory/Coding Theory
- Codes Which Detect Deception
- Communication Theory of Secrecy Systems*
- Ein elementarer und konstruktiver Beweis für die Zerlegungsgleichheit der Hill'schen Tetraeder mit einem Quader. (An elementary and constructive proof for the equivalence by dissection of the Hill tetrahedra with a rectangular parallelepipedon)
- Some constructions and bounds for authentication codes
- Steiner pentagon systems
- The Practice of Authentication
Cited in
(57)- scientific article; zbMATH DE number 7310202 (Why is no real title available?)
- scientific article; zbMATH DE number 2100047 (Why is no real title available?)
- scientific article; zbMATH DE number 1024097 (Why is no real title available?)
- Bounds And Constructions For Threshold Shared Generation Of Authenticators
- Authentication codes for nontrusting parties obtained from rank metric codes
- The uniformly 3-homogeneous subsets of PGL\((2,q)\)
- Authentication codes and bipartite graphs
- The combinatorial complexity of masterkeying
- Construction of authentication codes based on orthogonal array and Latin square
- Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes
- Isomorphism classes of authentication codes
- Combinatorial characterizations of authentication codes
- On the construction of authentication and secrecy codes
- On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
- A lower bound on authentication after having observed a sequence of messages
- Mosaics of combinatorial designs for information-theoretic security
- scientific article; zbMATH DE number 4057437 (Why is no real title available?)
- A family of perpendicular arrays achieving perfect 4-fold secrecy
- Quantum authentication with key recycling
- Information-theoretic bounds for authentication codes and block designs
- scientific article; zbMATH DE number 4168392 (Why is no real title available?)
- Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\).
- Cartesian authentication codes from functions with optimal nonlinearity.
- Incidence structures applied to cryptography
- Halving \(\mathrm{PGL}(2,2^f)\), \(f\) odd: a series of cryptocodes
- New bounds and constructions for authentication/secrecy codes with splitting
- The combinatorics of generalised cumulative arrays
- Some highly symmetric authentication perpendicular arrays
- Subspaces in \(d\)-bounded distance-regular graphs and their applications
- On ``the power of verification queries in unconditionally secure message authentication
- Information-theoretic bounds for authentication schemes
- Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields
- A class of authentication codes with secrecy
- GOB designs for authentication codes with arbitration
- scientific article; zbMATH DE number 176540 (Why is no real title available?)
- A TWOOA construction for multi-receiver multi-message authentication codes
- Authentication codes in plaintext and chosen-content attacks
- Universal hashing and authentication codes
- Authentication codes and combinatorial designs.
- Algebraic manipulation detection codes
- Combinatorial bounds and characterizations of splitting authentication codes
- A construction for authentication/secrecy codes from certain combinatorial designs
- Коды аутентификации с секретностью (обзор)
- Combinatorial designs for authentication and secrecy codes
- Combinatorial designs and cryptography, revisited
- scientific article; zbMATH DE number 5204734 (Why is no real title available?)
- Association schemes based on singular symplectic geometry over finite fields and its application
- Broadcast authentication for group communication
- Multireceiver authentication codes: Models, bounds, constructions, and extensions
- A note on error-correcting codes for authentication and subliminal channels
- Combinational constructions of splitting authentication codes with perfect secrecy
- A construction for optimal \(c\)-splitting authentication and secrecy codes
- Construction of 2-designs
- On the equivalence of authentication codes and robust (2, 2)-threshold schemes
- Large sets with multiplicity
- Combinatorial classification of optimal authentication codes with arbitration
- scientific article; zbMATH DE number 4158546 (Why is no real title available?)
This page was built for publication: The combinatorics of authentication and secrecy codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q914645)
