Abstract
Secure multiparty computation has become a central research focus in the international cryptographic community. Secure comparing two sets is an important problem in secure multiparty computation. The research on privately determining whether two sets are equal has not been investigated. This study solves the problem by mapping these sets into natural numbers and then comparing corresponding numbers. We propose two secure multiparty computation protocols for comparing two sets. It is proved by well-accepted simulation paradigm that these solutions are private in semi-honest model. These solutions have important significance in constructing other secure multiparty computation protocols.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Yao A. Protocols for secure computations. In: Proceeding of the 23th IEEE Annual Symposium on Foundations of Computer Science. Los Alamitos: IEEE Computer Society Press, 1982. 160–164
Goldreich O, Micali S, Wigderson A. How to play ANY mental game. In: Alfred V A, ed. Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing. New York: ACM Press, 1987. 218–229
Goldreich O. Foundations of Cryptography: Basic Applications. London: Cambridge University Press, 2004. 599–729
Goldwasser S. Multi-party computations: past and present. In: James E B, Hagit A, eds. Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing. New York: ACM Press, 1997. 21–24
Du W L, Atallah M J. Secure multiparty computation problems and their applications: A review and open problems. In: Raskin V, Greenwald S J, Timmerman B, et al. eds. Proceedings of New Security Paradigms Workshop 2001. New York: ACM Press, 2001. 13–22
Cachin C, ed. Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques. New York: Springer-Verlag (LNCS3027), 2004. 1–55, 419–473
Cramer R. Introduction to secure computation. In: Damgaard I, ed. Lectures on Data Security-Modern Cryptology in Theory and Practice. London: Springer-Verlag, 1999. 16–62
Shen C X, Zhang H G, Feng D G, et al. Survey of information security. Sci China Ser F-Inf Sci, 2007, 50(3): 273–298
Cao Z F, Zhu H J, Lu R X. Robust threshold partial signature with provable security. Sci China Ser E-Inf Sci (in Chinese), 2005, 35(12): 1254–1265
Li S D, Jia X L, Dou J W. Secure multi-party computation of set-intersection problem. J Xi’an Jiaotong Univ, 2006, 40 (8): 25–28
Kalyanasundaram B, Schnitger G. The probabilistic communication complexity of set intersection. SIAM J Discrete Math, 1992, 5(4): 545–557
Freedman M J, Nissim K, Pinkas B. Efficient private matching and set intersection. In: Cachin C, ed. Proceedings of Intal Conference on the Theory and Applications of Cryptographic Techniques. New York: Springer-Verlag, 2004. 1–19
Fagin R, Naor M, Einkler P. Comparing information without leaking it. Commun ACM, 1996, 39(5): 77–85
Davis M D, Weyuker E J. Computability, Complexity and Language. New York: Academic Press Inc. 1983. 34–80
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China (Grant No. 60673065), and the High Technology Research and Development Program of China (Grant No. 2005AA114160)
Rights and permissions
About this article
Cite this article
Li, S., Dai, Y., Wang, D. et al. Comparing two sets without disclosing them. Sci. China Ser. F-Inf. Sci. 51, 1231–1238 (2008). https://doi.org/10.1007/s11432-008-0112-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-008-0112-3