Open AccessAttribute-Based Identity Authentication Scheme Based on Linear Codes
Author(s) -
Zhiqiang Zhang,
Suzhen Cao,
Longbo Han,
Xueyan Liu
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1631/1/012139
Subject(s) - computer science , revocation , authentication (law) , computer security , overhead (engineering) , bottleneck , scheme (mathematics) , key (lock) , identity (music) , access control , computer network , embedded system , mathematics , mathematical analysis , physics , acoustics , operating system
In the multi-user application environment, the simple use of user private key to achieve identity authentication is too single and can not carry out fine-grained access control to users. And there is the problem of user key management, which is easy to produce system bottleneck. In order to solve the above problems, a traceable and revocable attribute-based authentication scheme is constructed based on linear codes, which divides user access rights in a fine-grained manner. The method of direct revocation is adopted in the scheme, and the cost of revocation is lower. When a key abuse occurs or the system suffers a denial of service attack, the true identity of the malicious user can be tracked based on the signature. Finally, the MBDH problem proves that the scheme meets unforgeability, and the performance comparison and numerical analysis show that the scheme has a shorter key length and less computational overhead.