Bounds and constructions for A3-code with multi-senders
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.
- 2.Tzonelih Hwang and Chih-Hung Wang, Arbitrated Unconditionally Sucure Authentication Scheme with Multi-senders, Information Security Workshop (1997), 173–180.Google Scholar
- 3.T.Johansson, Contributions to Unconditionally Secure Authentication, Ph.D Thesis, 1994.Google Scholar
- 5.F.J.Mac Williams and N.J.A.Sloane, The Theory of Error-Correcting Codes, North-Holland Publishing Company (1978).Google Scholar
- 6.R.Taylor, Near Optimal Unconditionally Secure Authentication, Advances in Cryptology-Crypto'94, Lecture Notes in Computer Science, 245–255.Google Scholar