BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2007/newsitem/2054/25-
 October-2007-Logic-Tea-Simon-Kramer
DTSTAMP:20071021T000000
SUMMARY:Logic Tea, Simon Kramer
ATTENDEE;ROLE=Speaker:Simon Kramer (École Polytech
 nique)
DTSTART;TZID=Europe/Amsterdam:20071025T160000
DTEND;TZID=Europe/Amsterdam:20071025T170000
LOCATION:Room P.019, Euclides Building, Plantage M
 uidergracht 24, Amsterdam
DESCRIPTION:We propose a denotational definition f
 or the (actual) meaning of a cryptographic message
  and, based on it, an equational definition for th
 e context-sensitivity of that meaning, both via hy
 pothetical knowledge and provability. As a result,
  we obtain a formalisation of the first of Abadi a
 nd Needham's principles for prudent engineering pr
 actice for - and a tentative denotational semantic
 s of - cryptographic protocols. Building on this (
 published) work, we present ongoing work on the di
 stinction between the intended and the actual mean
 ing of a cryptographic message and protocol. Our n
 otions are viable for general multi-agent systems.
     The Logic Tea homepage can be found at https:/
 /www.illc.uva.nl/logic_tea/ For more information, 
 please contact Joel Uckelmann (juckelma at science
 .uva.nl) or Edgar Andrade (E.J.AndradeLotero at uv
 a.nl
X-ALT-DESC;FMTTYPE=text/html:\n      <p>\n        
 We propose a denotational definition for the (actu
 al) meaning of a cryptographic message and, based 
 on it, an equational definition for the context-se
 nsitivity of that meaning, both via hypothetical k
 nowledge and provability. As a result, we obtain a
  formalisation of the first of Abadi and Needham's
  principles for prudent engineering practice for -
  and a tentative denotational semantics of - crypt
 ographic protocols. Building on this (published) w
 ork, we present ongoing work on the distinction be
 tween the intended and the actual meaning of a cry
 ptographic message and protocol. Our notions are v
 iable for general multi-agent systems.\n      </p>
 \n    \n      <p>\n        The Logic Tea homepage 
 can be found at\n         <a target="_blank" href=
 "https://www.illc.uva.nl/logic_tea/">https://www.i
 llc.uva.nl/logic_tea/</a>\n         For more infor
 mation, please contact\n         Joel Uckelmann (<
 a class="email">juckelma <span class="at">at</span
 > science.uva.nl</a>)\n         or Edgar Andrade (
 <a class="email">E.J.AndradeLotero <span class="at
 ">at</span> uva.nl</a>\n      </p>\n    
URL:/NewsandEvents/Archives/2007/newsitem/2054/25-
 October-2007-Logic-Tea-Simon-Kramer
END:VEVENT
END:VCALENDAR
