Sciweavers

185 search results - page 28 / 37
» Key Establishment Using Secure Distance Bounding Protocols
Sort
View
CSFW
1999
IEEE
13 years 12 months ago
A Meta-Notation for Protocol Analysis
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...
Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln...
STOC
1999
ACM
85views Algorithms» more  STOC 1999»
13 years 12 months ago
A Theorem on Sensitivity and Applications in Private Computation
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
Anna Gál, Adi Rosén
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 28 days ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
ADHOCNOW
2005
Springer
14 years 1 months ago
Enhancing the Security of On-demand Routing in Ad Hoc Networks
We present the Ad-hoc On-demand Secure Routing (AOSR) protocol, which uses pairwise shared keys between pairs of mobile nodes and hash values keyed with them to verify the validity...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
AINA
2004
IEEE
13 years 11 months ago
Peer-To-Peer Technology for Interconnecting Web Services in Heterogeneous Networks
The interconnection of software components is a key to enabling collaborative work. However, technology differences and security barriers like firewalls often hinder establishing ...
Tim Schattkowsky, Christoph Loeser, Wolfgang M&uum...