Message authentication with arbitration of transmitter/receiver disputes

DOI10.1007/3-540-39118-5_15zbMATH Open1464.94064OpenAlexW1544221491MaRDI QIDQ5000238FDOQ5000238

Authors: Gustavus J. Simmons 

Publication date: 10 July 2021

Published in: Advances in cryptology -- EUROCRYPT '87. Workshop on the theory and application of cryptographic techniques, Amsterdam, Netherlands, April 13--15, 1987. Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-39118-5_15

Recommendations

• scientific article; zbMATH DE number 4148026
• The Practice of Authentication
• scientific article; zbMATH DE number 3856985
• Authentication theory and hypothesis testing
• scientific article; zbMATH DE number 1088919

zbMATH Keywords

authentication codeauthentication schemeauthentication protocolestablished protocolSandia National Laboratory

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Codes Which Detect Deception
• Title not available (Why is that?)
• Title not available (Why is that?)
• Authentication Theory/Coding Theory
• Title not available (Why is that?)
• Finite Nets, I. Numerical Invariants
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (16)

• On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration
• A construction for \(t\)-fold perfect authentication codes with arbitration
• A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields
• Construction of authentication codes with double arbiters over symplectic geometry
• Non-repudiation without public-key
• Limitations of humans when using malicious terminals
• Title not available (Why is that?)
• Arbitrated unconditionally secure authentication scheme with multi-senders
• Three constructions of perfect authentication codes from projective geometry over finite fields
• Construction of authentication codes based on orthogonal array and Latin square
• A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields
• A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
• Further results on asymmetric authentication schemes
• Title not available (Why is that?)
• Message authentication and dynamic passwords
• Some new classes of 2-fold optimal or perfect splitting authentication codes

This page was built for publication: Message authentication with arbitration of transmitter/receiver disputes

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