Premium
A novel anonymous authentication scheme without cryptography
Author(s) -
Shi Runhua,
Zhong Hong,
Huang Liusheng
Publication year - 2014
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.2606
Subject(s) - cryptosystem , computer science , scheme (mathematics) , cryptography , authentication (law) , computer security , random oracle , anonymity , message authentication code , theoretical computer science , computer network , public key cryptography , mathematics , encryption , mathematical analysis
In this paper, we present a novel anonymous authentication scheme without employing any symmetric or asymmetric cryptosystem. The security of our scheme is guaranteed by the basic theories for solving linear equations, which can ensure it is unconditionally secure. The proposed scheme is adaptable for resource‐constrained devices or wireless networks well, because it only needs to perform several scalar multiplications instead of complex cryptographic operations and takes only one round of message exchange (challenge–response) between the verification centre and the legal user. Copyright © 2012 John Wiley & Sons, Ltd.