New bounds and constructions for authentication/secrecy codes with splitting

DOI10.1007/BF00196910zbMath0739.94010OpenAlexW2015915269MaRDI QIDQ1176594

Marijke De Soete

Publication date: 25 June 1992

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00196910

zbMATH Keywords

unconditional securityauthentication codespartial geometryauthentication model

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (13)

Lower bounds for robust secret sharing schemes ⋮ Three constructions of perfect authentication codes from projective geometry over finite fields ⋮ A construction for optimal \(c\)-splitting authentication and secrecy codes ⋮ Combinatorial bounds and characterizations of splitting authentication codes ⋮ Combinational constructions of splitting authentication codes with perfect secrecy ⋮ Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes ⋮ New combinatorial designs and their applications to authentication codes and secret sharing schemes. ⋮ Some new classes of 2-fold optimal or perfect splitting authentication codes ⋮ Combinatorial characterizations of authentication codes ⋮ A new class of splitting 3-designs ⋮ The power of primes: security of authentication based on a universal hash-function family ⋮ On the equivalence of authentication codes and robust (2, 2)-threshold schemes ⋮ On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration

Cites Work

• The combinatorics of authentication and secrecy codes
• A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
• A characterization of the partial geometry \(T^ *_ 2(K)\)
• Some constructions and bounds for authentication codes
• A construction for authentication/secrecy codes from certain combinatorial designs
• Affine resolvable balanced incomplete block designs: a survey
• Strongly regular graphs, partial geometries and partially balanced designs
• Optimal authentication systems and combinatorial designs
• Communication Theory of Secrecy Systems*
• Authentication Theory/Coding Theory
• 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: New bounds and constructions for authentication/secrecy codes with splitting