Bounds and constructions for A3-code with multi-senders

  • Rei Safavi-Naini
  • Yejing Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1438)


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.

Unable to display preview. Download preview PDF.


  1. 1.
    Y. Desmedt and Y.Frankel, Shared Generation of Authenticators and Signatures, Advances in Cryptology-Crypto'91, Lecture Notes in Computer Science, 576,(1992),457–469.MATHGoogle Scholar
  2. 2.
    Tzonelih Hwang and Chih-Hung Wang, Arbitrated Unconditionally Sucure Authentication Scheme with Multi-senders, Information Security Workshop (1997), 173–180.Google Scholar
  3. 3.
    T.Johansson, Contributions to Unconditionally Secure Authentication, Ph.D Thesis, 1994.Google Scholar
  4. 4.
    K. M. Martin and R. Safavi-Naini, Unconditionally Secure Authentication Systems with Shared Generation of Authenticators, Information and Communications Security, Lecture Notes in Computer Science 1334, (1997), 130–143.MATHCrossRefGoogle Scholar
  5. 5.
    F.J.Mac Williams and N.J.A.Sloane, The Theory of Error-Correcting Codes, North-Holland Publishing Company (1978).Google Scholar
  6. 6.
    R.Taylor, Near Optimal Unconditionally Secure Authentication, Advances in Cryptology-Crypto'94, Lecture Notes in Computer Science, 245–255.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Rei Safavi-Naini
    • 1
  • Yejing Wang
    • 1
  1. 1.School of IT and CSUniversity of WollongongWollongongAustralia

Personalised recommendations