Sciweavers

62 search results - page 2 / 13
» Security Protocols: Principles and Calculi
Sort
View
TOPLAS
2010
101views more  TOPLAS 2010»
13 years 4 months ago
Nomadic pict: Programming languages, communication infrastructure overlays, and semantics for mobile computation
Pict project. We define two levels of abstraction as calculi with precise semantics: a low-level Nomadic π calculus with migration and location-dependent communication, and a hig...
Peter Sewell, Pawel T. Wojciechowski, Asis Unyapot...
ICALP
2005
Springer
13 years 11 months ago
Computationally Sound Implementations of Equational Theories Against Passive Adversaries
In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not conside...
Mathieu Baudet, Véronique Cortier, Steve Kr...
CSFW
1998
IEEE
13 years 10 months ago
Honest Ideals on Strand Spaces
In security protocol analysis, it is important to learn general principles that limit the abilities of an attacker, and that can be applied repeatedly to a variety of protocols. W...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
SPW
1997
Springer
13 years 10 months ago
Protocol Interactions and the Chosen Protocol Attack
There are many cases in the literature in which reuse of the same key material for different functions can open up security holes. In this paper, we discuss such interactions betw...
John Kelsey, Bruce Schneier, David Wagner
CCS
2009
ACM
14 years 25 days ago
CoSP: a general framework for computational soundness proofs
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
Michael Backes, Dennis Hofheinz, Dominique Unruh