Advertisement

Symmetric cryptographic protocols for extended millionaires’ problem

  • ShunDong LiEmail author
  • DaoShun Wang
  • YiQi Dai
Article

Abstract

Yao’s millionaires’ problem is a fundamental problem in secure multiparty computation, and its solutions have become building blocks of many secure multiparty computation solutions. Unfortunately, most protocols for millionaires’ problem are constructed based on public cryptography, and thus are inefficient. Furthermore, all protocols are designed to solve the basic millionaires’ problem, that is, to privately determine which of two natural numbers is greater. If the numbers are real, existing solutions do not directly work. These features limit the extensive application of the existing protocols. This study introduces and refines the first symmetric cryptographic protocol for the basic millionaires’ problem, and then extends the symmetric cryptographic protocol to privately determining which of two real numbers is greater, which are called the extended millionaires’ problem, and proposes corresponding protocols. We further prove, by a well accepted simulation paradigm, that these protocols are private. Constructed based on symmetric cryptography, these protocols are very efficient.

Keywords

cryptography secure multiparty computation extended millionaires’ problem symmetric cryptography simulation paradigm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Yao Y. Protocols for secure computations. In: Proceedings of the 23th IEEE Symposium on Foundations of Computer Science, Los Alamitos: IEEE Computer Society Press, 1982. 160–164Google Scholar
  2. 2.
    Freedman M J, Nissim K, Pinkas B. Efficient private matching and set intersection. In: Cachin C, ed. Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques (LNCS 3027). New York: Springer-Verlag, 2004. 1–55, 419–473Google Scholar
  3. 3.
    Goldwasser S. Multiparty computations: Past and present. In: Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing. New York: ACM Press, 1997. 21–24Google Scholar
  4. 4.
    Goldreich O, Micali S, Wigderson A. How to play ANY mental game. In: Proceedings of the 19th Annual ACM Conference on Theory of Computing. New York: ACM Press, 1987. 218–229Google Scholar
  5. 5.
    Goldreich O. The Foundations of Cryptography-Volume 2. London: Cambridge University Press, 2004Google Scholar
  6. 6.
    Fagin R, Naor M, Winkler P. Comparing information without leaking it. Commun ACM, 1996, 39(5): 77–85CrossRefGoogle Scholar
  7. 7.
    Lindell Y, Pinkas B. Privacy preserving data mining. J Crypt, 2002, 15(3): 177–206CrossRefMathSciNetzbMATHGoogle Scholar
  8. 8.
    Zhong S. Privacy-preserving algorithms for distributed mining of frequent item sets. Inf Sci, 2007, 177): 490–503CrossRefzbMATHGoogle Scholar
  9. 9.
    Du W L, Atallah M J. Privacy-preserving cooperative scientific computations. In: Proceedings of the 14th IEEE Computer Security Workshop. Los Alamitos: IEEE Computer Society Press, 2001. 273–282Google Scholar
  10. 10.
    Du W L, Atallah M J. Protocol for secure remote database access with approximate matching. In: The 7th ACM Conference on Computer and Communication Security, The First Workshop on Security and Privacy in E-Commerce. New York: ACM Press, 2000. available at http://www.cis.syr.edu/wedu/Research/publication.html [2005-02-25]Google Scholar
  11. 11.
    Cachin C. Efficient private bidding and auction with an obvious third party. In: Proceedings of the 6th ACM Conference on Computer and Communication Security. New York: ACM Press, 1999. 120–127CrossRefGoogle Scholar
  12. 12.
    Shih D H, Huang H Y, Yen D C. A secure reverse Vickrey auction scheme with bid privacy. Inf Sci, 2006, 177): 550–564CrossRefMathSciNetGoogle Scholar
  13. 13.
    Du W L, Han Y H S, Chen S G. Privacy-preserving multivariate statistical analysis: linear regression and classification. In: Proceedings of 2004 SIAM International Conference on Data Mining. Society for Industrial & Applied, 2004. 222–233Google Scholar
  14. 14.
    Atallah J, Du W L. Secure multiparty computational geometry. In: Seventh International Workshop on Algorithms and Data Structures (LNCS2125). New York: Springer-verlag, 2001. 165–179CrossRefGoogle Scholar
  15. 15.
    Li S D, Dai Y Q. Secure two-party computational geometry. J Comput Sci Tech, 2005, 20(2): 258–263CrossRefMathSciNetGoogle Scholar
  16. 16.
    Li S D, Dai Y Q, Wang D S, et al. Secure multiparty computation of some geometric intersection problems. J Tsinghua Univ, 2007, 47(10): 1692–1695MathSciNetzbMATHGoogle Scholar
  17. 17.
    Freedman M J, Nissim K, Pinkas B. Efficient private matching and set intersection. In: Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques (LNCS 3027). New York: Springer-Verlag, 2004. 1–19Google Scholar
  18. 18.
    Du W L, Atallah M J. secure multiparty computation problems and their applications: a review and open problems. In: Proceedings of New Security Paradigms Workshop 2001. New York: ACM Press, 2001. 13–22CrossRefGoogle Scholar
  19. 19.
    Ioannidis I, Grama A. An efficient protocol for Yao’s millionaires’ problem. In: Proceedings of the 36th Hawaii International Conference on System Science. Los Alamitos: IEEE Computer Society Press, 2003. 205CrossRefGoogle Scholar
  20. 20.
    Li S D, Dai Y Q, You Q Y. Efficient secure multiparty computation protocol for Yao’s millionaires’ problem based on setinclusion. Prog Nat Sci, 2005, 15(9): 851–856CrossRefMathSciNetzbMATHGoogle Scholar
  21. 21.
    Li S D, Dai Y Q, You Q Y. Efficient solution to Yao’s millionaires’ problem. Electr Sin, 2005, 33(5): 769–773Google Scholar
  22. 22.
    Li S D, Wang D S, Dai Y Q, et al. Symmetric cryptographic solution to Yao’s millionaires’ problem and an evaluation of secure multiparty computations. Inf Sci, 2008, 178): 244–255CrossRefMathSciNetzbMATHGoogle Scholar

Copyright information

© Science in China Press and Springer-Verlag GmbH 2009

Authors and Affiliations

  1. 1.School of Computer ScienceShaanxi Normal UniversityXi’anChina
  2. 2.Department of Computer Science and TechnologyTsinghua UniversityBeijingChina

Personalised recommendations