Authentication, identification and pairwise separated measures

MaRDI QIDQ1389260zbMATH OpenFDO

Authors L. A. Bassalygo, M. V. Burnashev

Publication date 8 July 1998

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

upper boundcardinalityfinite alphabetequivalence of authentication and identificationmaximum number of messagespairwise-separated-in-\(L_1\)-metrics probability measures

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Information-theoretic bounds for authentication schemes
• Authentication Theory/Coding Theory
• Measures separated in \(L_1\) metrics and ID-codes
• The Practice of Authentication

Cited in

(3)

• Efficient Authentication from Hard Learning Problems
• Efficient authentication from hard learning problems
• scientific article; zbMATH DE number 2087742 (Why is no real title available?)

This page was built for publication: Authentication, identification and pairwise separated measures

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