Provably secure and efficient identification and key agreement protocol with user anonymity

DOI10.1016/j.jcss.2010.07.004zbMath1210.68033OpenAlexW2070789831MaRDI QIDQ716313

Wen-Shenq Juang, Chin-Laung Lei, Ren-Chiun Wang

Publication date: 28 April 2011

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2010.07.004

zbMATH Keywords

authenticationanonymityrandom oracle modelkey agreementelliptic curve discrete logarithm problem

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Applying LU decomposition of matrices to design anonymity bilateral remote user authentication scheme

Uses Software

• EC2C-PAKA

Cites Work

• Security weakness in a three-party pairing-based protocol for password authenticated key exchange
• Security arguments for digital signatures and blind signatures
• EC2C-PAKA: an efficient client-to-client password-authenticated key agreement
• Authenticated multiple key exchange protocols based on elliptic curves and bilinear pairings
• Efficient User Authentication and Key Agreement in Ubiquitous Computing
• New directions in cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Provably secure and efficient identification and key agreement protocol with user anonymity