SECURE SCHEMES FOR SECRET SHARING AND KEY DISTRIBUTION USING PELL'S EQUATION
SECURE SCHEMES FOR SECRET SHARING AND KEY DISTRIBUTION USING PELL'S EQUATION
复制标题
DOI：
10.12732/ijpam.v85i5.11
复制
发表时间：
2013-07
期刊：
影响因子：
--
通讯作者：
P. MuraliKrishna;S. Srinivasan;N. Chandramowliswaran
中科院分区：
文献类型：
--
作者：
P. MuraliKrishna;S. Srinivasan;N. Chandramowliswaran
动态会议的密钥分发方案是一种方法，通过该方法，最初可信服务器将私有的各个信息分发给一组用户。随后，给定大小的任何用户组的每个成员都可以计算公共安全组密钥。在这种情况下，任何一组t个用户都可以计算出一个公共密钥，每个用户只需要使用他自己的初始信息和组中其他t-1个用户的身份。密钥对于k个用户的联合是安全的，也就是说，即使k个用户将他们的片段汇集在一起，他们也不能计算任何由其他用户组成的t大小会议的密钥。本文利用Pell方程给出了一个完全安全方案的算法。
A key distribution scheme for dynamic conferences is a method by which initially an trusted server distributes private individual pieces of in- formation to a set of users. Later each member of any group of users of given size can compute a common secure group key. In this setting any group of t users can compute a common key by each user computing using only his pri- vate initial piece of information and the identities of the other t − 1 users in the group. Keys are secure against coalition of to k users, that is, even if k users pool together their pieces they cannot compute anything about a key of any t-size conference comprised of other users. In this paper, we introduce an algorithm for such perfectly secure scheme by using Pell's equation.