Next: A Simple Protocol for
Up: Graduate School (1981-83)
Previous: A Randomized Protocol for
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.
Comments:
Authored by S. Even and O. Goldreich.
(This was the main part of my D.Sc. Thesis.) Appeared in
- Proc. of the 24th FOCS, pages 34-39, 1983.
Oded Goldreich
2003-07-30