Authenticated Group Key Agreement Protocol Based on Twist Conjugacy Problem in Near-Rings  

作　　者：Devarasan Ezhilmaran Venkatesan Muthukumaran 

机构地区：[1]School of Advanced Sciences, VIT University, Vellore632014, Tamilnadu, India

出　　处：《Wuhan University Journal of Natural Sciences》2017年第6期472-476,共5页武汉大学学报（自然科学英文版）

摘　　要：Nowadays some promising authenticated group key agreement protocols are constructed on braid groups, dynamic groups, pairings and bilinear pairings. Hence the non-abelian structure has attracted cryptographers to construct public-key cryptographic protocols. In this article, we propose a new authenticated group key agreement protocol which works in non-abelian near-rings. We have proved that our protocol meets the security attributes under the assumption that the twist conjugacy search problem（TCSP） is hard in near-ring.Nowadays some promising authenticated group key agreement protocols are constructed on braid groups, dynamic groups, pairings and bilinear pairings. Hence the non-abelian structure has attracted cryptographers to construct public-key cryptographic protocols. In this article, we propose a new authenticated group key agreement protocol which works in non-abelian near-rings. We have proved that our protocol meets the security attributes under the assumption that the twist conjugacy search problem（TCSP） is hard in near-ring.

关 键 词：group key agreement protocol NEAR-RINGS twist conjugacy search problem 

分 类 号：TN918[电子电信—通信与信息系统]