常数轮多项式互素多方安全判定协议 |
| |
作者姓名: | 何云筱 徐海霞 吕克伟 李宝 |
| |
作者单位: | 中国科学院研究生院信息安全国家重点实验室, 北京 100039 |
| |
基金项目: | 中国科学院研究生院院长基金(yzjj2003010)资助;国家“863”计划(2001AA140435)的部分支持 |
| |
摘 要: | 以生成随机共享值、安全共享乘法与加法的常数轮协议为基础,给出有限域K上多项式的Shamir共享,并构造常数轮协议,使得网络可以安全判定Kx]中两个多项式是否互素.所构造协议的安全性基于已知基本协议的安全性.
|
关 键 词: | 多方安全计算 共享 常数轮 |
收稿时间: | 2003-03-11 |
修稿时间: | 2003-05-12 |
Secure Constant-Round Protocols for DeterminingCo-Prime of Polynomials |
| |
Authors: | HE Yun-Xiao XU Hai-Xia LV Ke-Wei LI Bao |
| |
Institution: | State Key Lab. of Information Security, Graduate School, Chinese Academy of Sciences, Beijing 100039, China |
| |
Abstract: | Based on some known constant-round protocols for generating random shared values,for secure multiplicationsand for addition of shared values,we give the Shamirs sharing for polynomials in a finite field K,and constructa protocol allowing a network to securely determine whether two polynomials in K x] are co-prime.Security ofthe protocols constructed depends on security of these basic protocols above. |
| |
Keywords: | multi-party secure computation sharing constant-round |
|
| 点击此处可从《》浏览原始摘要信息 |
| 点击此处可从《》下载免费的PDF全文 |