Skip to main content
SpringerLink
Log in

Characterization of Optimal Authentication Codes with Arbitration

  • Conference paper
  • First Online:
Book cover Information Security and Privacy (ACISP 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1587))

Included in the following conference series:

Abstract

In this paper we study authentication codes with arbitration (A 2-codes). An A 2-code is called optimal if its cheating probabilities achieve their information-theoretic lower bounds, and has minimum number of keys. We give characterization of optimal A 2-codes in terms of combinatorial designs. This means that construction of optimal A 2-codes is reduced to the construction of the corresponding combinatorial structures.

Authors 1, 2 are supported by the Grant No. 19531020 of NNSF of China and the grant E47 of NSF of Guangdong. Authors 3,4 are partially supported by Australian Research Council Grant Number A49703076.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Desmedt and M. Yung, Arbitrated Unconditionally Secure Authentication Can Be Unconditionally Protected against Arbiter’s attacks, Advances in Cryptology-CRYPTO’90, 177–188 (1991).

    Google Scholar 

  2. T. Johansson, On the construction of perfect authentication codes that permit arbitration, Advances in Cryptology-Crypto’93, Lecture Notes in Computer Science 773, Springer-Verlag, 1994, 343–354.

    Google Scholar 

  3. T. Johansson, Lower bounds on the probability of deception in authentication with arbitration, IEEE Trans. Inform. Theory, Vol.40, No.5, 1994, 1573–1585.

    Article  MATH  MathSciNet  Google Scholar 

  4. Y. Li, A note on authentication codes with arbitration, Chinese Quarterly Journal of Mathematics, Vol.12, No.4, 1998, 103–106.

    Google Scholar 

  5. S. Obana and K. Kurosawa, A 2-code=affine resolvable + BIBD, First international Conference, ICICS’97, Lecture Notes in Computer Science 1334, Springer-Verlag, 1997, 130–143.

    Google Scholar 

  6. D. Pei, Information-theoretic bounds for authentication codes and block designs, J. Cryptology, Vol.8 (1995), 177–188.

    Article  MATH  MathSciNet  Google Scholar 

  7. G. J. Simmons, Message authentication with arbitration of transmitter/receiver disputes, Advances in Cryptology-Eurocrypt’87, LNCS 304, Springer-Verlag, 1988, 151–165.

    Google Scholar 

  8. G. J. Simmons, A Cartesian product construction for unconditionally secure authentication codes that permit arbitration, J. Cryptology, Vol.2 (1990), 77–104.

    Article  MATH  MathSciNet  Google Scholar 

  9. Y. Wang, Information-theoretic lower bounds for authentication codes with arbitration. Advances in Cryptology-Chinacrypt’98, Science Press, 1998, 99–104.

    Google Scholar 

  10. R. Safavi-Naini, L. Tombak, Combinatorial characterization of A-codes with r-fold security. Advances in Cryptology-Asiacrypt’94, LNCS 917, Springer-Verlag, 1995, pp 211–223.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School at Beijing of USTC, China

    Dingyi Pei

  2. Guangzhou Normal University, China

    Yuqiang Li

  3. University of Wollongong, Australia

    Yejing Wang & Rei Safavi-Naini

Authors
  1. Dingyi Pei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuqiang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yejing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rei Safavi-Naini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Technology and Computer Science, University of Wollongong, Wollongong, NSW, 2522, Australia

    Josef Pieprzyk , Rei Safavi-Naini  & Jennifer Seberry ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pei, D., Li, Y., Wang, Y., Safavi-Naini, R. (1999). Characterization of Optimal Authentication Codes with Arbitration. In: Pieprzyk, J., Safavi-Naini, R., Seberry, J. (eds) Information Security and Privacy. ACISP 1999. Lecture Notes in Computer Science, vol 1587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48970-3_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-48970-3_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65756-9

  • Online ISBN: 978-3-540-48970-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation