Skip to main content
Log in

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.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. 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

    Google Scholar 

  2. 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

    Chapter  Google Scholar 

  3. Goldreich O. Foundations of Cryptography: Basic Applications. London: Cambridge University Press, 2004. 599–729

    MATH  Google Scholar 

  4. 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

    Google Scholar 

  5. 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

    Chapter  Google Scholar 

  6. 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

    MATH  Google Scholar 

  7. 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

    Google Scholar 

  8. 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

    Article  MATH  Google Scholar 

  9. 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

    Google Scholar 

  10. 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

    MATH  MathSciNet  Google Scholar 

  11. Kalyanasundaram B, Schnitger G. The probabilistic communication complexity of set intersection. SIAM J Discrete Math, 1992, 5(4): 545–557

    Article  MATH  MathSciNet  Google Scholar 

  12. 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

    Google Scholar 

  13. Fagin R, Naor M, Einkler P. Comparing information without leaking it. Commun ACM, 1996, 39(5): 77–85

    Article  Google Scholar 

  14. Davis M D, Weyuker E J. Computability, Complexity and Language. New York: Academic Press Inc. 1983. 34–80

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to ShunDong Li.

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

Reprints 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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-008-0112-3

Keywords

Navigation