A Secure Scalar Product Protocol Against Malicious Adversaries

被引:4
|
作者
Yang, Bo [1 ]
Yu, Yong [2 ]
Yang, Chung-Huang [3 ]
机构
[1] Shaanxi Normal Univ, Sch Comp Sci, Xian 710062, Peoples R China
[2] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Chengdu 610054, Peoples R China
[3] Natl Kaohsiung Normal Univ, Grad Inst Informat & Comp Educ, Kaohsiung, Taiwan
基金
中国国家自然科学基金;
关键词
secure multi-party computation; secure scalar product protocol; verifiable encryption; COMPUTATION;
D O I
10.1007/s11390-013-1319-3
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A secure scalar product protocol is a type of specific secure multi-party computation problem. Using this kind of protocol, two involved parties are able to jointly compute the scalar product of their private vectors, but no party will reveal any information about his/her private vector to another one. The secure scalar product protocol is of great importance in many privacy-preserving applications such as privacy-preserving data mining, privacy-preserving cooperative statistical analysis, and privacy-preserving geometry computation. In this paper, we give an efficient and secure scalar product protocol in the presence of malicious adversaries based on two important tools: the proof of knowledge of a discrete logarithm and the verifiable encryption. The security of the new protocol is proved under the standard simulation-based definitions. Compared with the existing schemes, our scheme offers higher efficiency because of avoiding inefficient cut-and-choose proofs.
引用
收藏
页码:152 / 158
页数:7
相关论文
共 50 条
  • [21] Research on Secure Scalar Product Protocol and its' Application
    Xu, Fen
    Zeng, Shuai
    Luo, Shoushan
    Wang, Cong
    Xin, Yang
    Guo, Yucui
    [J]. 2010 6TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS NETWORKING AND MOBILE COMPUTING (WICOM), 2010,
  • [22] Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
    Hazay, Carmit
    Toft, Tomas
    [J]. JOURNAL OF CRYPTOLOGY, 2014, 27 (02) : 358 - 395
  • [23] Post-quantum secure two-party computing protocols against malicious adversaries
    Huo, Yachao
    Zhao, Zongqu
    Qin, Panke
    Wang, Shujing
    Zheng, Chengfu
    [J]. Concurrency and Computation: Practice and Experience, 2024, 36 (04)
  • [24] k-out-of-n Oblivious transfer protocol with security against malicious adversaries
    Wei, Xiaochao
    Xu, Qiuliang
    Tang, Yi
    [J]. COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2017, 32 (02): : 81 - 91
  • [25] Post-quantum secure two-party computing protocols against malicious adversaries
    Huo, Yachao
    Zhao, Zongqu
    Qin, Panke
    Wang, Shujing
    Zheng, Chengfu
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2024, 36 (04):
  • [26] Fast and Accurate Likelihood Ratio-Based Biometric Verification Secure Against Malicious Adversaries
    Bassit, Amina
    Hahn, Florian
    Peeters, Joep
    Kevenaar, Tom
    Veldhuis, Raymond
    Peter, Andreas
    [J]. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2021, 16 : 5045 - 5060
  • [27] Secure Hamming distance based record linkage with malicious adversaries
    Zhang, Bo
    Cheng, Rong
    Zhang, Fangguo
    [J]. COMPUTERS & ELECTRICAL ENGINEERING, 2014, 40 (06) : 1906 - 1916
  • [28] A Secure Scalar Product Protocol and Its Applications to Computational Geometry
    Yang, Bo
    Yang, Chung-Huang
    Yu, Yong
    Xie, Dan
    [J]. JOURNAL OF COMPUTERS, 2013, 8 (08) : 2018 - 2026
  • [29] A protocol for the secure two-party quantum scalar product
    He, Li-Bao
    Huang, Liu-Sheng
    Yang, Wei
    Xu, Rui
    [J]. PHYSICS LETTERS A, 2012, 376 (16) : 1323 - 1327
  • [30] Fast Secure Scalar Product Protocol with (almost) Optimal Efficiency
    Zhu, Youwen
    Wang, Zhikuan
    Hassan, Bilal
    Zhang, Yue
    Wang, Jian
    Qian, Cheng
    [J]. COLLABORATIVE COMPUTING: NETWORKING, APPLICATIONS, AND WORKSHARING, COLLABORATECOM 2015, 2016, 163 : 234 - 242