On a fallacious bound for authentication codes

DOI10.1007/s001459900049zbMath0936.94012OpenAlexW2053761689WikidataQ127846185 ScholiaQ127846185MaRDI QIDQ1304974

Wakaha Ogata, Alfredo De Santis, Kaoru Kurosawa, Carlo Blundo

Publication date: 22 May 2000

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001459900049

zbMATH Keywords

authentication codessubstitution attack

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items

Lower bounds for robust secret sharing schemes ⋮ A construction for optimal \(c\)-splitting authentication and secrecy codes ⋮ Combinatorial bounds and characterizations of splitting authentication codes ⋮ Combinational constructions of splitting authentication codes with perfect secrecy ⋮ Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes ⋮ Disjoint difference families and their applications ⋮ New combinatorial designs and their applications to authentication codes and secret sharing schemes. ⋮ Some new classes of 2-fold optimal or perfect splitting authentication codes ⋮ A new class of splitting 3-designs ⋮ On the equivalence of authentication codes and robust (2, 2)-threshold schemes