General lower bounds for chosen-content attacks against authentication codes

DOI10.1080/09720529.1998.10697865zbMath0915.94007OpenAlexW1997919840MaRDI QIDQ4223765

Cristiano Crevato, Andrea Sgarro

Publication date: 29 June 1999

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.1998.10697865

zbMATH Keywords

boundsauthenticationchosen-content attackfraud schemes

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Blind coding: authentication frauds from the point of view of rate-distortion theory

Cites Work

• A lower bound on authentication after having observed a sequence of messages
• One-way permutation on a family of surfaces.
• Authentication codes in plaintext and chosen-content attacks
• Codes Which Detect Deception

This page was built for publication: General lower bounds for chosen-content attacks against authentication codes