BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TN-98-78
       ENTRY:: July 7, 1998
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: A Probabilistic Poly-time Framework for Protocol Analysis
        TYPE:: Technical Note 
      AUTHOR:: Lincoln, P.
      AUTHOR:: Mitchell, J.
      AUTHOR:: Mitchell, M.
      AUTHOR:: Scedrov, A.
        DATE:: April 3, 1998
       PAGES:: 20
    ABSTRACT:: We develop a framework for analyzing security protocols
in which protocol adversaries may be arbitrary probabilistic polynomial-time 
processes.  In this framework, protocols are written in a restricted form
of pi-calculus and security may expressed as a form or observational 
equivalence, a standard relation from programming language theory that involves 
quantifying over possible environments that might interact with the protocol.
Using an asymptotic notion of probabilistic equivalence, we relate
observational equivalence to polynomial-time statistical tests and discuss
some example protocols to illustrate the potential strengths of our approach. 
       NOTES:: [Adminitrivia V1/Prg/19980612]
         END:: STAN//CS-TN-98-78