MPI-INF Logo
Campus Event Calendar

Event Entry

New for: D1, D2, D3, D4, D5

What and Who

Active Intruders with Caps

Christopher Lynch
Department of Math and Computer Science, Clarkson University, Potsdam, NY
Talk
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, RG2  
AG Audience
English

Date, Time and Location

Wednesday, 6 August 2008
10:00
30 Minutes
E1 4
Rotunda, 6th floor
Saarbrücken

Abstract

We address the insecurity problem for cryptographic protocols, for an
active intruder and a bounded number of sessions. By modeling the
intruder abilities as an equational theory, the problem of active
intrusion is formulated as a Cap Unification problem. Cap Unification
is an extension of Equational Unification: we look for a cap to be
placed on a given set of terms, so that it unifies with a given term
modulo the equational theory. We give a decision procedure for Cap
Unification when the equational theory represents the traditional
Dolev Yao abilities, with some additional assumptions satisfied by usual
protocols. In addition, we try to extend our result to the case of
Homomorphic Encryption. We give an algorithm solving the
E-unification problem for the theory of Homomorphic Encryption, and we
discuss how this could be extended to Cap Unification.

Contact

Roxane Wetzel
900
--email hidden
passcode not visible
logged in users only

Roxane Wetzel, 08/06/2008 15:11 -- Created document.