Constant-Round Client-Aided Secure Comparison Protocol
We present an improved constant-round secure two-party protocol for integer comparison functionality, which is one of the most fundamental building blocks in secure computation.
Our protocol is in the so-called client-server model, which is utilized in real-world MPC products such as Sharemind, where any number of clients can create shares of their input and distribute to the servers who then jointly compute over the shares and return the shares of result to the client. In the client-aided client-server model, as mentioned briefly by Mohassel and Zhang (S&P’17), a client further generates and distributes some necessary correlated randomness to servers. Such correlated randomness admits efficient protocols since otherwise servers have to jointly generate randomness by themselves, which can be inefficient.
In this paper, we improve the state-of-the-art constant-round comparison protocols by Damgård et al. (TCC’06) and Nishide and Ohta (PKC’07) in the client-aided model. Our techniques include identifying correlated randomness in these comparison protocols. Along the way, we also use tree-based techniques for a building block, which deviate from the above two works. Our proposed protocol requires only 5 communication rounds, regardless of the bit length of inputs. This is at least 5 times fewer rounds than existing protocols. We implement our secure comparison protocol in C++. Our experimental results show that this low-round complexity benefits in low-latency networks such as WAN.
KeywordsMulti-party computation Client-server model Client-aided method Less-than comparison Constant rounds GMW secret sharing
This work was supported by JST CREST JPMJCR1688.
- 1.Araki, T., Furukawa, J., Lindell, Y., Nof, A., Ohara, K.: High-throughput semi-honest secure three-party computation with an honest majority. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 805–817 (2016)Google Scholar
- 2.Attrapadung, N., Hanaoka, G., Kiyomoto, S., Mimoto, T., Schuldt, J.C.N.: A taxonomy of secure two-party comparison protocols and efficient constructions. In: 15th Annual Conference on Privacy, Security and Trust, PST 2017, Calgary, Canada, 28–30 August 2017. IEEE (2017)Google Scholar
- 7.Damgård, I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 285–304. Springer, Heidelberg (2006). https://doi.org/10.1007/11681878_15CrossRefGoogle Scholar
- 10.David, B., Dowsley, R., Katti, R., Nascimento, A.C.A.: Efficient unconditionally secure comparison and privacy preserving machine learning classification protocols. In: Au, M.-H., Miyaji, A. (eds.) ProvSec 2015. LNCS, vol. 9451, pp. 354–367. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-26059-4_20CrossRefGoogle Scholar
- 13.Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: 1987 Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 218–229 (1987)Google Scholar
- 14.Mohassel, P., Zhang, Y.: SecureML: a system for scalable privacy-preserving machine learning. In: SP 2017, pp. 19–38 (2017)Google Scholar
- 16.Reistad, T.I.: Multiparty comparison - an improved multiparty protocol for comparison of secret-shared values. In: SECRYPT 2009, pp. 325–330 (2009)Google Scholar
- 19.Rivest, R.L.: Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer (1999, unpublished manuscript)Google Scholar
- 24.Yao, A.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27–29 October 1986, pp. 162–167. IEEE Computer Society (1986)Google Scholar