关键词: 组认证, [(t, n)]门限秘密共享, 分量

Abstract: Based on [(t,n)] threshold secret sharing, this paper proposes a simple asynchronous [(t,m,n)] group authentication scheme to verify whether all participants belong to a pre-defined group at once. In the scheme, each user uses a single share as the token. Each participant constructs a component to bind the token with all [m] participants and recovers the secret with all components to check whether all participants are legal. Moreover, the scheme does not depend on any public key system. Analyses show the proposed scheme can resist up to [t-1] insiders conspiring and outsiders with no more than [m-1] components. Compared with Harn’s group authentication scheme, the proposed scheme is simpler, more efficient and flexible.

Key words: group authentication, [(t,n)] threshold secret sharing, component