Sciweavers

391 search results - page 50 / 79
» On-Line Secret Sharing
Sort
View
SCN
2010
Springer
129views Communications» more  SCN 2010»
13 years 6 months ago
Improved Primitives for Secure Multiparty Integer Computation
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer...
Octavian Catrina, Sebastiaan de Hoogh
SOUPS
2009
ACM
14 years 2 months ago
Usability and security of out-of-band channels in secure device pairing protocols
Initiating and bootstrapping secure, yet low-cost, ad-hoc transactions is an important challenge that needs to be overcome if the promise of mobile and pervasive computing is to b...
Ronald Kainda, Ivan Flechais, A. W. Roscoe
ICNP
2003
IEEE
14 years 29 days ago
Establishing Pairwise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach
A prerequisite for secure communication between two nodes in an ad hoc network is that the nodes share a key to bootstrap their trust relationship. In this paper, we present a sca...
Sencun Zhu, Shouhuai Xu, Sanjeev Setia, Sushil Jaj...
CARDIS
2006
Springer
159views Hardware» more  CARDIS 2006»
13 years 11 months ago
Noisy Tags: A Pretty Good Key Exchange Protocol for RFID Tags
We propose a protocol that can be used between an RFID tag and a reader to exchange a secret without performing any expensive computation. Similarly to the famous blocker tag sugge...
Claude Castelluccia, Gildas Avoine
ICCSA
2009
Springer
14 years 2 months ago
On a Construction of Short Digests for Authenticating Ad Hoc Networks
In pervasive ad-hoc networks, there is a need for devices to be able to communicate securely, despite the lack of apriori shared security associations and the absence of an infrast...
Khoongming Khoo, Ford-Long Wong, Chu-Wee Lim