Codes for interactive authentication

DOI10.1007/3-540-48329-2_30MaRDI QIDQ4341761zbMATH OpenOpenAlexFDO

Authors Moni Naor, Peter S. Gemmell

Publication date 17 September 1997

Published in Advances in Cryptology — CRYPTO’ 93 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48329-2_30

zbMATH Keywords

authentication protocolnon-constructive random codessingle-round protocol

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
• Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
• Multiround unconditionally secure authentication
• scientific article; zbMATH DE number 1676640

Cited in

(10)

• Codes for strong identification
• scientific article; zbMATH DE number 1676640 (Why is no real title available?)
• Information-theoretically secure entity authentication in the multi-user setting
• Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
• Fast message authentication using efficient polynomial evaluation
• Efficient network authentication protocols: lower bounds and optimal implementations
• scientific article; zbMATH DE number 5027117 (Why is no real title available?)
• Fast interactive coding against adversarial noise
• Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
• HELP: everlasting privacy through server-aided randomness

This page was built for publication: Codes for interactive authentication

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