Sciweavers

1251 search results - page 80 / 251
» On the security of group communication schemes
Sort
View
CSFW
2002
IEEE
14 years 1 months ago
Probabilistic Analysis of Anonymity
We present a formal analysis technique for probabilistic security properties of peer-to-peer communication systems based on random message routing among members. The behavior of g...
Vitaly Shmatikov
ACISP
2001
Springer
14 years 20 days ago
Private Information Retrieval Based on the Subgroup Membership Problem
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
Akihiro Yamamura, Taiichi Saito
INFOCOM
2006
IEEE
14 years 2 months ago
Mistreatment in Distributed Caching Groups: Causes and Implications
— Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the...
Nikolaos Laoutaris, Georgios Smaragdakis, Azer Bes...
MOBIHOC
2007
ACM
14 years 7 months ago
A random perturbation-based scheme for pairwise key establishment in sensor networks
A prerequisite for secure communications between two sensor nodes is that these nodes exclusively share a pairwise key. Although numerous pairwise key establishment (PKE) schemes ...
Wensheng Zhang, Minh Tran, Sencun Zhu, Guohong Cao
TCC
2010
Springer
381views Cryptology» more  TCC 2010»
14 years 5 months ago
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
We construct a fully secure HIBE scheme with short ciphertexts. The previous construction of Boneh, Boyen, and Goh was only proven to be secure in the selective model, under a non...
Allison B. Lewko, Brent Waters