Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models

DOI10.1109/TIT.2008.921691MaRDI QIDQ3604460zbMATH OpenOpenAlexFDO

Authors

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2008.921691

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
• Practical unconditionally secure two-channel message authentication
• New results on unconditionally secure multi-receiver manual authentication
• Codes for Interactive Authentication
• Multiround unconditionally secure authentication

Cited in

(10)

• On ``the power of verification queries in unconditionally secure message authentication
• Practical unconditionally secure two-channel message authentication
• The power of primes: security of authentication based on a universal hash-function family
• Fast interactive coding against adversarial noise
• The security of lazy users in out-of-band authentication
• Out-of-band authentication in group messaging: computational, statistical, optimal
• New results on unconditionally secure multi-receiver manual authentication
• Efficient network authentication protocols: lower bounds and optimal implementations
• Non-interactive Manual Channel Message Authentication Based on eTCR Hash Functions
• Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models

This page was built for publication: Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models

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