| 有理数相等的保密判定 |
| |
| 引用本文： | 李顺东,杜润萌,杨颜璟,魏琼.有理数相等的保密判定[J].电子学报,2000,48(10):1933-1937. |
| |
| 作者姓名： | 李顺东 杜润萌 杨颜璟 魏琼 |
| |
| 作者单位： | 陕西师范大学计算机科学学院, 陕西西安 710062 |
| |
| 摘 要： | 安全多方计算是近年来国际密码学界研究的热点.数据相等保密判定是安全多方计算的一个基本问题，在指纹匹配和关键词搜索等现实问题中有广泛的应用，因此研究数据相等保密判定有重要的理论与实际意义.本文协议I利用Paillier加密算法高效实现了两个有理数相等的保密判定，协议II基于椭圆曲线同态加密算法安全高效计算多个有理数相等判定问题，并且最后给出了恶意模型下的有理数相等保密判定协议.
|
| 关 键 词： | 密码学 安全多方计算 数据相等 有理数 指纹匹配 |
| 收稿时间： | 2019-05-13 |
Privately Determining Equality of Rational Numbers |
| |
| LI Shun-dong,DU Run-meng,YANG Yan-jing,WEI Qiong.Privately Determining Equality of Rational Numbers[J].Acta Electronica Sinica,2000,48(10):1933-1937. |
| |
| Authors: | LI Shun-dong DU Run-meng YANG Yan-jing WEI Qiong |
| |
| Affiliation: | School of Computer Science, Shaanxi Normal University, Xi'an, Shaanxi 710062, China |
| |
| Abstract: | Secure multiparty computation (SMC) has become research focus in the international cryptographic community in recent years.Privately determining equality of data is a basic problem in SMC.It is widely applied to fingerprint matching,keyword searching and so on.Studying privately determining equality of data has important theoretical and practical significance.Protocol I which is based on the Paillier cryptosystem can privately determine equality of two rational numbers.Protocol Ⅱ which is based on elliptic curve cryptosytem can privately determine equality of multiple rational numbers.Finally this paper gives the protocol for privately determining equality of rational numbers in the malicious model. |
| |
| Keywords: | cryptography secure multiparty computation data equality rational number fingerprint matching |
|
| 点击此处可从《电子学报》浏览原始摘要信息 |
|
点击此处可从《电子学报》下载全文 |
