Concrete Security for Entity Recognition: The Jane Doe Protocol

DOI10.1007/978-3-540-89754-5_13MaRDI QIDQ5504620zbMATH OpenOpenAlexFDO

Authors Stefan Lucks, Erik Zenner, André Weimerskirch, Dirk Westhoff

Publication date 22 January 2009

Published in Progress in Cryptology - INDOCRYPT 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89754-5_13

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• A provably secure, lightweight protocol for anonymous authentication
• scientific article; zbMATH DE number 1024060
• A protocol for provably secure authentication of a tiny entity to a high performance computing one
• Principles for entity authentication
• Parallel and concurrent security of the HB and \(HB^{+}\) protocols

Cites work

• Almost optimal hash sequence traversal
• Concrete Security for Entity Recognition: The Jane Doe Protocol
• Cryptography and Coding
• scientific article; zbMATH DE number 1024060 (Why is no real title available?)
• On the security of public key protocols
• Selected Areas in Cryptography

Cited in

(3)

• On message recognition protocols: recoverability and explicit confirmation
• scientific article; zbMATH DE number 7113026 (Why is no real title available?)
• Concrete Security for Entity Recognition: The Jane Doe Protocol

This page was built for publication: Concrete Security for Entity Recognition: The Jane Doe Protocol

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