Sciweavers

1058 search results - page 68 / 212
» Secure Group Communications Using Key Graphs
Sort
View
ISPA
2004
Springer
15 years 6 months ago
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...
Changtao Qu, Wolfgang Nejdl, Matthias Kriesell
111
Voted
ADHOCNOW
2006
Springer
15 years 6 months ago
Key Revocation for Identity-Based Schemes in Mobile Ad Hoc Networks
Recently, identity-based cryptographic (IBC) schemes have been considered to secure mobile ad hoc networks (MANETs) due to their efficient key management properties. However, propo...
Katrin Hoeper, Guang Gong
109
Voted
CORR
2008
Springer
90views Education» more  CORR 2008»
15 years 21 days ago
A computationally-efficient construction for the matrix-based key distribution in sensor network
Key pre-distribution in wireless sensor network is aimed at delivering keys to sensor networks at the low expense of computation, communication, and memory while providing a high d...
Abedelaziz Mohaisen
CORR
2008
Springer
139views Education» more  CORR 2008»
15 years 21 days ago
The Secrecy Graph and Some of its Properties
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
Martin Haenggi
CRYPTO
2005
Springer
107views Cryptology» more  CRYPTO 2005»
15 years 6 months ago
A Quantum Cipher with Near Optimal Key-Recycling
Abstract. Assuming an insecure quantum channel and an authenticated classical channel, we propose an unconditionally secure scheme for encrypting classical messages under a shared ...
Ivan Damgård, Thomas Brochmann Pedersen 0002...