Bounds and constructions for A3-code with multi-senders
- Cite this paper as:
- Safavi-Naini R., Wang Y. (1998) Bounds and constructions for A3-code with multi-senders. In: Boyd C., Dawson E. (eds) Information Security and Privacy. ACISP 1998. Lecture Notes in Computer Science, vol 1438. Springer, Berlin, Heidelberg
We extend authentication codes with arbiter to the scenario where there are multiple senders and none of the participants, including the arbiter, is trusted. In this paper we derive bounds on the probability of success of attackers in impersonation and substitution attack, and give constructions of codes that satisfy the bounds with equality.
Unable to display preview. Download preview PDF.