[pl-seminar] Reminder: talk by Anupam Datta (faculty candidate)

["Thomas Reps" <reps@xxxxxxxxxxx>]

This is a reminder that Anupam Datta http://www.stanford.edu/~danupam/
will be speaking this afternoon at 4 PM in 1221.

Tom

4:00 pm, 1221 CS (Cookies: 3:30 pm, 2310 CS)
Faculty Candidate Talk: Anupam Datta, Stanford University,  "Security
Analysis
   of Network Protocols"
   The  design  and analysis of network protocols that use cryptographic
primi-
   tives is one of the most  fundamental  and  challenging  areas  of
security
   research. In this talk, I will present logical methods for protocol
analysis
   that address two central problems in this area, significantly
advancing  the
   state-of-the-art.  The  first  is  "compositionality",  where the
goal is to
   develop methods for proving correctness of compound protocols  by
combining
   independent proofs of their components.  Composition has proved to be
a dif-
   ficult problem in security since a component  may  reveal
information  that
   does  not affect its own security but may degrade the security of
some other
   component in the system.  The second research thrust is in
developing  sym-
   bolic  methods for protocol analysis while being faithful to the
complexity-
   theoretic model of modern cryptography. This work bridges and
benefits  from
   results  in  two  research  areas  (logic  and cryptography) which
have been
   largely  independent  for  the  last  two  decades.  Our
machine-checkable
   axiomatic  proofs  do  not  involve probability and complexity.
However, the
   soundness theorem guarantees that they carry the same meaning as
traditional
   hand-proofs  done  by  cryptographers.  These methods have been
successfully
   applied to a number of network security protocols including the IEEE
802.11i
   wireless  authentication  protocol, IPSec's new key exchange protocol
IKEv2,
   and SSL/TLS --- in some cases uncovering  previously  undiscovered
attacks.
   Tool implementation efforts are also underway.