Advertisement

Arbitration in Tamper Proof Systems

If DES ≈ RSA Then What’s the Difference Between True Signature and Arbitrated Signature Schemes?
  • George I. Davida
  • Brian J. Matt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 293)

Abstract

Given that tamperfree devices exist it is possible to construct true signature schemes that have the advantages of arbitrated signature schemes, protection against disavowing or forging messages, and lacking certain short commings. Other cryptographic protocols can also be improved. The contents of tamperfree devices cannot be examined as well as not modified.

Keywords

Signature Scheme Cryptographic Protocol Plain Text Message Public Directory Flag Register 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    Selim G. Akl. Digital signatures: a tutorial survey. IEEE Computer, 16(2):15–24, 1983.CrossRefGoogle Scholar
  2. [2]
    G. R. Blakley. Safeguarding cryptographic keys. In Proc. AFIPS 1979 NCC, pages 313–317, 1979.Google Scholar
  3. [3]
    George I. Davida, Richard A. DeMillo, and Richard J. Lipton. Protecting shared cryptographic keys. In Proc. 1980 Symp. on Security and Privacy, pages 100–102, IEEE, April 1980.Google Scholar
  4. [4]
    Donald W. Davies. Some regular properties of the ‘data encryption standard’. In Advances in Cryptology: Proceedings of Crypto-82, pages 89–96, 1983. Actually presented at Crypto-81.Google Scholar
  5. [5]
    Yvo Desmedt and Jean-Jacques Quisquater. Public key system based on the difficulty of tampering (is there a diffference between des and rsa?). In CRYPTO’86 Abstracts and Papers, pages 15-1–15-3, 1986.Google Scholar
  6. [6]
    W. Diffie and M. Hellman. New directions in cryptography. IEEE Trans. on Inform. Theory, 22(6):644–654, 1976.MathSciNetzbMATHCrossRefGoogle Scholar
  7. [7]
    Brian J. Matt. Seiectiuely Breakable Cyptosystems and Personal Keys. Master’s thesis, University of Wisconsin Milwaukee, May 1981.Google Scholar
  8. [8]
    Henk Meijer and Selim Akl. Digital signature schemes. Ctyptologia, 6(4):329–338, October 1982.CrossRefGoogle Scholar
  9. [9]
    R. C. Merkle. Protocols for public key cryptosystems. In Proc. 1980 Symp. on Security and Privacy, pages 122–134, IEEE, April 1980.Google Scholar
  10. [10]
    M. Rabin. Digitalized signatures. In R. A. DeMillo et al., editors, Foundations of Secure Computation, pages 155–166, 1978.Google Scholar
  11. [11]
    R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptograms. Communications of the A CM, 21(2), Feburary 1978.Google Scholar
  12. [12]
    Adi Shamir. How to share a secret. Communications of the ACM, 22(11):612–613, 1979.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • George I. Davida
    • 1
  • Brian J. Matt
    • 1
  1. 1.Electrical Engineering and Computer Science DepartmentUniversity of Wisconsin-MilwaukeeMilwaukee

Personalised recommendations