检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]解放军信息工程大学电子技术学院
出 处:《系统工程与电子技术》2005年第3期511-515,共5页Systems Engineering and Electronics
基 金:国家自然科学基金重大研究计划(90204012);国家"863"高技术研究发展计划(2002AA143021);教育部优秀青年教师资助计划;教育部科学技术重点研究基金资助课题
摘 要:结合基于可验证秘密共享技术的安全多方计算和知识证明,提出了一种计算安全的分布式会议密钥分配方案,该方案具有结构简单、安全性强等特点。分析表明,即使方案中实施密钥分配的服务器组中有部分服务器为入侵者成功控制,会议的所有诚实用户仍可得到关于会议的正确的密钥;在Diffie HellmenDecisional问题假设下,任何窃听者均无法得到有关会议密钥的任何信息,在随机Oracle模型下,主动攻击者也无法成功进行任何假冒。实验表明,该方案效率较高,有着较强的实用性。A distributed conference key distribution system is introduced. The system utilizes secure multi-party computation scheme by virtue of Feldman' s (t+1, n) VSS to perform the conference key computation such that a key can be obtained in a distributed fashion in which any key of servers is required to perform the computation. By riming the protocol, every honest user of a given conference can get a common key, even if a minority of servers malfunction or misbehave. This scheme does not rely on any unproven cryptographic assumptions or on the availability of any tamper-proof hardware. By using zero knowledge proof, any corrupted information and incorrect results can be detected. And by distributing the sensitive security information across several servers and never reconstructing and key at a single location, the compromise of a few servers will not compromise the privacy of any key. The scheme is implemented in a distributed environment. By conducting a number of experiments in the fault-free case and various fault scenarios, it is shown that the scheme is practicable and efficient.
关 键 词:会议密钥分配 容错 计算安全 可验证秘密共享 知识证明
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.133.149.165