General lower bounds for chosen-content attacks against authentication codes

DOI10.1080/09720529.1998.10697865MaRDI QIDQ4223765zbMATH OpenOpenAlexFDO

Authors 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

authenticationboundschosen-content attackfraud schemes

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1088920
• Authentication codes in plaintext and chosen-content attacks
• A tight bound for exhaustive key search attacks against message authentication codes
• On a fallacious bound for authentication codes
• Some constructions and bounds for authentication codes
• scientific article; zbMATH DE number 4045632
• Bounds and characterizations of authentication/secrecy schemes
• Information-theoretic bounds for authentication schemes
• scientific article; zbMATH DE number 1559106
• Information-theoretic bounds for authentication codes and block designs

Cites work

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

Cited in

(3)

• Authentication codes in plaintext and chosen-content attacks
• Blind coding: authentication frauds from the point of view of rate-distortion theory
• scientific article; zbMATH DE number 1088920 (Why is no real title available?)

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

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