Sciweavers

3504 search results - page 2 / 701
» Secure protocol composition
Sort
View
CSFW
2008
IEEE
13 years 7 months ago
A Correctness Proof of a Mesh Security Architecture
The IEEE 802.11s working group is tasked to provide ways of establishing and securing a wireless mesh network. One proposal establishes a Mesh Security Architecture (MSA), with a ...
Doug Kuhlman, Ryan Moriarty, Tony Braskich, Steve ...
JOC
2007
84views more  JOC 2007»
13 years 5 months ago
Concurrent Composition of Secure Protocols in the Timing Model
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their inputs. In the stand-alone case, it ha...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
ENTCS
2007
129views more  ENTCS 2007»
13 years 5 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...
JOC
2008
86views more  JOC 2008»
13 years 5 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
FC
2010
Springer
196views Cryptology» more  FC 2010»
13 years 6 months ago
Secure Computation with Fixed-Point Numbers
Abstract. Secure computation is a promising approach to business problems in which several parties want to run a joint application and cannot reveal their inputs. Secure computatio...
Octavian Catrina, Amitabh Saxena