Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Formal Eavesdropping and its Computational Interpretation
 

Summary: Formal Eavesdropping and
its Computational Interpretation
Martn Abadi 1 and Jan Jurjens 2
1 InterTrust, Strategic Technologies and Architectural Research Laboratory ? ? ?
2 Computing Laboratory, University of Oxford
Abstract. We compare two views of symmetric cryptographic prim-
itives in the context of the systems that use them. We express those
systems in a simple programming language; each of the views yields a
semantics for the language. One of the semantics treats cryptographic
operations formally (that is, symbolically). The other semantics is more
detailed and computational; it treats cryptographic operations as func-
tions on bitstrings. Each semantics leads to a de nition of equivalence
of systems with respect to eavesdroppers. We establish the soundness of
the formal de nition with respect to the computational one. This result
provides a precise computational justi cation for formal reasoning about
security against eavesdroppers.
1 Introduction
This work is part of an e ort to bridge the gap between the formal and the
computational views of cryptography and cryptographic protocols. The
formal view is based on ideas and methods from logic and programming

  

Source: Abadi, Martín - Department of Computer Science, University of California at Santa Cruz
Jurjens, Jan - Fakultät für Elektrotechnik und Informationstechnik, Universität Dortmund

 

Collections: Computer Technologies and Information Sciences