Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 172718, 5 pages
http://dx.doi.org/10.1155/2013/172718
Research Article

Efficient Secure Multiparty Computation Protocol for Sequencing Problem over Insecure Channel

1State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
2School of Computer Science and Technology, Nanjing Normal University, Nanjing, Jiangsu 210023, China

Received 2 March 2013; Accepted 2 August 2013

Academic Editor: Vishal Bhatnagar

Copyright © 2013 Yi Sun 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 IEEE Symposium on Foundations of Computer Science, pp. 160–164, Chicago, Ill, USA, 1982. View at MathSciNet
  2. Y. Lindell and B. Pinkas, “A proof of security of Yao's protocol for two-party computation,” Journal of Cryptology, vol. 22, no. 2, pp. 161–188, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. O. S. Goldreich, S. Mical, and A. Wigderson, “How to play any mental game,” in Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC ’87), pp. 218–229, ACM, New York, NY, USA, 1987.
  4. 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 Google Scholar · View at Scopus
  5. B. Schoenmakers and P. Tuyls, “Practical two-party computation based on the conditional gate,” in Advances in Cryptology: ASIACRYPT 2004, 10th International Conference on the Theory and Application of Cryptology and Information Security, pp. 119–136, Springer, Jeju Island, Korea, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. I. F. Blake and V. Kolesnikov, “Strong conditional oblivious transfer and computing on intervals,” in Advances in Cryptology: ASIACRYPT 2004, 10th International Conference on the Theory and Application of Cryptology and Information Security, pp. 515–529, Springer, Jeju Island, Korea, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. Y. L. Luo, Some key issues in secure multi-party computation and their applied research [Ph.D. dissertation], University of Science and Technology of China, 2005 (Chinese).
  8. M. Fischlin, “A cost-effective pay-per-multiplication comparison method for millionaires,” in Topics in Cryptology: CT-RSA 2001, The Cryptographers’ Track at RSA Conference 2001, pp. 457–471, Springer, San Francisco, Calif, USA, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. C. Cachin, “Efficient private bidding and auctions with an oblivious third party,” in Proceedings of the 1999 6th ACM Conference on Computer and Communications Security, pp. 120–127, ACM, New York, NY, USA, November 1999. View at Scopus
  10. J. Qin, Z.-F. Zhang, D.-G. Feng, and B. Li, “Protocol of comparing information without leaking,” Journal of Software, vol. 15, no. 3, pp. 421–427, 2004. View at Google Scholar · View at Scopus
  11. H. Y. Lin and W. G. Tzeng, “An efficient solution to the millionaires problem based on homomorphic encryption,” ASIACRYPT 2005, http://eprint.iacr.org/2005/043.
  12. I. Ioannidis and A. Grama, “An efficient protocol for Yao’s Millionaires’ problem,” in Proceedings of the 36th Hawaii International Conference on System Sciences, Maui, Hawaii, USA, 2003, Track 7.
  13. M. Held and R. M. Karp, “A dynamic programming approach to sequencing problems,” Journal of the Society for Industrial and Applied Mathematics, vol. 10, pp. 196–210, 1962. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. C. Tang, G. Shi, and Z. Yao, “Secure multi-party computation protocol for sequencing problem,” Science China. Information Sciences, vol. 54, no. 8, pp. 1654–1662, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. R. L. Rivest, L. Adleman, and M. L. Dertouzos, “On data banks and privacy homomorphisms,” in Foundations of Secure Computation, pp. 169–179, Academic Press, 1978. View at Google Scholar · View at MathSciNet
  16. C. Fontaine and F. Galand, “A survey of homomorphic encryption for nonspecialists,” Eurasip Journal on Information Security, vol. 2007, Article ID 13801, 2007. View at Publisher · View at Google Scholar · View at Scopus
  17. 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–11, 1988.