A Cartesian product construction for unconditionally secure authentication codes that permit arbitration

DOI10.1007/BF00204449zbMath0701.94008WikidataQ105989053 ScholiaQ105989053MaRDI QIDQ914647

Gustavus J. Simmons

Publication date: 1990

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

zbMATH Keywords

unconditional securityauthentication codesarbitration

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (14)

Arbitrated unconditionally secure authentication scheme with multi-senders ⋮ Three constructions of perfect authentication codes from projective geometry over finite fields ⋮ GOB designs for authentication codes with arbitration ⋮ Authentication codes for nontrusting parties obtained from rank metric codes ⋮ Combinatorial bounds and characterizations of splitting authentication codes ⋮ New bound for affine resolvable designs and its application to authentication codes ⋮ New combinatorial designs and their applications to authentication codes and secret sharing schemes. ⋮ New bounds and constructions for authentication/secrecy codes with splitting ⋮ Some new classes of 2-fold optimal or perfect splitting authentication codes ⋮ Construction of Cartesian authentication codes from unitary geometry ⋮ Further results on the existence of splitting BIBDs and application to authentication codes ⋮ A new class of optimal 3-splitting authentication codes ⋮ Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment ⋮ Further results on asymmetric authentication schemes

Cites Work

• Finite nets. II: Uniqueness and imbedding
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Authentication Theory/Coding Theory
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A modification of the RSA public-key encryption procedure (Corresp.)
• A method for obtaining digital signatures and public-key cryptosystems
• Codes Which Detect Deception
• Message Authentication with Arbitration of Transmitter/Receiver Disputes
• Finite Nets, I. Numerical Invariants
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Cartesian product construction for unconditionally secure authentication codes that permit arbitration