Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 413265, 7 pages
http://dx.doi.org/10.1155/2014/413265
Research Article

Two-Cloud-Servers-Assisted Secure Outsourcing Multiparty Computation

1State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
2Brain Image Processing, Columbia University, New York, NY 10032, USA

Received 19 February 2014; Accepted 13 April 2014; Published 28 May 2014

Academic Editors: A. Miné and B. Sun

Copyright © 2014 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.
  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 Scopus
  3. O. S. Goldreich, S. Mical, and A. Wigderson, “How to play any mental game,” in Proceedings of the nineteenth annual ACM symposium on Theory of computing (STOC '87), pp. 218–229, New York, NY, USA, 1987.
  4. O. S. Goldreich, “Secure multiparty computation,” Manuscript, Preliminary version, 1998.
  5. O. S. Goldreich, Foundations of Cryptography: Volume 2, Basic Applications, Cambridge University press, 2004.
  6. M. M. Prabhakaran and A. Sahai, Eds., Secure Multiparty Computation, IOS Press, 2013.
  7. R. Fagin, M. Naor, and P. Winkler, “Comparing information without leaking it,” Communications of the ACM, vol. 39, pp. 77–85, 1996. View at Google Scholar
  8. D. Chaum, C. Crépeau, and I. Damgård, “Multiparty unconditionally secure protocols,” in Proceedings of the 20th annual ACM symposium on Theory of computing (STOC '88), pp. 11–19, 1988. View at Publisher · View at Google Scholar
  9. I. Damgård, V. Pastro, N. P. Smart, and S. Zakarias, “Multiparty computation from somewhat homomorphic encryption,” in Advances in Cryptology—CRYPTO 2012, vol. 7417 of Lecture Notes in Computer Science, pp. 643–662, Springer, 2012. View at Google Scholar
  10. Y. Lindell and B. Pinkas, “An efficient protocol for secure two-party computation in the presence of malicious adversaries,” in Advances in Cryptology—EUROCRYPT 2007, vol. 4515 of Lecture Notes in Computer Science, pp. 52–78, Springer, 2007. View at Google Scholar
  11. B. Pinkas, T. Schneider, N. P. Smart, and S. C. Williams, “Secure two-party computation is practical,” in Advances in Cryptology—ASIACRYPT 2009, vol. 5912 of Lecture Notes in Computer Science, pp. 250–267, Springer, 2009. View at Google Scholar
  12. M. Armbrust, A. Fox, R. Griffith et al., “A view of cloud computing,” Communications of the ACM, vol. 53, no. 4, pp. 50–58, 2010. View at Publisher · View at Google Scholar · View at Scopus
  13. T. Velte, A. Velte, and R. Elsenpeter, Cloud Computing, a Practical Approach, McGraw-Hill, 2009.
  14. J. Loftus and N. P. Smart, “Secure outsourced computation,” in Progress in Cryptology—AFRICACRYPT 2011, pp. 1–20, Springer, Berlin, Germany, 2011. View at Google Scholar
  15. M. J. Atallah and K. B. Frikken, “Securely outsourcing linear algebra computations,” in Proceedings of the 5th ACM Symposium on Information, Computer and Communication Security (ASIACCS '10), pp. 48–59, April 2010. View at Publisher · View at Google Scholar · View at Scopus
  16. S. Kamara, P. Mohassel, and M. Raykova, “Outsourcing multiParty computation,” IACR Cryptology ePrint Archive, vol. 2011, article 272, 2011. View at Google Scholar
  17. A. Peter, E. Tews, and S. Katzenbeisser, “Efficiently outsourcing multiparty computation under multiple keys,” IACR Cryptology ePrint Archive, vol. 2013, article 13, 2013. View at Google Scholar
  18. B. Wang, M. Li, M. Chow et al., “Computing encrypted cloud data efficiently under multiple keys,” in Proceedings of the IEEE Conference on Communications and Network Security (CNS '13), pp. 504–513, 2013.
  19. M. Van Dijk and A. Juels, “On the impossibility of cryptography alone for privacy-preserving cloud computing,” in Proceedings of the 5th USENIX conference on Hot topics in security (HotSec '10), pp. 1–8, 2010.
  20. C. Gentry, A fully homomorphic encryption scheme [Doctoral dissertation], Stanford University, 2009.
  21. G. Asharov, A. Jain, A. López-Alt, E. Tromer, V. Vaikuntanathan, and D. Wichs, “Multiparty computation with low communication, computation and interaction via threshold fhe,” in Advances in Cryptology—EUROCRYPT 2012, Lecture Notes in Computer Science, pp. 483–501, Springer, Berlin, Germany, 2012. View at Google Scholar
  22. S. Halevi, Y. Lindell, and B. Pinkas, “Secure computation on the web: computing without simultaneous interaction,” in Advances in Cryptology—CRYPTO 2011, pp. 132–150, Springer, 2011. View at Google Scholar
  23. Z. Brakerski and V. Vaikuntanathan, “Efficient fully homomorphic encryption from (standard) LWE,” in Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS '11), pp. 97–106, 2011.
  24. A. López-Alt, E. Tromer, and V. Vaikuntanathan, “Cloud-assisted multiparty computation from fully homomorphic encryption,” IACR Cryptology ePrint Archive, vol. 2011, article 663, 2011. View at Google Scholar
  25. Z. Brakerski and V. Vaikuntanathan, “Fully homomorphic encryption from ring-lwe and security for key dependent messages,” in Advances in Cryptology—CRYPTO 2011, vol. 6841 of Lecture Notes in Computer Science, pp. 505–524, 2011. View at Google Scholar