Securely outsourcing linear algebra computations

Proceedings of the 5th International Symposium on Information, Computer and Communications Security, ASIACCS 2010

Volumn , Issue , 2010, Pages 48-59

  Atallah, Mikhail J ^a   Frikken, Keith B ^b  

^a Purdue University   (United States)

^b MIAMI UNIVERSITY   (United States)

Author keywords

computational outsourcing; cryptographic protocols; privacy

Indexed keywords

ALGEBRAIC COMPUTATIONS; COMPUTATIONAL BURDEN; COMPUTATIONAL WORK; CRYPTOGRAPHIC COMPUTATIONS; CRYPTOGRAPHIC PRIMITIVES; CRYPTOGRAPHIC PROTOCOLS; HIGH PROBABILITY; HOMOMORPHIC-ENCRYPTIONS; OUTSOURCE; REMOTE SERVERS; SINGLE SERVER; TIME COMPLEXITY;

ALGEBRA; CRYPTOGRAPHY; NETWORK PROTOCOLS; OUTSOURCING; SERVERS;

NETWORK SECURITY;

EID: 77954521120     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1755688.1755695     Document Type: Conference Paper

References (32)

1. M. Abadi, J. Feigenbaum, and J. Kilian. On hiding information from an oracle. In Proceedings of the nineteenth annual ACM conference on Theory of computing, pages 195-203. ACM Press, 1987.
2. Karl R. Abrahamson. Generalized string matching. SIAM J. Comput., 16(6):1039-1051, 1987.
3. M. J. Atallah, K. N. Pantazopoulos, J. Rice, and E. H. Spafford. Secure outsourcing of scientific computations. Advances in Computers, 54(6):215-272, 2001.
4. Mikhail J. Atallah and Jiangtao Li. Secure outsourcing of sequence comparisons. In International Journal of Information Security, pages 277-287, 2005.
5. P. Beguin and J. J. Quisquater. Fast server-aided rsa signatures secure against active attacks. In CRYPT0 95, pages 57-69, 1995.
6. David Benjamin and Mikhail J. Atallah. Private and cheating-free outsourcing of algebraic computations. In Sixth Annual Conference on Privacy, Security and Trust, PST 2008, October 1-3, 2008, Fredericton, New Brunswick, Canada, pages 240-245, 2008.
7. A. Boettcher and S.M. Grudsky. Toeplitz Matrices, Asymptotic Linear Algebra, and Functional Analysis. Birkhauser, 2000.
8. Ran Canetti, Yuval Ishai, Ravi Kumar, Michael Reiter, Ronitt Rubinfeld, and Rebecca Wri ght. Selective private function evaluation with applications to private statistics. In Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, pages 293-304. ACM Press, 2001.
9. Ivan Damgård and Mads Jurik. A generalisation, a simplification and some applications of paillier's probabilistic public-key system. In PKC '01: Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography, pages 119-136. Springer, 2001.
10. I. Damgård and Y. Ishai. Constant-round multiparty computation using a black-box pseudorandom generator. In Advances in Cryptology (CRYPT0 05), volume LNCS 3621, pages 378-394. Springer-Verlag, 2005.
11. Ivan Damgård and Yuval Ishai. Constant-round multiparty computation using a black-box pseudorandom generator. In Advances in Cryptology (CRYPT0 05), volume LNCS 3621, pages 378-394. Springer-Verlag, 2005.
12. W. Du and M.J. Atallah. Privacy-preserving cooperative statistical analysis. In Proc. 17th Annual Computer Security Applications Conference (ACSAC 01), pages 102-110, New Orleans, Louisiana, December 2001.
13. Wenliang Du and Michael T. Goodrich. Searching for high-value rare events with uncheatable grid computing. In Proc. ACNS, pages 122-137, 2005.
14. Wenliang Du, Jing Jia, Manish Mangal, and Mummoorthy Murugesan. Uncheatable grid computing. In Proc. ICDCS, pages 4-11, 2004.
15. B. Goethals, S. Laur, H. Lipmaa, and T. Mielikainen. On private scalar product computation for privacy-prerving data mining. In The 7th Annual International Conference on Information Security and Cryptology (ICISC 2004), 2004.
16. Oded Goldreich. Foundations of Cryptography: Volume I Basic Tools. Cambridge University Press, 2001.
17. Oded Goldreich. Foundations of Cryptography: Volume II Basic Application. Cambridge University Press, 2004.
18. Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game. In Proceedings of the nineteenth annual ACM conference on Theory of computing, pages 218-229. ACM Press, 1987.
19. Susan Hohenberger and Anna Lysyanskaya. How to securely outsource cryptographic computations. In Theory of Cryptography Conference (TCC'05), volume 3378 of LNCS, pages 264-282, 2005.
20. Jonathan Katz and Rafail Ostrovsky. Round optimal secure two-party computation. In CRYPTO 04, 2004.
21. S. I. Kawamura and A. Shimbo. Fast server-aided secret computation protocols for modular exponentiation. IEEE Journal on Selected Areas in Communications, 11(5):778-784, 1993.
22. C. H. Lim and P. J. Lee. Security and performance of server-aided rsa computation protocols. In CRYPT0 95, pages 70-83, 1995.
23. Yehuda Lindell. Parallel coin-tossing and constant-round secure two-party computation. Lecture Notes in Computer Science, 2139:171-189, 2001.
24. Dahlia Malkhi, Noam Nisan, Benny Pinkas, and Yaron Sella. Fairplay - a secure two-party computation system. In Proceedings of Usenix Security, 2004.
25. T. Matsumoto, K. Kato, and H. Imai. Speeding up secret computations with insecure auxiliary devices. In CRYPT0 88, pages 497-506, 1988.
26. Pascal Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology: EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 223-238. Springer, 1999.
27. B. Pfitzmann and M. Waidner. Attacks on protocols for server-aided rsa computations. In EUROCRYPT 92, pages 153-162, 1992.
28. R. L. Rivest, L. Adleman, and M. L. Dertouzos. On data banks and privacy homomorphisms. Foundations of Secure Computation, pages 169-177, 1978.
29. Tomas Sander, Adam Young, and Moti Yung. Non-interactive cryptocomputing for NC1. In 40th Annual Symposium on Foundations of Computer Science, pages 554-566, 1999.
30. Adi Shamir. How to share a secret. Commun. ACM, 22(11):612-613, 1979.
31. Andrew C. Yao. Protocols for secure computation. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pages 160-164, 1982.
32. Andrew C. Yao. How to generate and exchange secrets. In Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, pages 162-167, 1986.