欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
一个有效二把聚会 RSA 秘密钥匙分享产生计划在这篇论文基于同构的加密，在主要 residuosity 假设下面语义上安全，被建议。在计算 RSA 模 N 的阶段，一个起始的分布式的 primalitytest 协议被用来减少计算复杂性并且增加是 atwo 主要的 N 的概率产品。在另外的方面上，同构的加密基于分享的变换协议在多党的计算模量 N 和秘密被设计并且采用给 d 调音。基于忘却的转移协议比作任何分享的变换协议，同构的加密基于分享的变换协议具有高效。我们的计划抵抗被动 attackandsince 验证分享的一个方法被介绍在，计划罐头也抵抗任何作弊行为。安全证明，计算复杂性和通讯复杂性分析最后被给。
英文摘要：
An efficient two party RSA secret key sharing generation scheme based on a homomorphic encryption, which is semantically secure under the prime residuosity assumption, is proposed in this paper. At the stage of computing RSA modulo N, an initial distributed primality test protocol is used to reduce the computation complexity and increase the probability of N being a two-prime product. On the other aspect, the homomorphic encryption based sharing conversion protocols is devised and adopted in multi-party computing modulus N and secret key d. Comparing to any sharing conversion protocols based on oblivious transfer protocol, the homomorphic encryption based sharing conversion protocols are of high performance. Our scheme resists the passive attack and since a method of verifying the sharing was introduced in, the scheme can resists any cheating behaviors too. Security proof, computation complexity and communication complexity analysis are given at last.
同期刊论文项目
同项目期刊论文
期刊信息
位置：