计算机工程与应用2015，Vol.51Issue(24)：109-113,5.DOI:10.3778/j.issn.1002-8331.1312-0204
恶意模型下计算欧几里德距离的协议
Secure Euclidean distance computation in presence of malicious adversaries
摘要
Abstract
Secure Multiparty Computation(MPC)deals with protocols that allow a group of agents to jointly compute a function of their individual private inputs. Nothing is revealed except the value of function in the end. Even though Yao and Goldreich et al.(STOC'87)have already proposed the general solution of any function, the general MPC has been proven to be inefficient and impractical. It is necessary to construct special MPC protocol for special problem. In this paper, a new scheme which can evaluate the Euclidean distance between two vectors is proposed. This scheme is based on distributed EI Gamal encryption, and is proven secure in the hybrid model. Compared with the previous schemes, this scheme has lower computation and communication complexity. It can be suitable to the circumstances which are computation and communication limited.关键词
安全多方计算/欧几里德距离/分布式EIGamal加密Key words
secure multiparty computation/Euclidean distance/distributed EI Gamal encryption分类
信息技术与安全科学引用本文复制引用
杨得新,刘力铭,杨波..恶意模型下计算欧几里德距离的协议[J].计算机工程与应用,2015,51(24):109-113,5.基金项目
国家自然科学基金(No.61272436,No.61370224) （No.61272436,No.61370224）
广东省自然科学基金(No.10351806001000000) （No.10351806001000000）
广东教育研究院项目(No.GDJY-2014-B-b278) （No.GDJY-2014-B-b278）
广州市教育局项目(No.1201421409). （No.1201421409）
