GROUP N. Charles Barrasso Carter May Chih-Yu (Joey) Tang. A Survey of Key Management for Secure Group Communication. Sandro Rafaeli David Hutchison. Goals and Metrics. Storage requirements Overhead traffic minimization Backward and forward secrecy
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Chih-Yu (Joey) Tang
A Survey of Key Management for Secure Group Communication
Generic Implementations of Elliptic Curve Cryptography using Partial Reduction
Sheueling Chang Shantz
Uses points where the curve exactly crosses integer (x,y) coordinates to generate group of points.
These points are ideal for SPEKE, Diffie-Hellman, and other methods and are actually much smaller and faster than those used in traditionally, while providing an equivalent level of security.
Simple and Fault-tolerant Key Agreement For Dynamic Collaborative Groups
Self-Organized Network-Layer Security in Mobile Ad HocNetworks
A Pairwise Key Pre-distribution Scheme forWireless Sensor Networks
Yunghsiang S. Han
Pramod K. Varshney
SPINS: Security Protocols for Sensor Networks
Department of Electrical Engineering and Computer Sciences, UC Berkeley
What are the issues?
Communication is the big chuck on energy consumption, therefore when developing a security structure for Sensor Network, minimizing the communication overhead is the focus.
The characteristics of the Sensor Network restrict its ability to adapt the existing security technologies.
Compromised security is inevitable for current Sensor Network.
SPINS: SNEP & μTESLA
SNEP: one to one agreement
μTESLA: for broadcasting (original TESLA is not for Sensor Networks)
Mobility Helps Security in AdHoc Networks
Laboratory for Computer Communications and Applications (LAC)
School of Information and Communication Sciences (I&C)
Swiss Federal Institute of Technology Lausanne (EPFL)
Static, Central Control
Security is usually enforced by a static, central authority.
Ex: Communication Network, Operating System, and the access system to the vault of a bank.
Establishing Security Association: purely mutual agreement between users
Ex: Physical contact (wire) or Infrared communication
Fully self-organized ad hoc networks : no central authority
i can ask a friend to issue a fresh certificate to j
Ad hoc networks with a central authority: a (off-line) central authority
Ex: If a node i possesses a certificate signed by the central authority that binds j with j’s public key, then there exists a one-way security association from i to j.
Mobility Helps Security
Simulation shows the higher mobility leads to a faster creation of the security associations
Random walk mobility: nodes move randomly
(Restricted) Random waypoint mobility: choice a destination to move to
Restricted because users normally choose a destination to go to.
Ex: meeting rooms, lounges, and so on.
Experiment result shows