Sciweavers

1255 search results - page 176 / 251
» On Simple and Secure Key Distribution
Sort
View
ICC
2007
IEEE
186views Communications» more  ICC 2007»
15 years 10 months ago
An Efficient Cluster-Based Proactive Secret Share Update Scheme for Mobile Ad Hoc Networks
– When implementing public key security ser- easy for an adversary to collect data and attack. To solve this vices in mobile ad hoc networks (MANETs), multiple problem, the distr...
Ying Dong, Ai Fen Sui, Siu-Ming Yiu, Victor O. K. ...
RSA
2000
170views more  RSA 2000»
15 years 4 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
SACMAT
2009
ACM
15 years 11 months ago
Working set-based access control for network file systems
Securing access to files is an important and growing concern in corporate environments. Employees are increasingly accessing files from untrusted devices, including personal hom...
Stephen Smaldone, Vinod Ganapathy, Liviu Iftode
CCS
2008
ACM
15 years 6 months ago
Location privacy of distance bounding protocols
Distance bounding protocols have been proposed for many security critical applications as a means of getting an upper bound on the physical distance to a communication partner. As...
Kasper Bonne Rasmussen, Srdjan Capkun
CCS
2005
ACM
15 years 10 months ago
Tracking anonymous peer-to-peer VoIP calls on the internet
Peer-to-peer VoIP calls are becoming increasingly popular due to their advantages in cost and convenience. When these calls are encrypted from end to end and anonymized by low lat...
Xinyuan Wang, Shiping Chen, Sushil Jajodia