On the security proof of an authentication protocol from Eurocrypt 2011

DOI10.1007/978-3-319-09843-2_15MaRDI QIDQ5253640zbMATH OpenOpenAlexFDO

Authors Kosei Endo, Noboru Kunihiro

Publication date 27 May 2015

Published in Advances in Information and Computer Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09843-2_15

zbMATH Keywords

authentication protocolHB-FamilyLPN problemRFID

Mathematics Subject Classification ID

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

Recommendations

• Efficient Authentication from Hard Learning Problems
• Efficient authentication from hard learning problems
• Two-round man-in-the-middle security from LPN
• Parallel and concurrent security of the HB and \(HB^{+}\) protocols
• scientific article; zbMATH DE number 1676640

Cited in

(4)

• The security of lazy users in out-of-band authentication
• A protocol for provably secure authentication of a tiny entity to a high performance computing one
• Provable security analysis of FIDO2
• Direct proof of security of Wegman-Carter authentication with partially known key

This page was built for publication: On the security proof of an authentication protocol from Eurocrypt 2011

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