Secure and verifiable outsourcing of large-scale biometric computations

Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011

Volumn , Issue , 2011, Pages 1185-1191

  Blanton, Marina ^a   Zhang, Yihua ^a   Frikken, Keith B ^b  

^a University of Notre Dame   (United States)

^b MIAMI UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTING SERVICES; HIGH PROBABILITY; LARGE SCALE COMPUTATION; SECURITY AND PRIVACY; US ECONOMY;

BIOMETRICS; ECONOMICS; OUTSOURCING;

CLOUD COMPUTING;

EID: 84862973844     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PASSAT/SocialCom.2011.13     Document Type: Conference Paper

References (23)

1. IT cloud services user survey, pt. 2: Top benefits & challenges. http://blogs.idc.com/ie/?p=210.
2. M. Atallah and K. Frikken. Securely outsourcing linear algebra computations. In ACM Symposium on Information, Computer and Communications Security, pages 48-59, 2010.
3. M. Barni, T. Bianchi, D. Catalano, M. Di Raimondo, R. Labati, P. Failla, D. Fiore, R. Lazzeretti, V. Piuri, F. Scotti, and A. Piva. Privacy preserving finger code authentication. In ACM Workshop on Multimedia and Security (MM&Sec), pages 231-240, 2010.
4. D. Benjamin and M. Atallah. Private and cheating-free outsourcing of algebraic computations. In Annual Conference on Privacy, Security, and Trust (PST), pages 240-245, 2008.
5. M. Blanton and E. Aguiar. Private and oblivious set and multiset operations. ePrint Cryptology Archive 2011/464, 2011.
6. M. Blanton and M. Aliasgari. Secure outsourced computation of iris matching. ePrint Cryptology Archive 2011/462, 2011.
7. M. Blanton, Y. Zhang, and K. Frikken. Secure and verifiable outsourcing of large-scale biomeric computations. Technical Report 2011-04, Department of Computer Science and Engineering, University of Notre Dame, 2011.
8. H. Bui, M. Kelly, C. Lyon, M. Pasquier, D. Thomas, P. Flynn, and D. Thain. Experience with BXGrid: A data repository and computing grid for biometrics research. Journal of Cluster Computing, 12(4):373- 386, 2009.
9. O. Catrina and S. de Hoogh. Improved primitives for secure multiparty integer computation. In International Conference on Security and Cryptography in Networks (SCN), pages 182-199, 2010.
10. W. Du and M. Goodrich. Searching for high-value rare events with uncheatable grid computing. In Applied Cryptography and Network Security, pages 122-137, 2005. (Pubitemid 41422112)
11. W. Du, J. Jia, M. Mangal, and M. Murugesan. Uncheatable grid computing. In International Conference on Distributed Computing Systems, pages 4-11, 2004.
12. Z. Erkin, M. Franz, J. Guajardo, S. Katzenbeisser, I. Lagendijk, and T. Toft. Privacy-preserving face recognition. In Privacy Enchancing Technologies Symposium (PETS), pages 235-253, 2009.
13. P. Golle and I. Mironov. Uncheatable distributed computations. In RSA Conference, pages 425-440, 2001. (Pubitemid 33255180)
14. P. Golle and S. Stubblebine. Secure distributed computing in a commercial environment. In International Conference on Financial Cryptography, pages 289-304, 2001.
15. M. Goodrich. Pipelined algorithms to detect cheating in long-term grid computations. Theoretical Computer Science, 408(2-3):199-207, 2008.
16. M. Goodrich. Randomized Shellsort: A simple oblivious sorting algorithm. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1262-1277, 2010.
17. G. Karame, M. Strasser, and S. Capkun. Secure remote execution of sequential computations. In International Conference on Information and Communications Security (ICICS), pages 181-197, 2009.
18. H. Kim, J. Gil, C. Hwang, H. Yu, and S. Joung. Agent-based autonomous result verification mechanism in desktop grid systems. In Agents and Peer-to-Peer Computing (AP2PC), pages 72-84, 2007.
19. M. Kuhn, S. Schmid, and R. Watterhofer. Distributed asymmetric verification in computational grids. In IEEE International Symposium on Parallel and Distributed Processing, pages 1-10, 2008.
20. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, 1979.
21. D. Szajda, B. Lawson, and J. Owen. Hardening functions for large scale distributed computations. In IEEE Symposium on Security and Privacy, pages 216-224, 2003.
22. C. Wang, K. Ren, and J. Wang. Secure and practical outsourcing of linear programming in cloud computing. In INFOCOM, 2011.
23. K. Watanabe, M. Fukushi, and S. Horiguchi. Collusion-resistant sabotage-tolerance mechanisms for volunteer computing systems. In IEEE International Conference on e-Business Engineering (ICEBE), pages 213-218, 2009.