Sciweavers

576 search results - page 89 / 116
» Modeling Adversaries in a Logic for Security Protocol Analys...
Sort
View
PADL
2001
Springer
14 years 1 months ago
Specifying Authentication Protocols Using Rewriting and Strategies
Abstract. Programming with rewrite rules and strategies has been already used for describing several computational logics. This paper describes the way the Needham-Schroeder Public...
Horatiu Cirstea
CSFW
2007
IEEE
14 years 3 months ago
Do As I SaY! Programmatic Access Control with Explicit Identities
We address the programmatic realization of the access control model of security in distributed systems. Our aim is e the gap between abstract/declarative policies and their concre...
Andrew Cirillo, Radha Jagadeesan, Corin Pitcher, J...
SIGCOMM
1999
ACM
14 years 1 months ago
A Readable TCP in the Prolac Protocol Language
Prolac is a new statically-typed, object-oriented language for network protocol implementation. It is designed for readability, extensibility, and real-world implementation; most ...
Eddie Kohler, M. Frans Kaashoek, David R. Montgome...
CCS
2010
ACM
13 years 9 months ago
On the soundness of authenticate-then-encrypt: formalizing the malleability of symmetric encryption
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...
Ueli Maurer, Björn Tackmann
ICISC
2009
169views Cryptology» more  ICISC 2009»
13 years 6 months ago
Generic One Round Group Key Exchange in the Standard Model
Minimizing complexity of group key exchange (GKE) protocols is an important milestone towards their practical deployment. An interesting approach to achieve this goal is to simplif...
M. Choudary Gorantla, Colin Boyd, Juan Manuel Gonz...