Sciweavers

144 search results - page 10 / 29
» CLIQUES: A New Approach to Group Key Agreement
Sort
View
SIAMCOMP
2008
148views more  SIAMCOMP 2008»
13 years 7 months ago
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
Abstract. To cope with the impossibility of solving agreement problems in asynchronous systems made up of n processes and prone to t process crashes, system designers tailor their ...
Achour Mostéfaoui, Sergio Rajsbaum, Michel ...
INFOCOM
2011
IEEE
13 years 9 hour ago
Fast and scalable secret key generation exploiting channel phase randomness in wireless networks
—Recently, there has been great interest in physical layer security techniques that exploit the randomness of wireless channels for securely extracting cryptographic keys. Severa...
Qian Wang, Hai Su, Kui Ren, Kwangjo Kim
CSDA
2007
115views more  CSDA 2007»
13 years 8 months ago
Algorithms for compact letter displays: Comparison and evaluation
Multiple pairwise comparisons are one of the most frequent tasks in applied statistics. In this context, letter displays may be used for a compact presentation of results of multi...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
TIP
2008
302views more  TIP 2008»
13 years 8 months ago
Adaptive Pseudo Dilation for Gestalt Edge Grouping and Contour Detection
We consider the problem of detecting object contours in natural images. In many cases, local luminance changes turn out to be stronger in textured areas than on object contours. Th...
Giuseppe Papari, Nicolai Petkov
WISEC
2010
ACM
14 years 1 months ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt