Sciweavers

56 search results - page 3 / 12
» Secret Sharing Made Short
Sort
View
IJNSEC
2006
75views more  IJNSEC 2006»
14 years 11 months ago
Cryptanalysis of the Secure Sessions from Weak Secrets Protocols
The Short Secret Sharing Protocols (S3P), proposed by Roe et al in 1998 [13] and revised in 2003 [14], is a family of protocols that bootstrap secure session keys from weak secret...
Jolyon Clulow
IANDC
2008
84views more  IANDC 2008»
14 years 10 months ago
Authenticating ad hoc networks by comparison of short digests
We show how to design secure authentication protocols for a non-standard class of scenarios. In these authentication is not bootstrapped from a PKI, shared secrets or trusted thir...
L. H. Nguyen, A. W. Roscoe
ICCSA
2009
Springer
15 years 6 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
OPODIS
2007
15 years 1 months ago
Secretive Birds: Privacy in Population Protocols
We study private computations in a system of tiny mobile agents. We consider the mobile population protocol model of Angluin et al. [2] and ask what can be computed without ever re...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
TIT
2008
187views more  TIT 2008»
14 years 11 months ago
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
Stefan Dziembowski, Ueli M. Maurer