Unconditionally secure group authentication

DOI10.1023/A:1008261021505MaRDI QIDQ1265236zbMATH OpenOpenAlexFDO

Authors Marten van Dijk, Christian Gehrmann, Ben Smeets

Publication date 5 May 1999

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008261021505

zbMATH Keywords

authenticationgroup authenticationmaximum rank distance codessecret sharingunconditional security

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Review text

Group authentication model represents an extension of the classical authentication model where the capability to authenticate a message is given to a group instead of a single person. That means only certain subsets of a set of potential transmitters (qualified groups) are capable to authenticate a message. An obvious approach to construct a group authentication scheme seems to be a simple combination of a secret sharing scheme and an authentication scheme. However, such direct combination suffers from the fact that members of a qualified group after combining their shares get also complete knowledge of the underlying secret. In the paper the problem is solved by more careful combination of existing secret sharing scheme with authentication schemes in such a way that members of a qualified group gets only little information about the secret. First, key notions of authentication and secret sharing are briefly introduced followed by the definition of unconditionally secure group authentication (USGA) schemes. Next it is shown how an USGA scheme can be constructed using linear constructions of perfect secret sharing schemes based on a matrix approach. Finally it is shown how maximum rank distance codes can be used for constructing an USGA scheme. Ideas described there are then illustrated by an example of a construction of a threshold authentication scheme that combines Shamir's threshold scheme together with maximum rank distance codes.

Recommendations

• Unconditionally Secure Anonymous Encryption and Group Authentication
• Group Authentication
• Group authentication scheme based on zero-knowledge proof
• Authenticated key agreement in group settings
• Multiround unconditionally secure authentication
• Unconditionally-secure and reusable public-key authentication
• scientific article; zbMATH DE number 1107681

Cited in

(6)

• Three systems for threshold generation of authenticators
• Unconditionally Secure Anonymous Encryption and Group Authentication
• Bounds And Constructions For Threshold Shared Generation Of Authenticators
• Public Key Cryptography – PKC 2004
• Three systems for shared generation of authenticators
• Provably secure group authentication in the asynchronous communication model

This page was built for publication: Unconditionally secure group authentication

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