DocumentCode
3040428
Title
Private and Cheating-Free Outsourcing of Algebraic Computations
Author
Benjamin, David ; Atallah, Mikhail J.
Author_Institution
Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN
fYear
2008
fDate
1-3 Oct. 2008
Firstpage
240
Lastpage
245
Abstract
We give protocols for the secure and private outsourcing of linear algebra computations, that enable a client to securely outsource expensive algebraic computations (like the multiplication of huge matrices) to two remote servers, such that the servers learn nothing about the customer´s private input or the result of the computation,and any attempted corruption of the answer by the servers is detected with high probability. The computational work done locally by the client is linear in the size of its input and does not require the client to carry out locally any expensive encryptions of such input.The computational burden on the servers is proportional to the time complexity of the current practically used algorithms for solving the algebraic problem (e.g., proportional to n3 for multiplying two ntimesn matrices). If the servers were to collude against the client,then they would only find out the client´s private inputs, but they would not be able to corrupt the answer without detection by the client.
Keywords
algebra; computational complexity; outsourcing; security of data; algebraic computations; algebraic problem; cheating-free outsourcing; private outsourcing; time complexity; Bandwidth; Cryptography; Data privacy; Databases; Grid computing; Linear algebra; Outsourcing; Physics computing; Protocols; Secure storage; Privacy; algebraic computations; cheating; protocols; secure outsourcing;
fLanguage
English
Publisher
ieee
Conference_Titel
Privacy, Security and Trust, 2008. PST '08. Sixth Annual Conference on
Conference_Location
Fredericton, NB
Print_ISBN
978-0-7695-3390-2
Type
conf
DOI
10.1109/PST.2008.12
Filename
4641291
Link To Document