期刊文献+

Comparing two sets without disclosing them 被引量:3

Comparing two sets without disclosing them
原文传递
导出
摘要 Secure multiparty computation has become a central research focus in the international cryptographic community. Secure comparing two sets is an important problem in secure multiparty computation. The research on privately determining whether two sets are equal has not been investigated. This study solves the problem by mapping these sets into natural numbers and then comparing correspond- ing numbers, We propose two secure multiparty computation protocols for comparing two sets. It is proved by well-accepted simulation paradigm that these solutions are private in semi-honest model. These solutions have important significance in constructing other secure multiparty computation protocols. Secure multiparty computation has become a central research focus in the international cryptographic community. Secure comparing two sets is an important problem in secure multiparty computation. The research on privately determining whether two sets are equal has not been investigated. This study solves the problem by mapping these sets into natural numbers and then comparing correspond- ing numbers, We propose two secure multiparty computation protocols for comparing two sets. It is proved by well-accepted simulation paradigm that these solutions are private in semi-honest model. These solutions have important significance in constructing other secure multiparty computation protocols.
出处 《Science in China(Series F)》 2008年第9期1231-1238,共8页 中国科学(F辑英文版)
基金 Supported by the National Natural Science Foundation of China (Grant No. 60673065) the High Technology Research and Development Program of China (Grant No. 2005AA114160)
关键词 Cryptography secure multiparty computation set equality problem solution security Cryptography,secure multiparty computation,set equality problem,solution,security
  • 相关文献

参考文献11

  • 1SHEN ChangXiang,ZHANG HuangGuo,FENG DengGuo,CAO ZhenFu,HUANG JiWu.Survey of information security[J].Science in China(Series F),2007,50(3):273-298. 被引量:39
  • 2Yao A.Protocols for secure computations[].Proceeding of the th IEEE Annual Symposium on Foundations of Computer Science.1982
  • 3Goldreich O,,Micali S,Wigderson A.How to play ANY mental game[].Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing.1987
  • 4Goldreich O.Foundations of Cryptography: Basic Applications[]..2004
  • 5Goldwasser S.Multi-party computations: past and present[].Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing.1997
  • 6Du W L,Atallah M J.Secure multiparty computation problems and their applications: A review and open problems[].Proceedings of New Security Paradigms Workshop.2001
  • 7Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques . 2004
  • 8Cramer R.Introduction to secure computation[].Lectures on Data Security-Modern Cryptology in Theory and Practice.1999
  • 9Shen C X,Zhang H G,Feng D G, et al.Survey of information security[].Sci China Ser F-Inf Sci.2007
  • 10Cao Z F,Zhu H J,Lu R X.Robust threshold partial signature with provable security[].Sci China Ser E-Inf Sci.2005

二级参考文献11

共引文献38

同被引文献29

引证文献3

二级引证文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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