Date: 23 May 2006

Bounds and constructions for A3-code with multi-senders

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.