Efficient network authentication protocols: lower bounds and optimal implementations

DOI10.1007/S004460050015MaRDI QIDQ5137012zbMATH OpenOpenAlexFDO

Authors 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

authenticationkey distributionlower boundoptimal protocalprotocol metrics

Mathematics Subject Classification ID

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

Recommendations

• Protocols for authentification and key establishment
• Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
• Codes for Interactive Authentication
• scientific article; zbMATH DE number 1775427
• Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• scientific article; zbMATH DE number 3521895 (Why is no real title available?)
• New directions in cryptography
• The geometrical meaning of time
• Using encryption for authentication in large networks of computers

Cited in

(6)

• A novel quantum dragonfly multi-key exchange protocol beyond conventional attacks
• Towards secure quantum key distribution protocol for wireless LANs: a hybrid approach
• scientific article; zbMATH DE number 6531439 (Why is no real title available?)
• Enhancing the security of password authenticated key agreement protocols based on chaotic maps
• Efficient reliable communication over partially authenticated networks
• Simple password-based three-party authenticated key exchange without server public keys

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137012)