Bounds and constructions for A3-code with multi-senders

  • Rei Safavi-Naini
  • Yejing Wang
Conference paper

DOI: 10.1007/BFb0053730

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1438)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

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

Personalised recommendations