Abstract
The problem of information comparison is always an important field of SMC. In order to effectively solve the fully equal problem of multi-data for all information, a secure two-party multi-data comparison protocol for equality (STMC) is proposed with the aid of the NTRU encryption. The protocol converts multi-data comparison problem for equality to polynomials comparison for equality. Analysis shows that the protocol is correct and security in semi-honest model. Being STMC as basic building block, a secure multi-party multi-data comparison protocol for equality (SMMC) is proposed. SMMC provides a solution which n participants hope to determine the equality of their private input sets, on the condition of no information leaked. This protocol is proved to be collusion-resistance security. The last, computational complexity and communication complexity of the two protocols are analyzed. It is shown that new protocols have low complexity. We also give applications in the secure multi-party information comparison problem and secure multi-party polynomial comparison problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science, SFCS 1982, pp. 160–164. IEEE (1982). doi:10.1016/0022-2836(81)90087-5
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 218–229. ACM (1987)
Goldreich, O.: Secure multi-party computation [EB/OL] (1998). http://www.wisdom.weizman.ac.il/~oded/pp.html
Liu, W., Wang, Y.B.: Secure multi-party comparing protocol and its applications. Acta Electronica Sinica 40(5), 871–876 (2012). (in chinese)
Tang, Q.Y., Chuan-Gui, M.A., Yan, G.: Comparing private numbers based on fully homomorphic encryption. J. Inf. Eng. Univ. 13(6), 654–657 (2013). (in chinese)
Yang, F., Yang, G., Hao, Y., et al.: Security analysis of multi-party quantum private comparison protocol by model checking. Modern Phys. Lett. B 29(18), 1550089 (2015)
Feng, X.: Secure two-party computation for set intersection and set equality problems based on LWE. J. Electron. Inf. Technol. 34(2), 462–467 (2012). (in chinese)
Hazay, C.: Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 90–120. Springer, Heidelberg (2015). doi:10.1007/978-3-662-46497-7_4
Neugebauer, G., Brutschy, L., Meyer, U., Wetzel, S.: Privacy-preserving multi-party reconciliation secure in the malicious model. In: Garcia-Alfaro, J., Lioudakis, G., Cuppens-Boulahia, N., Foley, S., Fitzgerald, W.M. (eds.) DPM/SETOP-2013. LNCS, vol. 8247, pp. 178–193. Springer, Heidelberg (2014). doi:10.1007/978-3-642-54568-9_12
Luo, Q.B., Yang, G.W., She, K., et al.: Multi-party quantum private comparison protocol based on d-dimensional entangled states. Quantum Inf. Process. 13(10), 2343–2352 (2014)
Bogdanov, D., Laur, S., Talviste, R.: A practical analysis of oblivious sorting algorithms for secure multi-party computation. In: Bernsmed, K., Fischer-Hübner, S. (eds.) NordSec 2014. LNCS, vol. 8788, pp. 59–74. Springer, Cham (2014). doi:10.1007/978-3-319-11599-3_4
Zhang, L., Li, X.Y., Liu, Y., et al.: Verifiable private multi-party computation: ranging and ranking. In: IEEE Proceedings of INFOCOM 2013, pp. 605–609. IEEE (2013)
Hamada, K., Ikarashi, D., Chida, K., et al.: Oblivious radix sort: an efficient sorting algorithm for practical secure multi-party computation. IACR Cryptol. ePrint Archive 2014, 121 (2014)
Geng, T., Li, H.C., Luo, S.S., et al.: A privacy-preserving dynamic point distance determination protocol and its extension. J. Beijing Univ. Posts Telecommun. 35(3), 47–51 (2012). (in chinese)
López-Alt, A., Tromer, E., Vaikuntanathan, V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Forty-Fourth ACM Symposium on Theory of Computing, pp. 1219–1234. ACM (2012)
Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267–288. Springer, Heidelberg (1998). doi:10.1007/BFb0054868
Babai, L.: On Lovász’ lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1–13 (1986)
Hermans, J., Vercauteren, F., Preneel, B.: Speed records for NTRU. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 73–88. Springer, Heidelberg (2010). doi:10.1007/978-3-642-11925-5_6
Li, S.D., Wang, S.D., Dai, Y.Q., Luo, P.: Multiparty secure computation for comparing two sets. Sci. China Ser. F: Inf. Sci. 39(3), 305–310 (2009). (in chinese)
Acknowledgements
We would like to thank the anonymous reviewers. This work is supported by Asia 3 Foresight Program of the National Natural Science Foundation of China (Grant No. 61411146001).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Zhang, J., Luo, S., Yang, Y. (2017). Secure Multi-party Comparison Protocol and Application. In: Zou, B., Li, M., Wang, H., Song, X., Xie, W., Lu, Z. (eds) Data Science. ICPCSEE 2017. Communications in Computer and Information Science, vol 727. Springer, Singapore. https://doi.org/10.1007/978-981-10-6385-5_25
Download citation
DOI: https://doi.org/10.1007/978-981-10-6385-5_25
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-6384-8
Online ISBN: 978-981-10-6385-5
eBook Packages: Computer ScienceComputer Science (R0)