A Simple Protocol for Signing Contracts

  • Oded Goldreich


An approximation protocol for signing contracts is presented. This protocol is a simplification of Even’s protocol [E] and demonstrates that the randomization in that protocol is not essential. The main advantage of the protocol is its simplicity.


Exhaustive Search Signature Scheme Secure Communication Secure Computation Computer Science Department 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [B]
    Blum, M., How to exchange (secret) keys, ACM Trans. on Computer Systems 1: 175 (1983).CrossRefGoogle Scholar
  2. [BR]
    Blum, M., and Rabin, M.O., Mail certification by randomization, in preparation.Google Scholar
  3. [E]
    Even, S., A protocol for signing contracts, TR#231, Computer Science Dept., Technion, ISRAEL (1982). Presented at Crypto 81.Google Scholar
  4. [EGL]
    Even, S., Goldreich, O., and Lempel, A., A randomized protocol for signing contracts, in: “Advances in Cryptology: Proceedings of Crypto 82, ” Chaum, D., et al., eds., Plenum Press, New York (1983).Google Scholar
  5. [EY]
    Even, S., and Yacobi, Y., Relations among public-key signature systems, TR#175, Computer Science Dept., Technion, ISRAEL (1980).Google Scholar
  6. [Me]
    Merkle, R.C., Secure communication over insecure channel, Comm. of the ACM 21: 294 (1978).CrossRefGoogle Scholar
  7. [R]
    Rabin, M.O., Digitalized signatures, in “Foundations of Secure Computation,” DeMillo, R.A., et al, eds., Academic Press, New York (1978).Google Scholar

Copyright information

© Plenum Press, New York 1984

Authors and Affiliations

  • Oded Goldreich
    • 1
  1. 1.Computer Science DepartmentTechnionHaifaIsrael

Personalised recommendations