Three systems for shared generation of authenticators

  • R. Safavi-Naini
Session 11
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1090)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Colin Boyd. Digital multisignatures. In Cryptography and Coding, pages 241–246. Clarendon Press, 1989.Google Scholar
  2. 2.
    B. den Boer. A simple and key-economical unconditional authentication scheme. Journal of Computer Security, 2:65–71, 1993.Google Scholar
  3. 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. 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. 5.
    H. Woll M. Tompa. How to share a secret with cheaters. Journal of Cryptology, 1:133–138, 1988.Google Scholar
  6. 6.
    J. MacWilliams and N.J. Sloane. The theory of error correcting codes. North Holland Publishing Company, 1978.Google Scholar
  7. 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. 8.
    Adi Shamir. How to share a secret. Communication of the ACM, 22:612–613, 1979.Google Scholar
  9. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • R. Safavi-Naini
    • 1
  1. 1.Department of Computer ScienceUniversity of WollongongWollongongAustralia

Personalised recommendations