Campus Event Calendar
Event Entry
New for: D3
What and Who
Formal Encryption and Pseudorandom Permutations
Peeter Laud
Seminar des Graduiertenkollegs
AG 1, AG 2, AG 3, AG 4
Expert Audience
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 12 November 2001
16:00
-- Not specified --
36 - Informatik
306
Saarbrücken
Abstract
There exists a simple, formal approach to cryptography and protocol
analysis. In this approach, the messages are just members of a free
algebra and there are certain rules how and when new messages can be
constructed and the existing ones destructed. One can also define, which
messages and protocols are equivalent. It is hoped that if one replaces
the formal message constructors (tupling, encryption, etc.) with
concrete operations, the equivalence still keeps holding. During the
last few years it has been shown that for certain formal equivalences
and certain concrete operations, this is indeed the case.
These concrete operations have had to satisfy certain cryptographic
security conditions that have been so strong that no deterministic
algorithm can satisfy them, only probabilistic ones can. This does not
fare smoothly with the traditional formal semantics that does not
distinguish different creations of the same message. Hence I think that
there is legitimate interest for a formal equivalence that remains to
hold when the formal encryption is replaced by a deterministic
algorithm.
In my talk I will present such an equivalence of messages, for which the
concrete encryption operation only has to be a pseudorandom permutation.
Alle InteressentInnen sind zu dem Vortrag herzlich eingeladen.
Contact
--email hidden
passcode not visible
logged in users only