Table of Contents Author Guidelines Submit a Manuscript
Security and Communication Networks
Volume 2017, Article ID 9717580, 11 pages
https://doi.org/10.1155/2017/9717580
Research Article

Efficient Secure Multiparty Subset Computation

1School of Computer Science, Shaanxi Normal University, Xi’an 710062, China
2School of Mathematic and Information Science, Shaanxi Normal University, Xi’an 710062, China

Correspondence should be addressed to Shundong Li; nc.ude.unns@gnodnuhs

Received 7 January 2017; Revised 21 April 2017; Accepted 11 June 2017; Published 28 August 2017

Academic Editor: Jimson Mathew

Copyright © 2017 Sufang Zhou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. C. Yao, “Protocols for secure computations,” in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pp. 160–164, 1982. View at MathSciNet
  2. M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness theorems for non-cryptographic fault-tolerant distributed computation,” in Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC '88), pp. 1–10, USA, May 1988. View at Publisher · View at Google Scholar · View at Scopus
  3. C. Bader, D. Hofheinz, T. Jager, E. Kiltz, and Y. Li, “Tightly-secure authenticated key exchange,” in Theory of cryptography, Part I, pp. 629–658, Springer Berlin Heidelberg, 2015. View at Google Scholar
  4. A. Boldyreva, A. Palacio, and B. Warinschi, “Secure proxy signature schemes for delegation of signing rights,” Journal of Cryptology. The Journal of the International Association for Cryptologic Research, vol. 25, no. 1, pp. 57–115, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. Y. Wu, L. Huang, X. Wang, and N. Yu, “An extensible cheat-proofing multi-secret sharing scheme with low computation complexity,” Security and Communication Networks, vol. 7, no. 6, pp. 1042–1048, 2014. View at Publisher · View at Google Scholar · View at Scopus
  6. R. Canetti, H. Lin, and O. Paneth, “Public-coin concurrent zero-knowledge in the global hash model,” in Theory of Cryptography, pp. 80–99, Springer Berlin Heidelberg, 2013. View at Publisher · View at Google Scholar · View at Scopus
  7. Y. Lindell and H. Zarosim, “On the feasibility of extending oblivious transfer,” in Theory of Cryptography, pp. 519–538, Springer Berlin Heidelberg, 2013. View at Publisher · View at Google Scholar · View at Scopus
  8. S. Goldwasser, “Multi-party computations: past and present,” in Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pp. 1–6, ACM Press, New york, NY, USA, 1997. View at Scopus
  9. O. Goldreich, S. Micali, and A. Wigderson, “How to play any mental game,” in Proceedings of the Proceeding of the nineteenth annual ACM conference on Theory of Computing, pp. 218–229, Piscataway, NJ, USA, 1987. View at Publisher · View at Google Scholar
  10. O. Goldreich, Foundations of Cryptography, vol. 2, Cambridge University Press, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  11. Y. Zhang and S. Zhong, “An efficient solution to generalized Yao's millionaires problem,” Bulletin of the Belgian Mathematical Society. Simon Stevin, vol. 20, no. 3, pp. 425–433, 2013. View at Google Scholar · View at MathSciNet
  12. S. Li, D. Wang, Y. Dai, and P. Luo, “Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations,” Information Sciences. An International Journal, vol. 178, no. 1, pp. 244–255, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  13. S. Li, C. Wu, D. Wang, and Y. Dai, “Secure multiparty computation of solid geometric problems and their applications,” Information Sciences. An International Journal, vol. 282, pp. 401–413, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. R. Fagin, M. Naor, and P. Winkler, “Comparing Information Without Leaking It,” Communications of the ACM, vol. 39, no. 5, pp. 77–85, 1996. View at Publisher · View at Google Scholar · View at Scopus
  15. T. Mitsunaga, Y. Manabe, and T. Okamoto, “Efficient secure auction protocols based on the boneh-goh-nissim encryption,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E96-A, no. 1, pp. 68–75, 2013. View at Publisher · View at Google Scholar · View at Scopus
  16. D. Bogdanov, M. Niitsoo, T. Toft, and J. Willemson, “High-performance secure multi-party computation for data mining applications,” International Journal of Information Security, vol. 11, no. 6, pp. 403–418, 2012. View at Publisher · View at Google Scholar · View at Scopus
  17. L. Kissner and D. Song, “Privacy-preserving set operations,” in Advances in cryptology (CRYPTO '05), pp. 241–257, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  18. M. J. Freedman, C. Hazay, K. Nissim, and B. Pinkas, “Efficient set intersection with simulation-based security,” Journal of Cryptology. The Journal of the International Association for Cryptologic Research, vol. 29, no. 1, pp. 115–155, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. J. Hong, J. W. Kim, J. Kim, K. Park, and J. H. Cheon, “Constant-round privacy preserving multiset union,” Bulletin of the Korean Mathematical Society, vol. 50, no. 6, pp. 1799–1816, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. G. Sheng, H. Hou, X. Jiang, and Y. Chen, “A novel association rule mining method of big data for power transformers state parameters based on probabilistic graph model,” IEEE Transactions on Smart Grid, 2016. View at Publisher · View at Google Scholar
  21. J. Camenisch and R. Chaabouni, “Efficient protocols for set membership and range proofs,” in Advances in cryptology (ASIACRYPT '08), pp. 234–252, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  22. J. Camenisch and A. Lysyanskaya, “Dynamic accumulators and application to efficient revocation of anonymous credentials,” in Advances in Cryptology (CRYPTO '02), pp. 61–76, Springer, Berlin, Germany, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  23. R. Cramer, I. Damgard, and B. Schoenmakers, “Proofs of partial knowledge and simplified design of witness hiding protocols,” in Advances in Cryptology (CRYPTO '94), pp. 174–187, Springer, Berlin, Germany, 1994. View at Google Scholar
  24. J. Camenisch and R. Chaabouni, “Efficient protocols for set membership and range proofs,” in Advances in Cryptology-ASIACRYPT, pp. 234–252, Springer Berlin Heidelberg, 2008. View at Google Scholar
  25. M. H. Au, P. P. Tsang, W. Susilo, and Y. Mu, “Dynamic universal accumulators for DDH groups and their application to attribute-based anonymous credential systems,” in Topics in Cryptology-CT-RSA, pp. 295–308, Springer Berlin Heidelberg, 2009. View at Google Scholar
  26. F. Guo, Y. Mu, W. Susilo, and V. Varadharajan, “Membership encryption and its applications,” in Information Security and Privacy, pp. 219–234, Springer Berlin Heidelberg, 2013. View at Google Scholar
  27. F. Guo, Y. Mu, and W. Susilo, “Subset membership encryption and its applications to oblivious transfer,” IEEE Transactions on Information Forensics and Security, vol. 9, no. 7, pp. 1098–1107, 2014. View at Publisher · View at Google Scholar · View at Scopus
  28. P. Paillier, “Public-key cryptosystems based on composite degree residuosity classes,” in Advance in Cryptology-EUROCRYPT '99, pp. 223–238, Springer, LNCS, 1999. View at Google Scholar
  29. Q. Ye, H. Wang, and J. Pieprzyk, “Distributed private matching and set operations,” in International Conference on Information security practice and experience, pp. 347–360, Springer Berlin Heidelberg, 2008. View at Google Scholar
  30. Y. Sang and H. Shen, “Efficient and secure protocols for privacy-preserving set operations,” ACM Transactions on Information and System Security, vol. 13, no. 1, article 9, 2009. View at Publisher · View at Google Scholar · View at Scopus
  31. M. Blanton and E. Aguiar, “Private and oblivious set and multiset operations,” International Journal of Information Security, vol. 15, no. 5, pp. 493–518, 2016. View at Publisher · View at Google Scholar · View at Scopus
  32. M. Bellare, V. T. Hoang, and P. Rogaway, “Foundations of garbled circuits,” in Proceedings of the 2012 ACM Conference on Computer and Communications Security (CCS '12), pp. 784–796, USA, October 2012. View at Publisher · View at Google Scholar · View at Scopus
  33. T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” in Workshop on the Theory and Application of Cryptographic Techniques, pp. 10–18, Springer Berlin Heidelberg, 1984. View at Google Scholar
  34. J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. J. Strauss, and R. N. Wright, “Secure multiparty computation of approximations,” ACM Transactions on Algorithms, vol. 2, no. 3, pp. 435–472, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  35. C. Dong, L. Chen, and Z. Wen, “When private set intersection meets big data: An efficient and scalable protocol,” in Proceedings of the ACM SIGSAC Conference on Computer and Communications Security (CCS '13), pp. 789–800, 2013. View at Publisher · View at Google Scholar · View at Scopus
  36. K. Christensen, A. Roginsky, and M. Jimeno, “A new analysis of the false positive rate of a Bloom filter,” Information Processing Letters, vol. 110, no. 21, pp. 944–949, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  37. P. Bose, H. Guo, E. Kranakis et al., “On the false-positive rate of Bloom filters,” Information Processing Letters, vol. 108, no. 4, pp. 210–213, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  38. A. Broder and M. Mitzenmacher, “Network applications of Bloom filters: a survey,” Internet Mathematics, vol. 1, no. 4, pp. 485–509, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus