Asynchronous Group Authentication

Group authentication usually checks whether an individual user belongs to a pre-defined group each time but cannot authenticate all users at once without public key system. The paper proposes a Randomized component-based asynchronous（t, m, n） group authentication（（t, m, n）-RCAGA） scheme. In the sche...

Full description

Saved in:
Bibliographic Details
Published inChinese Journal of Electronics Vol. 26; no. 4; pp. 820 - 826
Main Authors Miao, Fuyou, Jiang, Huiwen, Ji, Yangyang, Xiong, Yan
Format Journal Article
LanguageEnglish
Published Published by the IET on behalf of the CIE 01.07.2017
Subjects
(t, n)‐threshold secret sharing
Asynchronous
Chinese remainder theorem
cryptography
Group authentication
group member
predefined group
random processes
Randomized component (RC)
randomized component‐based asynchronous group authentication
valid token
Group authentication
Asynchronous
Chinese remainder theorem
predefined group
group member
random processes
cryptography
(t, n)-threshold secret sharing
randomized component-based asynchronous group authentication
valid token
Randomized component (RC)
Online AccessGet full text

Cover

More Information
Summary:Group authentication usually checks whether an individual user belongs to a pre-defined group each time but cannot authenticate all users at once without public key system. The paper proposes a Randomized component-based asynchronous（t, m, n） group authentication（（t, m, n）-RCAGA） scheme. In the scheme, each user employs the share of（t, n）-threshold secret sharing as the token, constructs a Randomized component（RC） with the share and verifies whether all users belong to a pre-defined group at once without requiring all users to release randomized components simultaneously. The proposed scheme is simple and flexible because each group member just uses a single share as the token and the scheme does not depend on any public key system. Analyses show the proposed scheme can resist up to t-1 group members conspiring to forge a token, and an adversary is unable to forge a valid token or derive a token from a RC.
Bibliography:Randomized component（RC）; Group au thentication Chinese remainder; theorem Asynchronous
Group authentication usually checks whether an individual user belongs to a pre-defined group each time but cannot authenticate all users at once without public key system. The paper proposes a Randomized component-based asynchronous（t, m, n） group authentication（（t, m, n）-RCAGA） scheme. In the scheme, each user employs the share of（t, n）-threshold secret sharing as the token, constructs a Randomized component（RC） with the share and verifies whether all users belong to a pre-defined group at once without requiring all users to release randomized components simultaneously. The proposed scheme is simple and flexible because each group member just uses a single share as the token and the scheme does not depend on any public key system. Analyses show the proposed scheme can resist up to t-1 group members conspiring to forge a token, and an adversary is unable to forge a valid token or derive a token from a RC.
10-1284/TN
ISSN:1022-4653
2075-5597
DOI:10.1049/cje.2016.08.015