Sciweavers

1059 search results - page 101 / 212
» Modeling Security Protocols as Games
Sort
View
CSFW
2006
IEEE
15 years 6 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 6 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...
FC
2007
Springer
128views Cryptology» more  FC 2007»
15 years 6 months ago
Informant: Detecting Sybils Using Incentives
We propose an economic approach to Sybil attack detection. In our Informant protocol, a detective offers a reward for Sybils to reveal themselves. The detective accepts from one i...
N. Boris Margolin, Brian Neil Levine
CTRSA
2010
Springer
191views Cryptology» more  CTRSA 2010»
15 years 3 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
BCS
2008
15 years 1 months ago
Tools for Traceable Security Verification
Dependable systems evolution has been identified by the UK Computing Research Committee (UKCRC) as one of the current grand challenges for computer science. We present work toward...
Jan Jürjens, Yijun Yu, Andreas Bauer 0002