Efficient Geometric Group Key-sharing Scheme

2019 ◽  
Author(s):  
Koki Nishigami ◽  
Keiichi Iwamura
Keyword(s):  
Group Key ◽  
Sharing Scheme

scholarly journals ANALISIS ATRIBUT KEAMANAN TERHADAP PERBAIKAN PROTOKOL GROUP KEY TRANSFER : PROTOKOL HSU

2017 ◽  
Vol 9 (1) ◽  
pp. 13
Author(s):  
I Made Mustika Kerta Astawa ◽  
Rahmi Nurazizah
Keyword(s):  
Secret Sharing ◽  
Discrete Logarithm ◽  
Main Idea ◽  
Cryptographic Protocols ◽  
Secret Sharing Scheme ◽  
Group Key ◽  
Type Group ◽  
Sharing Scheme ◽  
Diffie Hellman ◽  
Key Compromise Impersonation

Protocol Hsu et.al first introduced in 2012 and is the protocol type Group Key Transfer based Linear Shamir's Secret Sharing Scheme (LSSS). The main idea of this protocol is to use m-secret sharing perspective. This protocol assumes that the difficulty of discrete logarithm problem (DLP) (ie given  is computationally very difficult/not feasible to count ) and Cryptographyc Diffie Hellman (CDH) (ie given  and  it is computationally very difficult/not feasible to count ) in . Thus, it needs to analyze the security attributes to this mechanism Protocol Hsu. Good cryptographic protocols should meet the security attributes Known Security Key, Key-Compromise Impersonation Resillience, Unknown Key-Share Resillience, Key Control and Key Confirmation.

scholarly journals A Computation-Efficient Group Key Distribution Protocol Based on a New Secret Sharing Scheme

Information ◽  
2019 ◽  
Vol 10 (5) ◽  
pp. 175 ◽  
Author(s):  
Runhai Jiao ◽  
Hong Ouyang ◽  
Yukun Lin ◽  
Yaoming Luo ◽  
Gang Li ◽  
...  
Keyword(s):  
Secret Sharing ◽  
Key Distribution ◽  
Secret Sharing Scheme ◽  
Mobile Terminals ◽  
Group Key ◽  
Computation Cost ◽  
Logical Key Hierarchy ◽  
Sharing Scheme ◽  
Group Key Distribution ◽  
The Internet Of Things

With the development of 5G and the Internet of Things (IoT), mobile terminals are widely used in various applications under multicast scenarios. However, due to the limited computation resources of mobile terminals, reducing the computation cost of members in group key distribution processes of dynamic groups has become an important issue. In this paper, we propose a computation-efficient group key distribution (CEGKD) protocol. First, an improved secret sharing scheme is proposed to construct faster encryption and decryption algorithms. Second, the tree structure of logical key hierarchy (LKH) is employed to implement a simple and effective key-numbering method. Theoretical analysis is given to prove that the proposed protocol meets forward security and backward security. In addition, the experiment results show that the computation cost of CEGKD on the member side is reduced by more than 85% compared with that of the LKH scheme.

Geometric group key-sharing scheme

2016 ◽  
Author(s):  
Jun Hamasaki ◽  
Ryo Kaneko ◽  
Keiichi Iwamura
Keyword(s):  
Group Key ◽  
Sharing Scheme

A BD Group Key Negotiation Protocol based on Clustering Technology

2020 ◽  
Vol 16 (6) ◽  
pp. 875
Author(s):  
Cai Zengyu ◽  
Wu Zuodong ◽  
Zhang Jianwei ◽  
Wang Wenqian
Keyword(s):  
Group Key ◽  
Negotiation Protocol ◽  
Key Negotiation

Distributed group key management scheme based on cluster collaboration in WSN

2009 ◽  
Vol 29 (3) ◽  
pp. 638-642
Author(s):  
Wei-ni ZENG ◽  
Ya-ping LIN ◽  
Qiu-ying LU
Keyword(s):  
Key Management ◽  
Group Key Management ◽  
Group Key ◽  
Management Scheme ◽  
Key Management Scheme

Multi-secret sharing scheme among weighted participants

2011 ◽  
Vol 30 (12) ◽  
pp. 3334-3336
Author(s):  
Wei WANG ◽  
Shun-xian ZHOU
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Sharing Scheme ◽  
Multi Secret Sharing
Sign in / Sign up

Export Citation Format

Share Document