Applying semigroup property of enhanced Chebyshev polynomials to anonymous authentication protocol
type: Item
instance of: scholarly article
title: Applying semigroup property of enhanced Chebyshev polynomials to anonymous authentication protocol
zbMATH Open document ID: 1264.94100
DOI: 10.1155/2012/454823
author: Hong Lai
author: Jinghua Xiao
author: Lixiang Li
author: Yi-Xian Yang
published in: Mathematical Problems in Engineering
publication date: 2013-06-11T00:00:00Z
review text: Summary: We apply semigroup property of enhanced Chebyshev polynomials to present an anonymous authentication protocol. This paper aims at improving security and reducing computational and storage overhead. The proposed scheme not only has much lower computational complexity and cost in the initialization phase but also allows the users to choose their passwords freely. Moreover, it can provide revocation of lost or stolen smart card, which can resist man-in-the-middle attack and off-line dictionary attack together with various known attacks.
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 33C45
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6173293
Wikidata QID: Q58911676
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2012/454823
OpenAlex ID: W1976559448
cites work: A model to partly but reliably distinguish DDOS flood traffic from aggregated one
cites work: Topics in Cryptology – CT-RSA 2005
cites work: Efficient Two-Party Password-Based Key Exchange Protocols in the UC Framework
cites work: Security improvement on an anonymous key agreement protocol based on chaotic maps
cites work: An efficient and secure Diffie-Hellman key agreement protocol based on Chebyshev chaotic map
cites work: Cryptanalysis of the public key encryption based on multiple chaotic systems
description: scientific article; zbMATH DE number 6173293