Sciweavers

5374 search results - page 101 / 1075
» The induction of communication protocols
Sort
View
EUROCRYPT
2004
Springer
15 years 11 months ago
Optimal Communication Complexity of Generic Multicast Key Distribution
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...
Daniele Micciancio, Saurabh Panjwani
SSS
2009
Springer
115views Control Systems» more  SSS 2009»
15 years 11 months ago
How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity?
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a m...
Alain Cournier, Swan Dubois, Vincent Villain
ASWEC
2006
IEEE
16 years 13 days ago
Formally Analysing a Security Protocol for Replay Attacks
The Kerberos-One-Time protocol is a key distribution protocol promoted for use with Javacards to provide secure communication over the GSM mobile phone network. From inspection we...
Benjamin W. Long, Colin J. Fidge
FUIN
2008
107views more  FUIN 2008»
15 years 6 months ago
Modelling and Simulation of Quantum Teleportation and Dense Coding Using Predicate/Transition-Nets
Reachability analysis is one of the most successful methods used in design and validation of protocols for classical communication, whereas the predicate/transition-net formalism i...
Kimmo Varpaaniemi, Leo Ojala
APSCC
2007
IEEE
16 years 22 days ago
ID-Based Key Agreement for Dynamic Peer Groups in Mobile Computing Environments
In order to secure communications for dynamic peer groups in mobile computing environments, key agreement protocols are required. In this paper, we propose a new key agreement pro...
Raylin Tso, Xun Yi, Eiji Okamoto