Protocols with Certified-Transfer Servers

  • Raphael Yahalom
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2845)


In some circumstances a party Q may have an incentive to perform Selective Denial of Service or Selective Delay of Service to other counter-parties in a protocol. That is, Q may use information at his disposal in order to selectively discriminate against certain service requests, for his own advantage. Q’s counter-parties may not necessarily be in a position to prove such malicious behavior by Q.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anderson, R.J.: The Eternity Service. In: Proceedings of Pragocrypt 1996 (1996)Google Scholar
  2. 2.
    Asokan, N., Shoup, V., Waidner, M.: Optimistic Fair Exchange of Digital Signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 591–606. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  3. 3.
    Benaloh, J., Yung, M.: Distributing the Power of a Government to Enhance the Privacy of Voters. In: Proceedings of the 5th ACM Symposium on the Principles of Distributed Computing, pp. 52–62 (1986)Google Scholar
  4. 4.
    Chaum, D.: Security without Identification: Transaction Systems to Make Big Brother Obsolete. Communication of the ACM 28(10), 1030–1044 (1985)CrossRefGoogle Scholar
  5. 5.
    Fujioka, A., Okamoto, T., Ohta, K.: A Practical Secret Voting Scheme for Large Scale Applications. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 244–251. Springer, Heidelberg (1993)Google Scholar
  6. 6.
    Gong, L., Lomas, T.M.A., Needham, R.M., Saltzer, J.H.: Protecting poorly chosen secrets from guessing attacks. IEEE Journal on Selected Areas in Communications 11(5), 648–656 (1993)CrossRefGoogle Scholar
  7. 7.
    Lindell, Y., Lysyanskaya, A., Rabin, T.: On the Composition of Authenticated Byzantine Agreement. In: Proceedings of STOC 2002, Montreal, Canada (May 2002)Google Scholar
  8. 8.
    Mercuri, R.: The Electronic Voting Enigma: Hard Problems in Computer Science. Talk at The Cryptography and Information Security Group of MIT’s Laboratory for Computer Science (October 19, 2001)Google Scholar
  9. 9.
    Micali, S.: Certified E-mail with Invisible Post Offices. In: Talk at RSA Security Conference (1997)Google Scholar
  10. 10.
    Salanie, B.: The Economics of Contracts. MIT Press, Cambridge (1997)Google Scholar
  11. 11.
    Schneier, B.: Applied Cryptography, 2nd edn. John Wiley & Sons, Chichester (1996)Google Scholar
  12. 12.
    Yahalom, R.: Delegated Enforcement in Secure Protocols. In: 2nd Workshop on Issues in the Theory of Security, Portland, Oregon (January 2002),

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Raphael Yahalom
    • 1
  1. 1.Onaro Research 

Personalised recommendations