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

DOI10.1007/BF00204449MaRDI QIDQ914647zbMATH OpenWikidataFDO

Authors Gustavus J. Simmons

Publication date 1990

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

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

zbMATH Keywords

arbitrationauthentication codesunconditional security

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A method for obtaining digital signatures and public-key cryptosystems
• A modification of the RSA public-key encryption procedure (Corresp.)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Authentication Theory/Coding Theory
• Codes Which Detect Deception
• Finite Nets, I. Numerical Invariants
• Finite nets. II: Uniqueness and imbedding
• scientific article; zbMATH DE number 3856985 (Why is no real title available?)
• scientific article; zbMATH DE number 3908438 (Why is no real title available?)
• scientific article; zbMATH DE number 3943824 (Why is no real title available?)
• scientific article; zbMATH DE number 4045632 (Why is no real title available?)
• scientific article; zbMATH DE number 4053509 (Why is no real title available?)
• scientific article; zbMATH DE number 4057437 (Why is no real title available?)
• scientific article; zbMATH DE number 4070794 (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?)
• Message authentication with arbitration of transmitter/receiver disputes

Cited in

(15)

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

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

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