Economically Optimal Variable Tag Length Message Authentication

DOI10.1007/978-3-319-70972-7_11zbMath1460.94077OpenAlexW2777325459MaRDI QIDQ5854434

Viliam Lisý, Yvo G. Desmedt, Reihaneh Safavi-Naini

Publication date: 17 March 2021

Published in: Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-70972-7_11

zbMATH Keywords

message authenticationgame complexityauthentication gameeconomics of authenticationrational adversary in cryptography

Mathematics Subject Classification ID

Mixed integer programming (90C11) Game theory (91A99) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Variants of Wegman-Carter message authentication code supporting variable tag lengths

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• \texttt{FlipIt}: the game of ``stealthy takeover
• Fair Computation with Rational Players
• Towards a Game Theoretic View of Secure Computation
• Security and Game Theory
• Efficient Rational Secret Sharing in Standard Communication Networks
• Keying Hash Functions for Message Authentication
• Rational secret sharing and multiparty computation
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Authentication Theory/Coding Theory
• Codes Which Detect Deception
• Reducibility among Combinatorial Problems
• Distributed computing meets game theory
• Cryptography and Game Theory: Designing Protocols for Exchanging Information
• The security of the cipher block chaining message authentication code

This page was built for publication: Economically Optimal Variable Tag Length Message Authentication