The combinatorics of authentication and secrecy codes
From MaRDI portal
Publication:914645
DOI10.1007/BF02252868zbMath0701.94006MaRDI QIDQ914645
Publication date: 1990
Published in: Journal of Cryptology (Search for Journal in Brave)
combinatorial designscombinatorics of unconditionally secure secrecy and authentication codesencoding rules
Related Items (40)
ON "THE POWER OF VERIFICATION QUERIES" IN UNCONDITIONALLY SECURE MESSAGE AUTHENTICATION ⋮ Universal hashing and authentication codes ⋮ Bounds And Constructions For Threshold Shared Generation Of Authenticators ⋮ Construction of authentication codes based on orthogonal array and Latin square ⋮ GOB designs for authentication codes with arbitration ⋮ Information-theoretic bounds for authentication codes and block designs ⋮ A construction for optimal \(c\)-splitting authentication and secrecy codes ⋮ Authentication codes for nontrusting parties obtained from rank metric codes ⋮ Isomorphism classes of authentication codes ⋮ Authentication codes in plaintext and chosen-content attacks ⋮ Combinatorial bounds and characterizations of splitting authentication codes ⋮ Combinational constructions of splitting authentication codes with perfect secrecy ⋮ Association schemes based on singular symplectic geometry over finite fields and its application ⋮ Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes ⋮ Cartesian authentication codes from functions with optimal nonlinearity. ⋮ Subspaces in \(d\)-bounded distance-regular graphs and their applications ⋮ A TWOOA construction for multi-receiver multi-message authentication codes ⋮ Algebraic manipulation detection codes ⋮ Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields ⋮ Information-theoretic bounds for authentication schemes ⋮ Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\). ⋮ New bounds and constructions for authentication/secrecy codes with splitting ⋮ Authentication codes and bipartite graphs ⋮ Halving \(\mathrm{PGL}(2,2^f)\), \(f\) odd: a series of cryptocodes ⋮ Some highly symmetric authentication perpendicular arrays ⋮ Incidence structures applied to cryptography ⋮ Combinatorial characterizations of authentication codes ⋮ Broadcast authentication for group communication ⋮ On the equivalence of authentication codes and robust (2, 2)-threshold schemes ⋮ Large sets with multiplicity ⋮ The uniformly 3-homogeneous subsets of PGL\((2,q)\) ⋮ On the construction of authentication and secrecy codes ⋮ Коды аутентификации с секретностью (обзор) ⋮ Construction of 2-designs ⋮ On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration ⋮ Unnamed Item ⋮ Multireceiver authentication codes: Models, bounds, constructions, and extensions ⋮ A lower bound on authentication after having observed a sequence of messages ⋮ Quantum Authentication with Key Recycling ⋮ A family of perpendicular arrays achieving perfect 4-fold secrecy
Cites Work
- Steiner pentagon systems
- A construction for authentication/secrecy codes from 3-homogeneous permutation groups
- 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
- A class of three-designs
- Communication Theory of Secrecy Systems*
- Authentication Theory/Coding Theory
- The Practice of Authentication
- A method for obtaining digital signatures and public-key cryptosystems
- Codes Which Detect Deception
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The combinatorics of authentication and secrecy codes
