Provably Secure Anonymous Single-Sign-On Authentication Mechanisms Using Extended Chebyshev Chaotic Maps for Distributed Computer Networks

Single-sign-on authentication mechanisms enable a legal user to access various service providers efficiently and conveniently by using a unitary token. These mechanisms are widely used in distributed computer networks. This investigation proposes an efficient and secure single-sign-on authentication scheme that uses extended chaotic maps, exhibits operations that satisfy the semigroup property and commutative under composition, and has a higher efficiency than modular exponential computations and scalar multiplications on the elliptic curve. The session key security of the proposed scheme is based on Chebyshev chaotic-map-based assumptions, and the scheme is proven to be secure using the real-or-random model. The proposed authentication scheme retains the security properties of earlier schemes, requires fewer transmissions, has a lower computational cost, and uses fewer variables; it is therefore efficient in computation and communication.