Sciweavers

576 search results - page 60 / 116
» Modeling Adversaries in a Logic for Security Protocol Analys...
Sort
View
CCS
2008
ACM
13 years 10 months ago
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
Ralf Küsters, Tomasz Truderung
EUROCRYPT
2008
Springer
13 years 10 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky
FOSSACS
2009
Springer
14 years 3 months ago
Cryptographic Protocol Composition via the Authentication Tests
Although cryptographic protocols are typically analyzed in isolation, they are used in combinations. If a protocol was analyzed alone and shown to meet some security goals, will it...
Joshua D. Guttman
FORTE
2009
13 years 6 months ago
Epistemic Logic for the Applied Pi Calculus
We propose an epistemic logic for the applied pi calculus, which is a variant of the pi calculus with extensions for modeling cryptographic protocols. In such a calculus, the secur...
Rohit Chadha, Stéphanie Delaune, Steve Krem...
CONCUR
2005
Springer
14 years 2 months ago
Constraint Solving for Contract-Signing Protocols
Research on the automatic analysis of cryptographic protocols has so far mainly concentrated on reachability properties, such as secrecy and authentication. Only recently it was sh...
Detlef Kähler, Ralf Küsters