收稿日期: 2009-12-21
修回日期: 2010-06-25
网络出版日期: 2011-03-15
On the security proof of a protocol for private integer comparison
Received date: 2009-12-21
Revised date: 2010-06-25
Online published: 2011-03-15
邵秀凤 , 李荣花 . 关于一个数值比较协议的安全性证明[J]. 中国科学院大学学报, 2011 , 28(2) : 262 -265 . DOI: 10.7523/j.issn.2095-6134.2011.2.019
In 1990 ACM Conference on Computer and Communications Security, Cachin proposed a protocol for private bidding and auctions and gave the security proof. We show that there is a mistake in Cachin’s security proof, and we correct the mistake.
[1] Yao A C. Protocls for secure computation //Proceedings of 23rd IEEE Symposium on Foundations of Computer Science.1982:160-164.
[2] Cachin C. Efficient private bidding and auctions with an oblivious third party //6th ACM Conference on Computer and Communications Security. ACM Press, 1990:120-127.
[3] Blake I F, Kolesnikov V. Strong conditional oblivious transfer and computing on intervals //10th International Conference on the Theory and Application of Cryptology and Information Security, Asiacrypt'04, Jeju Island, Korea. Berlin: Springer, LNCS 3329, 2004:515-529.
[4] Qin J, Zhang Z F, Feng D G,et al. A protocol of comparing information without leaking
[J]. Journal of Software, 2004, 15(3): 421-427 (in Chinese). 秦静, 张振峰, 冯登国,等. 无信息泄露的比较协议
[J]. 软件学报, 2004, 15(3): 421-427.
[5] Qin J, Zhang Z F, Feng D G, et al. A protocol of specific secure two-party computation
[J]. Journal of China Institute of Communications, 2004, 25(11): 35-42(in Chinese). 秦静, 张振峰, 冯登国,等. 一个特殊的安全双方计算协议
[J]. 通信学报, 2004, 25(11): 35-42.
/
| 〈 |
|
〉 |
