Sciweavers

719 search results - page 6 / 144
» Proving Security Protocols Correct
Sort
View
CCS
2005
ACM
15 years 3 months ago
Towards computationally sound symbolic analysis of key exchange protocols
d abstract) Prateek Gupta and Vitaly Shmatikov The University of Texas at Austin We present a cryptographically sound formal method for proving correctness of key exchange protoco...
Prateek Gupta, Vitaly Shmatikov
EUROCRYPT
2000
Springer
15 years 1 months ago
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
Abstract. When designing password-authenticated key exchange protocols (as opposed to key exchange protocols authenticated using cryptographically secure keys), one must not allow ...
Victor Boyko, Philip D. MacKenzie, Sarvar Patel
ESORICS
2007
Springer
15 years 3 months ago
On the Automated Correction of Security Protocols Susceptible to a Replay Attack
Although there exist informal design guidelines and formal development support, security protocol development is time-consuming because design is error-prone. In this paper, we int...
Juan Carlos López Pimentel, Raul Monroy, Di...
JSW
2008
89views more  JSW 2008»
14 years 9 months ago
Secure Set Union and Bag Union Computation for Guaranteeing Anonymity of Distrustful Participants
Abstract-- The computation of the union operator for different distributed datasets involves two challenges when participants are curious and can even act malicious: guaranteeing a...
Stefan Böttcher, Sebastian Obermeier
JCS
2010
80views more  JCS 2010»
14 years 4 months ago
Constraint differentiation: Search-space reduction for the constraint-based analysis of security protocols
We introduce constraint differentiation, a powerful technique for reducing search when model-checking security protocols using constraint-based methods. Constraint differentiation...
Sebastian Mödersheim, Luca Viganò, Dav...