Bounds and combinatorial structure of \((k,n)\) multi-receiver \(A\)-codes

DOI10.1023/A:1008351225940zbMath0971.94006MaRDI QIDQ1841526

Satoshi Obana, Kaoru Kurosawa

Publication date: 18 February 2001

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

lower boundsorthogonal arraysauthentication codemulti-receivercheating probabilities

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

A TWOOA construction for multi-receiver multi-message authentication codes ⋮ Disjoint difference families and their applications

This page was built for publication: Bounds and combinatorial structure of \((k,n)\) multi-receiver \(A\)-codes