期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

排序问题的安全多方计算协议 被引量：13

Secure multi-party computation protocol for sequencing problem
原文传递
导出
摘要 为某些特殊问题构造有效的安全多方计算协议是多方计算研究领域的一个重要分支.文中使用密钥共享方案为排序问题构造了一个有效的安全多方计算协议,该协议在n个参与者中至多只有t个不诚实者,若t≤(n-1)/2,则它在被动攻击下是完全安全的;若t<n/3时,它在主动攻击下是完全安全的.排序问题的最简单形式就是"百万富翁"问题. In multi-party computation field,one important branch is to construct an efficient and secure multiparty computation for some special problems.In this paper,we make use of secret sharing scheme to construct an efficient and secure multi-party computation for sequencing problem.Our protocols are perfectly secure against passive adversary if it can corrupt at most t≤（n-1）/2 participants,and is perfectly secure against active adversary if it can corrupt at most tn/3 participants.The simplest sequencing problem is millionaire problem.
作者 唐春明 石桂花 姚正安
机构地区 广州大学数学与信息科学学院 中国科学院软件研究所信息安全国家重点实验室 中山大学数学与计算科学学院
出处 《中国科学：信息科学》 CSCD 2011年第7期789-797,共9页 Scientia Sinica(Informationis)
基金 国家自然科学基金(批准号:10871222)资助项目
关键词 安全多方计算 排序问题 密钥分享 secure multi-party computation sequencing problem secret sharing
分类号 O223 [理学—运筹学与控制论]
  • 相关文献

参考文献13

  • 1秦静,张振峰,冯登国,李宝.无信息泄漏的比较协议[J].软件学报,2004,15(3):421-427. 被引量：49
  • 2Yehuda Lindell,Benny Pinkas.A Proof of Security of Yao’s Protocol for Two-Party Computation[J]. Journal of Cryptology . 2009 (2)
  • 3Luo Y L.Key issues and application of secure multiparty computation. . 2005
  • 4Ben-Or M,Goldwasser S,Wigderson A.Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proceedings of the 20th ACM Symposium on Theory of Computing . 1988
  • 5Schoenmakers B,,Tuyls P.Practical two-party computation based on the conditional gate. Proceedings of Advances in Cryptology-ASIACRYPT’’ 04 . 2004
  • 6Ioannis Ioannidis,Ananth Grama.An efficient protocol for Yao′s millionaires′problem. Proceedings of the36th Hawaii In-ternational Conference on System Sciences (HICSS′03) . 2003
  • 7A.C. Yao.Protocols for secure computations. Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science . 1982
  • 8Goldreich O,Micali S,Wigderson A.How to play any mental game or a completeness theorem for protocol with honest majority. Proceedings of the 19th Annual ACM Symposiumon Theory of Computing . 1987
  • 9Shamir A.How to share a secret. Communications of the ACM . 1979
  • 10RFagin,MNaor,P Wmkler."Comparing information without leaking it,". Communications of the ACM . 1996

二级参考文献12

  • 1Goldreich O. Secure multi-party computation, manuscript version 1.3. 2002. htttp://theory.lcs.mit.edu/-oded
  • 2Cramer R. Introduction to secure computation. In: Damgaard I, ed. Lectures on Data Security-Modern Cryptology in Theory and Practice. Lecture Notes in Computer Science, Vol 1561. Springer-Verlag, 1999. 16-62.
  • 3Yao AC. Protocols for secure computation. In: Proc. of the 23rd IEEE Symp. on Foundation of Computer Science. Chicago: IEEE Computer Society, 1982. 160-164.
  • 4Cachin C. Efficient private bidding and auctions with an oblivious third party. In: ACM Conf. on Computer and Communications Security, ed. Proc. of the 6th ACM Conf. on Computer and Communications Security. Assn for Computing Machinery, 1999.120～127.
  • 5Fagin R, Naor M, Winkler P. Comparing information without leaking it. Communications of the ACM, 1996,39(5):77-85.
  • 6Schneier B. Applied Cryptography: Protocols, Algorithms, and Source Code in C. 2nd ed., John Wiley &amp; Sons, Inc., 1996.
  • 7Cachin C, Micali S, Stadler M. Computationally private information retrieval with polylogarithmic communication. In: Slern J, ed.Proc. of the Advances in Cryptology-EUROCRYPT'99. Lecture Notes in Computer Science, Vo1.1592, Springer-Verlag, 1999.402～414.
  • 8Naccache D, Stern J. A new public-key cryptosystem based on higher residues. In: Association for Computing Machinery, ed. Proc.of the 5th ACM Conf. on Computer and Communications Security. San Francisco: ACM, 1998.59～66.
  • 9Okamoto T, Uchiyama S. A new public key cryptosystem as secure as factoring. In: Nyberg K, ed. Proc. of the Advances in Cryptology-EUROCRYPT'98. Lecture Notes in Computer Science, Vol 1403, Springer-Verlag, 1998. 308～318.
  • 10Paillier P. Public-Key cryptosystem based on composite degree residuosity classes. In: Proc. of the Advances in Cryptology-EUROCRYPT'99. Lecture Notes in Computer Science, Vol 1592, Springer-Verlag, 1999. 223～238.

共引文献48

同被引文献70

引证文献13

二级引证文献52

中国科学：信息科学
2011年 第7期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部