Near optimal unconditionally secure authentication

DOI10.1007/BFB0053440MaRDI QIDQ4365744zbMATH OpenFDO

Authors Richard Taylor

Publication date 26 January 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0053440

zbMATH Keywords

arbitrationauthentication scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Practical proven secure authentication with arbitration
• Multiround unconditionally secure authentication
• Arbitrated unconditionally secure authentication scheme with multi-senders
• Authentication codes: an area where coding and cryptology meet

Cited in

(25)

• Multiround unconditionally secure authentication
• Efficient authentication from hard learning problems
• Further results on asymmetric authentication schemes
• The circulant hash revisited
• No-leak authentication by the Sherlock Holmes method
• Arbitrated unconditionally secure authentication scheme with multi-senders
• On weak keys and forgery attacks against polynomial-based MAC schemes
• Efficient Authentication from Hard Learning Problems
• Efficiency considerations in unconditionally secure communication by public discussion
• Universal hashing and multiple authentication
• Distance-Avoiding Sequences for Extremely Low-Bandwidth Authentication
• Commitment and authentication systems
• scientific article; zbMATH DE number 1304300 (Why is no real title available?)
• Multisender authentication systems with unconditional security
• scientific article; zbMATH DE number 1504674 (Why is no real title available?)
• Message authentication with arbitration of transmitter/receiver disputes
• Progress in Cryptology - INDOCRYPT 2004
• Economically optimal variable tag length message authentication
• Topics in Cryptology – CT-RSA 2006
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Unconditionally secure NIZK in the fine-grained setting
• Unconditionally secure chaffing and winnowing with short authentication tags
• Non-repudiation without public-key
• On weak keys and forgery attacks against polynomial-based MAC schemes
• Practical unconditionally secure two-channel message authentication

This page was built for publication: Near optimal unconditionally secure authentication

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