Geometric group key-sharing scheme using euclidean distance

Submitted by grigby1 on Wed, 01/10/2018 - 12:20pm

Title	Geometric group key-sharing scheme using euclidean distance
Publication Type	Conference Paper
Year of Publication	2017
Authors	Hamasaki, J., Iwamura, K.
Conference Name	2017 14th IEEE Annual Consumer Communications Networking Conference (CCNC)
ISBN Number	978-1-5090-6196-9
Keywords	Broadcasting, Collaboration, composability, computational complexity, cryptography, Elliptic curve cryptography, Euclidean distance, geometric group key-sharing scheme, group key sharing, Human Behavior, human factor, information theoretic security, information-theoretic security, Internet of Things, Metrics, multicast communication, policy, pubcrawl, Resiliency, Scalability, sensor network, Wireless Sensor Network, Wireless sensor networks
Abstract	A wireless sensor network (WSN) is composed of sensor nodes and a base station. In WSNs, constructing an efficient key-sharing scheme to ensure a secure communication is important. In this paper, we propose a new key-sharing scheme for groups, which shares a group key in a single broadcast without being dependent on the number of nodes. This scheme is based on geometric characteristics and has information-theoretic security in the analysis of transmitted data. We compared our scheme with conventional schemes in terms of communication traffic, computational complexity, flexibility, and security, and the results showed that our scheme is suitable for an Internet-of-Things (IoT) network.
URL	https://ieeexplore.ieee.org/document/7983270
DOI	10.1109/CCNC.2017.7983270
Citation Key	hamasaki_geometric_2017

Groups:

Science of Security VO