Sciweavers

4111 search results - page 224 / 823
» Security, Protocols, and Trust
Sort
View
112
Voted
FSTTCS
2003
Springer
15 years 5 months ago
A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol
We prove the Needham-Schroeder-Lowe public-key protocol secure under real, active cryptographic attacks including concurrent protocol runs. This proof is based on an abstract crypt...
Michael Backes, Birgit Pfitzmann
119
Voted
JCS
2010
80views more  JCS 2010»
14 years 7 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...
97
Voted
JOC
2010
123views more  JOC 2010»
14 years 7 months ago
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Abstract. In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computati...
Yonatan Aumann, Yehuda Lindell
WCNC
2008
IEEE
15 years 7 months ago
Testbed Implementation of a Secure Flooding Time Synchronization Protocol
Abstract— A fundamental building block in distributed wireless sensor networks is time synchronization. Given resource constrained nature of sensor networks, traditional time syn...
Tanya Roosta, Wei-Chieh Liao, Wei-Chung Teng, Shan...
CTRSA
2008
Springer
134views Cryptology» more  CTRSA 2008»
15 years 2 months ago
An Efficient Protocol for Fair Secure Two-Party Computation
In the 1980s, Yao presented a very efficient constant-round secure two-party computation protocol withstanding semi-honest adversaries, which is based on so-called garbled circuits...
Mehmet S. Kiraz, Berry Schoenmakers