期刊文献+

基于阈值的向量保密计算

Secure Vector Computation Based on Threshold
下载PDF
导出
摘要 向量保密计算已成为安全多方计算的重要研究课题.对于向量优势与向量等分量数这类问题,现有的相关计算协议大多都是在有全集限制的条件下,通过编码方法设计的.当数据范围较大较分散时,此类方法具有一定的局限性.本文针对向量中数据没有全集限制的情形,提出并研究向量优势阈值问题以及向量等分量数阈值问题的双方保密计算.通过灵活运用加密算法的同态性质以及明文空间的有关性质,结合问题转化以及加密选择等技巧,对于向量优势阈值问题设计了安全高效的保密计算协议.当设置阈值为向量维数时,本文协议可用于解决向量优势判定问题,且与已有协议相比具有更高的效率.在向量优势阈值协议的基础上,进一步构造向量等分量数阈值问题的计算协议,并通过严格分析证明了本文协议的正确性,应用模拟范例严格证明了协议的安全性.最后,对协议的效率进行了详细的分析比较,并通过实验验证了协议的实际可行性. Secure vector computation has become an important problem in secure multiparty computation.For vector dominance and equal problems,most of the existing computation protocols are designed by coding methods under the condition that the private data belong to a known set.When the data range is large and scattered,such methods have certain limitations.In this paper,the problem of threshold vector dominance and threshold vector problem with equal number of components under the condition that the components of the private vectors do not belong to a known set are proposed.By using the homomorphism property of some encryption algorithms,the flexibility of plaintext space,and the methods of problem transformation and encrypt-and-choose,a secure and efficient computation protocol for threshold vector dominance problem is designed.Based on this,a protocol for threshold vector problem with equal number of components is constructed,and the security of the protocol is proven using the simulation paradigm,the efficiency of the protocol is analyzed,and the practical feasibility of the protocol is verified by the experiments.
作者 王颖囡 窦家维 葛雪 WANG Ying-Nan;DOU Jia-Wei;GE Xue(School of Mathematics and Information Science,Shaanxi Normal University,Xi’an 710119,China)
出处 《密码学报》 CSCD 2020年第6期750-762,共13页 Journal of Cryptologic Research
基金 国家自然科学基金(61272435)。
关键词 安全多方计算 两方保密计算 向量优势阈值 半诚实模型 语义安全 secure multiparty computation two-party private computation vector dominance threshold semi-honest model semantic security
  • 相关文献

参考文献4

二级参考文献31

  • 1李顺东,戴一奇,游启友.姚氏百万富翁问题的高效解决方案[J].电子学报,2005,33(5):769-773. 被引量:43
  • 2秦波,秦慧,周克复,王晓峰,王育民.常数复杂性的百万富翁协议[J].西安理工大学学报,2005,21(2):149-152. 被引量:13
  • 3罗永龙,黄刘生,荆巍巍,徐维江.空间几何对象相对位置判定中的私有信息保护[J].计算机研究与发展,2006,43(3):410-416. 被引量:44
  • 4A Yao.Protocols for secure computation.Proceeding of the 23th IEEE Symposium on Foundations of Computer Science.Los Alamitos,CA:IEEE Computer Society Press,1982.160-164.
  • 5C Cachin.Efficient private bidding and auctions with an oblivious third party.Proceedings of the 6th ACM Conference on Computer and Communications Security.New York:ACM Press,1999.120-127.
  • 6H Y Lin,W G Tzeng.An efficient solution to the millionaires problem based on homomorphic Encryption.Proceedings of the 4th International Conference on Applied Cryptography and Networks Security.New York:Springer-Verlag,2005.456-466.
  • 7R Fagin,M Naor,P Winkler.Comparing information without leaking it[J].Communications of the ACM,1996,39(5):77-85.
  • 8I Ioannidis,A Grama.An efficient protocol for Yao's millionaires' problem.In Proceedings of the 36th Annual Hawaii International Conference on System Sciences.Los Alamitos:IEEE Computer Society Press,2003.205.
  • 9Shundong Li,Daoshun Wang,Yiqi Dai,Ping Luo.Symmetric cryptographic solution to yao's millionaires' problem and an evaluation of secure multiparty computations[J].Information Sciences.2008,178(1):244-255.
  • 10O Goldreich,S Micali,A Wigderson.How to play any mental game.In Proceedings of the 19th Annual ACM Conference on Theory of Computing.New York:ACM,1987.218-229.

共引文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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