Skip to main content
SpringerLink
Log in

A2-code = Affine resolvable + BIBD

  • Session 4: Authentication and Identification
  • Conference paper
  • First Online:
Information and Communications Security (ICICS 1997)

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

Included in the following conference series:

Abstract

We say that an A 2-code is optimum if it has the minimum cheating probabilities and the minimum sizes of keys. We first show that an optimum A 2-code implies an affine α-resolvable design. Next, we define an affine α-resolvable + BIBD design and prove that an optimum A 2-code is equivalent to an affine α-resolvable + BIBD design.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. J. Simmons: Message authentication: a game on hypergraphs, Congresus Numerantium, Vol. 45, pp.161–192 (1984)

    Google Scholar 

  2. G. J. Simmons: Message Authentication with Arbitration of Transmitter/Receiver Disputes, Proceedings of Eurocrypt'87, Lecture Notes in Computer Science, LNCS 304, Springer Verlag, pp.150–16 (1987)

    Google Scholar 

  3. G. J. Simmons: A Cartesian Product Construction for Unconditionally Secure Authentication Codes that Permit Arbitration, Journal of Cryptology, Vol. 2, no. 2, 1990, pp. 77–104 (1990)

    Article  Google Scholar 

  4. J. L. Massey: Cryptography — a selective survey, in Digital Communications, North Holland (pub.), pp.3–21 (1986)

    Google Scholar 

  5. D. R. Stinson: The combinatorics of authentication and secrecy codes, Journal of Cryptology, Vol. 2, no. 1, 1990, pp. 23–49 (1990)

    Google Scholar 

  6. T. Johansson: Lower Bounds on the Probability of Deception in Authentication with Arbitration”, IEEE Transaction on Information Theory, Vol. 40, no. 5, pp.1573–1585 (1994)

    Article  Google Scholar 

  7. K. Kurosawa and S. Obana: Combinatorial bounds for authentication codes with arbitration, Proceedings of Eurocrypt'95, Lecture Notes in Computer Science, LNCS 921, Springer Verlag, pp.289–300 (1995)

    Google Scholar 

  8. K. Kurosawa and S. Obana: Combinatorial bounds for authentication,codes with arbitration (revised version), (1997) http://tsk-www.ss.titech.ac.jp/∼kurosaiva/97.html

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Electronic Engineering, Faculty of Engineering, Tokyo Institute of Technology, 2-12-1 O-okayama, Meguro-ku, 152, Tokyo, Japan

    Satoshi Obana & Kaoru Kurosawa

Authors
  1. Satoshi Obana
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kaoru Kurosawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Yongfei Han Tatsuaki Okamoto Sihan Qing

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag

About this paper

Cite this paper

Obana, S., Kurosawa, K. (1997). A2-code = Affine resolvable + BIBD. In: Han, Y., Okamoto, T., Qing, S. (eds) Information and Communications Security. ICICS 1997. Lecture Notes in Computer Science, vol 1334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028468

Download citation

  • DOI: https://doi.org/10.1007/BFb0028468

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63696-0

  • Online ISBN: 978-3-540-69628-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation