Authenticating ad hoc networks by comparison of short digests

DOI10.1016/J.IC.2007.07.010MaRDI QIDQ2482445zbMATH OpenOpenAlexFDO

Authors L. H. Nguyen, A. W. Roscoe

Publication date 16 April 2008

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://ora.ox.ac.uk/objects/uuid:3e19d041-77a8-42de-a2d0-f464a6166b75

zbMATH Keywords

authentication protocols

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• Secure Communications over Insecure Channels Based on Short Authenticated Strings
• Selected Areas in Cryptography
• scientific article; zbMATH DE number 1759664
• Certificate-free \textit{ad hoc} anonymous authentication
• Authentication protocol using an identifier in an ad hoc network environment

Cites work

• scientific article; zbMATH DE number 1617926 (Why is no real title available?)
• scientific article; zbMATH DE number 1676651 (Why is no real title available?)
• scientific article; zbMATH DE number 1722690 (Why is no real title available?)
• scientific article; zbMATH DE number 176541 (Why is no real title available?)
• scientific article; zbMATH DE number 1024060 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 1775427 (Why is no real title available?)
• scientific article; zbMATH DE number 861531 (Why is no real title available?)
• scientific article; zbMATH DE number 1406775 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• Authenticated key exchange secure against dictionary attacks
• Financial Cryptography
• New hash functions and their use in authentication and set equality
• Public Key Cryptography - PKC 2006
• Secure Communications over Insecure Channels Based on Short Authenticated Strings
• The computational complexity of universal hashing
• Topics in Cryptology – CT-RSA 2006
• Universal classes of hash functions
• Universally Composable Password-Based Key Exchange

Cited in

(11)

• Efficient Mutual Data Authentication Using Manually Authenticated Strings
• Practical unconditionally secure two-channel message authentication
• scientific article; zbMATH DE number 1759664 (Why is no real title available?)
• Digital friend-or-foe authentication
• scientific article; zbMATH DE number 1844589 (Why is no real title available?)
• Authentication protocol using an identifier in an ad hoc network environment
• Financial Cryptography
• Selected Areas in Cryptography
• Secure Communications over Insecure Channels Based on Short Authenticated Strings
• Secure node discovery in ad-hoc networks and applications
• Distance-Avoiding Sequences for Extremely Low-Bandwidth Authentication

This page was built for publication: Authenticating ad hoc networks by comparison of short digests

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