next up previous
Next: A Simple Protocol for Up: Graduate School (1981-83) Previous: A Randomized Protocol for

On The Security of Multi-Party Ping-Pong Protocols

This work refers to a restricted notion of insecurity (i.e., breakability under a syntactically restricted type of atttacks) and to restricted classes of protocols. The computational task of testing whether or not such protocols are insecurity is studied, and is shown to be undecidable for one of the classes and NP-hard for another.


\fbox{\begin{minipage}{40em}
{\bf Abstract ({v.o.}):} {This paper is concerned ...
...lf words'', is shown to have an
undecidable security problem.}
\end{minipage}}


Comments: Authored by S. Even and O. Goldreich. (This was the main part of my D.Sc. Thesis.) Appeared in



Oded Goldreich
2003-07-30