Skip to main content
SpringerLink
Log in

Three systems for shared generation of authenticators

  • Session 11
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1996)

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

Included in the following conference series:

Abstract

An authentication system with shared generation of authenticators is a system in which construction of an authentic codeword requires collaboration of an authorised group of transmitters. We propose three systems with provable unconditional security where, in two, protection may extend over multiple message transmissions. We describe the constructions, discuss their important features and prove their security properties.

Support for this project was partly provided by Australian Research Council.

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. Colin Boyd. Digital multisignatures. In Cryptography and Coding, pages 241–246. Clarendon Press, 1989.

    Google Scholar 

  2. B. den Boer. A simple and key-economical unconditional authentication scheme. Journal of Computer Security, 2:65–71, 1993.

    Google Scholar 

  3. Y. Desmedt. Society and group oriented cryptography: a new concept. In Advances in Cryptology-Crypto '87, number 293 in Lecture Notes in Computer Science, pages 120–127. Springer Verlag, 1988.

    Google Scholar 

  4. Yvo Desmedt and Yair Frankel. Shared generation of authenticators and signatures. In Advances in Cryptology-Crypto '91, number 576 in Lecture Notes in Computer Science, pages 457–469. Springer Verlag, 1991.

    Google Scholar 

  5. H. Woll M. Tompa. How to share a secret with cheaters. Journal of Cryptology, 1:133–138, 1988.

    Google Scholar 

  6. J. MacWilliams and N.J. Sloane. The theory of error correcting codes. North Holland Publishing Company, 1978.

    Google Scholar 

  7. L. Tombak R. Safavi-Naini. Combinatorial characterization of A-codes with r-fold security. In Advances in Cryptology-Asiacrypt '94, number 917 in Lecture Notes in Computer Science, pages 211–223. Springer Verlag, 1995.

    Google Scholar 

  8. Adi Shamir. How to share a secret. Communication of the ACM, 22:612–613, 1979.

    Google Scholar 

  9. G. Kabatianskii T. Johansson, B. Smeets. On the relation between A-codes and codes correcting independent errors. In Advances in Cryptology-Eurocrypt '93, number 765 in Lecture Notes in Computer Science, pages 1–11. Springer Verlag, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Wollongong, Northfields Ave., 2522, Wollongong, Australia

    R. Safavi-Naini

Authors
  1. R. Safavi-Naini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jin-Yi Cai Chak Kuen Wong

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Safavi-Naini, R. (1996). Three systems for shared generation of authenticators. In: Cai, JY., Wong, C.K. (eds) Computing and Combinatorics. COCOON 1996. Lecture Notes in Computer Science, vol 1090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61332-3_174

Download citation

  • DOI: https://doi.org/10.1007/3-540-61332-3_174

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-68461-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation