Sciweavers

1612 search results - page 116 / 323
» About models of security protocols
Sort
View
CSFW
2006
IEEE
15 years 10 months ago
Cryptographically Sound Theorem Proving
We describe a faithful embedding of the Dolev-Yao model of Backes, Pfitzmann, and Waidner (CCS 2003) in the theorem prover Isabelle/HOL. This model is cryptographically sound in ...
Christoph Sprenger, Michael Backes, David A. Basin...
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
15 years 9 months ago
Secure Computation Without Authentication
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pa...
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
15 years 7 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
117
Voted
MODELS
2007
Springer
15 years 10 months ago
A Metamodel-Based Approach for Analyzing Security-Design Models
Abstract We have previously proposed an expressive UML-based language for constructing and transforming security-design models, which are models that combine design specifications...
David A. Basin, Manuel Clavel, Jürgen Doser, ...
CTRSA
2010
Springer
191views Cryptology» more  CTRSA 2010»
15 years 7 months ago
Making the Diffie-Hellman Protocol Identity-Based
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...
Dario Fiore, Rosario Gennaro