Advertisement

Authentication Codes with Multiple Arbiters

Extended Abstract
  • Ernest F. Brickell
  • Doug R. Stinson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 330)

References

  1. [BGW]
    Michael Ben-Or, Shafi Goldwasser and Avi Wigderson, “Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation,” to appear in Proceedings of the 20th ACM Symposium on the Theory of Computing. 1988.Google Scholar
  2. [CCD]
    David Chaum, Claude Crepeau and Ivan Damgard “Multiparty Unconditionally Secure Protocols,” to appear in Proceedings of the 20th ACM Symposium on the Theory of Computing, 1988.Google Scholar
  3. [Sil]
    G. J. Simmons, “Message Authentication with Arbitration of Transmitter/Receiver Disputes,” to appear in Advances in Cryptology, Eurocrypt’87, Springer-Verlag, 1987.Google Scholar
  4. [Si2]
    G. J. Simmons, “A Cartesian Product Construction for Unconditionally Secure Authentication Codes that Permit Arbitration,” submitted to Journal of Cryptology.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Ernest F. Brickell
    • 1
  • Doug R. Stinson
    • 2
  1. 1.Sandia National LaboratoriesAlbuquerque
  2. 2.Dept. of Computer ScienceUniversity of ManitobaWinnipegCanada

Personalised recommendations