On the experimental estimation of the lower bound for the maximum number of messages in a scheme aimed at data protection against spoofing

zbMATH Open1382.94174MaRDI QIDQ2809152FDOQ2809152

Authors: Yury O. Gazaryan, Yury V. Kosolapov 

Publication date: 27 May 2016

Published in: Vychislitel'nye Tekhnologii (Search for Journal in Brave)

Full work available at URL: http://www.ict.nsc.ru/jct/annotation/1702?l=eng

Recommendations

• A lower bound on authentication after having observed a sequence of messages
• Authentication theory and hypothesis testing
• scientific article; zbMATH DE number 1153455
• Information-theoretic bounds for authentication schemes
• scientific article; zbMATH DE number 177042

zbMATH Keywords

code noisingmultiple partial interceptionprotection from spoofing messages

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cited In (1)

• A method of protected distribution of data among unreliable and untrusted nodes

This page was built for publication: On the experimental estimation of the lower bound for the maximum number of messages in a scheme aimed at data protection against spoofing

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