TY - JOUR
T1 - On the security of ping-pong protocols
AU - Dolev, D.
AU - Even, S.
AU - Karp, R. M.
PY - 1982
Y1 - 1982
N2 - 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).
AB - 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).
UR - http://www.scopus.com/inward/record.url?scp=0020190170&partnerID=8YFLogxK
U2 - 10.1016/S0019-9958(82)90401-6
DO - 10.1016/S0019-9958(82)90401-6
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0020190170
SN - 0019-9958
VL - 55
SP - 57
EP - 68
JO - Information and control
JF - Information and control
IS - 1-3
ER -