首页 | 本学科首页   官方微博 | 高级检索  
     

集合包含与几何包含的多方保密计算
引用本文:李顺东,司天歌,戴一奇.集合包含与几何包含的多方保密计算[J].计算机研究与发展,2005,42(10):1647-1653.
作者姓名:李顺东  司天歌  戴一奇
作者单位:清华大学计算机科学与技术系,北京,100084
基金项目:国家自然科学基金重大项目(90304014);国家博士后科学基金项目(2004036248)
摘    要:多方保密计算是近几年国际密码学界研究的一个热点问题.研究了保密的集合包含与几何包含问题,提出集合包含问题的多方保密计算方案,在此基础上结合Montecarlo方法与cantor编码方法,提出了任意几何图形包含问题的近似多方保密计算方案.并利用模拟范例证明了方案的安全性.同已有的方案相比,提出的方案适用范围广、通信复杂性低;在解决已有方案可解决的同样问题时,某些情况下计算复杂性也比较低.

关 键 词:Monte  Carlo方法  Cantor编码  多方保密计算  几何包含  集合包含  计算复杂性  通信复杂性
收稿时间:2004-05-31
修稿时间:2004-05-31

Secure Multi-Party Computation of Set-Inclusion and Graph-Inclusion
Li Shundong,Si Tiange,Dai Yiqi.Secure Multi-Party Computation of Set-Inclusion and Graph-Inclusion[J].Journal of Computer Research and Development,2005,42(10):1647-1653.
Authors:Li Shundong  Si Tiange  Dai Yiqi
Abstract:Secure multi-party computation is a research focus in international cryptographic community. This paper focuses on the secure multi-party computation of set-inclusion and graph-inclusion problems and a secure multi-party computation solution to set-inclusion problem is proposed. Based on this solution and combined with Monte Carlo approach and Cantor encoding, an approximate secure multi-party computation solution to graph-inclusion problem is further proposed. It is proved by simulation paradigm that these solutions are secure. Comparing with known solutions, these solutions can solve more complicated problems and have, with lower communication complexity, more applicability. For some problems that can be solved with known solutions, the new solutions have less computational complexity.
Keywords:Monte Carlo approach  Cantor encoding  secure multi-party computation  graph-inclusion  set-inclusion  computational complexity  communication complexity
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号