Efficient network authentication protocols: Lower bounds and optimal implementations

DOI10.1007/s004460050015zbMath1448.68052OpenAlexW2039471385MaRDI QIDQ5137012

Li Gong

Publication date: 30 November 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004460050015

zbMATH Keywords

lower boundauthenticationkey distributionoptimal protocalprotocol metrics

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Network protocols (68M12) Computer security (68M25)

Related Items (4)

Towards secure quantum key distribution protocol for wireless LANs: a hybrid approach ⋮ A novel quantum dragonfly multi-key exchange protocol beyond conventional attacks ⋮ Enhancing the security of password authenticated key agreement protocols based on chaotic maps ⋮ Simple password-based three-party authenticated key exchange without server public keys

Cites Work

• Unnamed Item
• The geometrical meaning of time
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Using encryption for authentication in large networks of computers

This page was built for publication: Efficient network authentication protocols: Lower bounds and optimal implementations