期刊文献+

基于符号OBDD的保护隐私集合运算协议

Privacy-preserving set operations protocols based on symbolic OBDD
在线阅读 下载PDF
导出
摘要 针对保护隐私的集合成员判定协议和集合相等判定协议泄露信息的缺陷,提出基于符号OBDD的解决方案。将集合成员编码成二进制码,提取集合的特征函数;以连分数和Cantor编码为桥梁,将集合编码为自然数,构造该自然数的比较相等函数;利用OBDD表示这2类函数,结合基于OBDD的安全函数评估协议,提出解决保护私有信息的集合相等判定问题和集合成员判定问题的2个协议。所提出的协议克服了已有解决方案存在的安全问题,且有较好的执行效率。 Because the existing set member decision protocol and set equality protocol leak the private information of the sets, the protocols based on ordered binary decision diagram are proposed. The characteristic function of a set is extracted by en- coding the set members into binary code. In addition, using continued fraction and Cantor coding as a bridge, the set is enco- ded into a natural number, and then an equal function of the natural number is constructed. OBDD is used to represent the two kinds of functions, combined with security function evaluation protocols based on the OBDD, set member decision prob- lem and set equality problem are solved. Compared with the existing protocols, the two new ones can solve the security is- sues, and they have good execution efficiency.
出处 《桂林电子科技大学学报》 2015年第4期315-320,共6页 Journal of Guilin University of Electronic Technology
基金 国家自然科学基金(61100025 61262030 61363030) 广西自然科学基金(2014GXNSFAA118354)
关键词 集合成员判定 集合相等 连分数 Cantor编码 set member decision set equality continued fraction Cantor coding
  • 相关文献

参考文献15

  • 1Goldreich O.Foundations of Cryptography,Volume 2,Basic Applications[M].Cambridge:Cambridge University Press,2009:24-29.
  • 2Yao A.Protocols for secure computations[C]//20131EEE 54th Annual Symposium on Foundations of Computer Science,1982:160-164.
  • 3Henecka W,Sadeghi A R,Schneider T,et al.TASTY:tool for automating secure two-party computations[C]//Proceedings of the 17th ACM Conference on Computer and Communications Security,2010:451-462.
  • 4Goldwasser S.Multi-party computations:past and present[C]//Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing,1997:1-6.
  • 5Yao A.How to generate and exchange secrets[C]//27th Annual Symposium on Foundations of Computer Science.IEEE,1986:162-167.
  • 6李顺东,司天歌,戴一奇.集合包含与几何包含的多方保密计算[J].计算机研究与发展,2005,42(10):1647-1653. 被引量:21
  • 7Freedman M J,Nissim K,Pinkas B.Efficient private matching and set intersection[C]//Advances in Cryptology-EUROCRYPT 2004.Springer Berlin Heidelberg,2004:1-19.
  • 8Kissner L,Song D.Privacy-preserving set operations[C]//Advances in Cryptology-CRYPTO 2005,2005:241-257.
  • 9李荣花,武传坤,张玉清.判断集合包含关系的安全计算协议[J].计算机学报,2009,32(7):1337-1345. 被引量:7
  • 10豆永丽,王海春,康剑.集合成员判定问题的安全多方计算解决方案[J].计算机应用,2013,33(12):3527-3530. 被引量:3

二级参考文献31

  • 1Shun-DongLi Yi-QiDai.Secure Two-Party Computational Geometry[J].Journal of Computer Science & Technology,2005,20(2):258-263. 被引量:37
  • 2李顺东,司天歌,戴一奇.集合包含与几何包含的多方保密计算[J].计算机研究与发展,2005,42(10):1647-1653. 被引量:21
  • 3Yao A C. Protocols for secure computations [C]. The 23rd IEEE Symposium on Foundations of Computer Science, Piscataway, USA, IEEE, 1982: 160-164.
  • 4Goldreich O, Micali S, and Wigderson A. How to play ANY mental game[C]. The 19th Annual ACM Conference on Theory of Computing, New York, 1987: 218-229.
  • 5Goldreich O. Foundations of Cryptography: Basic Applications[M]. London: Cambridge University Press, 2004: 599-729.
  • 6Dachman-Soled D, Malkin T, Raykova M, et al. Efficient robust private set intersection [C]. ACNS '09, 2009, LNCS, 5536: 125-142.
  • 7Shor P W. .Polynomial-time algorithm for prime factorizeation and discrete logarithm on a quantum computer [J]. SIAM Journal on Computing, 1997, 26(5): 1484-1509.
  • 8Gentry C, Peikert C, and Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions[C]. STOC'08, Victoria, BC, Canada, ACM, 2008: 197-206.
  • 9Regev O. On lattices, learning with errors, random linear codes, and cryptography[J]. Journal of the A CM, 2009, 56(6): 1-40.
  • 10Peikert C. Public-key cryptosystems from the worst-case shortest vector problem[C]. STOC'09, Maryland, USA, ACM 2009:333 342.

共引文献34

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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