New bounds and constructions for authentication/secrecy codes with splitting

DOI10.1007/BF00196910MaRDI QIDQ1176594zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Information-theoretic bounds for authentication codes and block designs
• The Practice of Authentication
• Authentication Theory/Coding Theory
• scientific article; zbMATH DE number 67089

Cites work

• scientific article; zbMATH DE number 3884175 (Why is no real title available?)
• scientific article; zbMATH DE number 3856985 (Why is no real title available?)
• scientific article; zbMATH DE number 3877205 (Why is no real title available?)
• scientific article; zbMATH DE number 3908438 (Why is no real title available?)
• scientific article; zbMATH DE number 4070794 (Why is no real title available?)
• scientific article; zbMATH DE number 3651315 (Why is no real title available?)
• scientific article; zbMATH DE number 3893212 (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 Cartesian product construction for unconditionally secure authentication codes that permit arbitration
• A characterization of the partial geometry \(T^ *_ 2(K)\)
• A construction for authentication/secrecy codes from certain combinatorial designs
• Affine resolvable balanced incomplete block designs: a survey
• Authentication Theory/Coding Theory
• Codes Which Detect Deception
• Communication Theory of Secrecy Systems*
• Optimal authentication systems and combinatorial designs
• Some constructions and bounds for authentication codes
• Strongly regular graphs, partial geometries and partially balanced designs
• The combinatorics of authentication and secrecy codes

Cited in

(21)

• Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes
• Combinatorial characterizations of authentication codes
• On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
• A lower bound on authentication after having observed a sequence of messages
• Codes Which Detect Deception
• Lower bounds for robust secret sharing schemes
• Information-theoretic bounds for authentication codes and block designs
• Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order
• Authentication Codes in the Query Model
• A new class of splitting 3-designs
• New combinatorial designs and their applications to authentication codes and secret sharing schemes.
• Combinatorial bounds and characterizations of splitting authentication codes
• The power of primes: security of authentication based on a universal hash-function family
• scientific article; zbMATH DE number 67089 (Why is no real title available?)
• Combinatorial Constructions for Optimal Splitting Authentication Codes
• scientific article; zbMATH DE number 5732575 (Why is no real title available?)
• Some new classes of 2-fold optimal or perfect splitting authentication codes
• Combinational constructions of splitting authentication codes with perfect secrecy
• Three constructions of perfect authentication codes from projective geometry over finite fields
• A construction for optimal \(c\)-splitting authentication and secrecy codes
• On the equivalence of authentication codes and robust (2, 2)-threshold schemes

This page was built for publication: New bounds and constructions for authentication/secrecy codes with splitting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176594)