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. An O(n3) algorithm which determines the security of a given protocol (of length n) is presented. This is an improvement of the algorithm of Dolev and Yao (IEEE Trans. Inform. Theory IT-30 (2) (1983), 198208).
| Original language | English |
|---|---|
| Pages (from-to) | 57-68 |
| Number of pages | 12 |
| Journal | Information and control |
| Volume | 55 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - 1982 |
Fingerprint
Dive into the research topics of 'On the security of ping-pong protocols'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver