In the model of(k,n) multi-receiver authentication codes ( A-codes),a transmitter broadcasts a message m to nreceivers in such a way that not only an outside opponent butalso any k-1 receivers cannot cheat any other receiver.In this paper, we derive lower bounds on the cheating probabilitiesand the sizes of keys of (k,n) multi-receiver A-codes.The scheme proposed by Desmedt, Frankel and Yung meets all ourbounds with equalities. This means that our bounds are tightand their scheme is optimum. We further show a combinatorialstructure of optimum (k,n) multi-receiver A-codes.A notion of TWOOAs is introduced. A TWOOA is a pair of orthogonalarrays which satisfy a certain condition. We then prove thatan optimum (k,n) multi-receiver A-codeis equivalent to a TWOOA.
机构:
Qassim Univ, Dept Math, Coll Sci & Arts Al Rass, Buraydah 51452, Saudi Arabia
Port Said Univ, Dept Math & Stat, Fac Management Technol & Informat Syst, Port Said 42511, EgyptQassim Univ, Dept Math, Coll Sci & Arts Al Rass, Buraydah 51452, Saudi Arabia