ON "THE POWER OF VERIFICATION QUERIES" IN UNCONDITIONALLY SECURE MESSAGE AUTHENTICATION

DOI10.1142/S1793830911001218zbMath1243.68178OpenAlexW2031081173MaRDI QIDQ2890985

Dongvu Tonien, Peter R. Wild, Reihaneh Safavi-Naini

Publication date: 12 June 2012

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830911001218

zbMATH Keywords

unconditional securityauthentication

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• The combinatorics of authentication and secrecy codes
• Combinatorial characterizations of authentication codes
• Universal classes of hash functions
• Codes Which Detect Deception
• The security of the cipher block chaining message authentication code

This page was built for publication: ON "THE POWER OF VERIFICATION QUERIES" IN UNCONDITIONALLY SECURE MESSAGE AUTHENTICATION