Skip to main content
SpringerLink
Log in

On the Security of Ping-Pong Protocols

  • Conference paper
Book cover Advances in Cryptology

Abstract

Consider the class of protocols, for two participants, in which the initiator applies a sequence of operators to a message M and sends it to the other participant; in each step, one of the participants applies a sequence of operators to the message received last, and sends it back. This “ping-pong” action continues several times, using sequences of operators as specified by the protocol. The set of operators may include public-key encryptions and decryptions.

We present an O(n3) algorithm which determines the security of a given protocol (of length n). This is an improvement of the algorithm of Dolev and Yao [DY].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Diffie and M. E. Hellman, “New Directions in Cryptography,” IEEE Trans. Infor. Th., Vol. IT-22, No. 6, November 1976, pp. 644–654.

    Article  Google Scholar 

  2. R. L. Rivest, A. Shamir and L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Comm. ACM, Vol. 21, February 1978, pp. 120–126.

    Article  Google Scholar 

  3. R. M. Needham and M. D. Schroeder, “Using Encryption for Authentication in Large Networks of Computers,” Comm. ACM, Vol. 21, No. 12, December 1978, pp. 993–999.

    Article  Google Scholar 

  4. D. Dolev and A. C. Yao, “On the Security of Public Key Protocols,” to appear, IEEE Trans. on IT.

    Google Scholar 

  5. B. K. Rosen, “Tree-Manipulating Systems and Church Rosser Theorems,” JACM, Vol. 20, No. 1, January 1973, pp. 160–187.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Research Lab, San Jose, CA, 95193, USA

    D. Dolev

  2. Computer Science, Technion, Haifa, Israel

    S. Even

  3. Computer Science, University of CA, Berkeley, CA, 94720, USA

    R. M. Karp

Authors
  1. D. Dolev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Even
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. M. Karp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of California, Santa Barbara, California, USA

    David Chaum

  2. Massachusetts Institute of Technology, Cambridge, Massachusetts, USA

    Ronald L. Rivest  & Alan T. Sherman  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer Science+Business Media New York

About this paper

Cite this paper

Dolev, D., Even, S., Karp, R.M. (1983). On the Security of Ping-Pong Protocols. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds) Advances in Cryptology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-0602-4_16

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-0602-4_16

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4757-0604-8

  • Online ISBN: 978-1-4757-0602-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation