Abstract
Private comparison is fundamental to secure multiparty computation. In this study, we propose novel protocols to privately determine $$x>y, x<y$$ , or $$x=y$$ in one execution. First, a 0–1-vector encoding method is introduced to encode a number into a vector, and the Goldwasser–Micali encryption scheme is used to compare integers privately. Then, we propose a protocol by using a geometric method to compare rational numbers privately, and the protocol is information-theoretical secure. Using the simulation paradigm, we prove the privacy-preserving property of our protocols in the semi-honest model. The complexity analysis shows that our protocols are more efficient than previous solutions.
Funding Information
  • National Natural Science Foundation of China (61272435, 61272514)
  • Fundamental Research Funds for the Central Universities (GK201504017)
  • Fundamental Research Funds of Science and Technology of Baotou (2014S2004-2-1-15)

This publication has 29 references indexed in Scilit: