On hiding information from an oracle
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Communications of the ACM
Selective private function evaluation with applications to private statistics
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Speeding Up Secret Computations with Insecure Auxiliary Devices
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Security and Performance of Server-Aided RSA Computation Protocols
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Fast Server-Aided RSA Signatures Secure Against Active Attacks
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive CryptoComputing For NC1
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Privacy-Preserving Cooperative Statistical Analysis
ACSAC '01 Proceedings of the 17th Annual Computer Security Applications Conference
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Secure outsourcing of sequence comparisons
International Journal of Information Security - Special issue on SC 2003
Foundations of Cryptography: Volume 1
Foundations of Cryptography: Volume 1
Fairplay—a secure two-party computation system
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Private and Cheating-Free Outsourcing of Algebraic Computations
PST '08 Proceedings of the 2008 Sixth Annual Conference on Privacy, Security and Trust
Attacks on protocols for server-aided RSA computation
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Searching for high-value rare events with uncheatable grid computing
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
How to securely outsource cryptographic computations
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Constant-round multiparty computation using a black-box pseudorandom generator
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
On private scalar product computation for privacy-preserving data mining
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Toward practical and unconditional verification of remote computations
HotOS'13 Proceedings of the 13th USENIX conference on Hot topics in operating systems
Supporting concurrency in private data outsourcing
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Sedic: privacy-aware data intensive computing on hybrid clouds
Proceedings of the 18th ACM conference on Computer and communications security
Cloud computing without seeing
Proceedings of the First International Workshop on Security and Privacy Preserving in e-Societies
Securing cloud-based computations against malicious providers
ACM SIGOPS Operating Systems Review
Securing cloud-based computations against malicious providers
Proceedings of the 1st European Workshop on Dependable Cloud Computing
Outsourcing encryption of attribute-based encryption with mapreduce
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Delegation of computation with verification outsourcing: curious verifiers
Proceedings of the 2013 ACM symposium on Principles of distributed computing
New methods of secure outsourcing of scientific computations
The Journal of Supercomputing
Delegatable pseudorandom functions and applications
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
On the (Im)possibility of privately outsourcing linear programming
Proceedings of the 2013 ACM workshop on Cloud computing security workshop
Secure pattern matching using somewhat homomorphic encryption
Proceedings of the 2013 ACM workshop on Cloud computing security workshop
Verifying computations with state
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Coopetitive data warehouse: a case study
CAiSE'13 Proceedings of the 25th international conference on Advanced Information Systems Engineering
Secure and verifiable outsourcing of large-scale biometric computations
ACM Transactions on Information and System Security (TISSEC)
Outsourcing computation of modular exponentiations in cloud computing
Cluster Computing
Hi-index | 0.00 |
We give improved 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 large matrices) to a remote server, such that the server learns nothing about the customer's private input or the result of the computation, and any attempted corruption of the answer by the server is detected with high probability. The computational work performed at the client is linear in the size of its input and does not require the client to locally carry out any expensive encryptions of such input. The computational burden on the server 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 n x n matrices). The improvements we give are: (i) whereas the previous work required more than one remote server and assumed they do not collude, our solution works with a single server (but readily accommodates many, for improved performance); (ii) whereas the previous work required a server to carry out expensive cryptographic computations (e.g., homomorphic encryptions), our solution does not make use of any such expensive cryptographic primitives; and (iii) whereas in previous work collusion by the servers against the client revealed to them the client's inputs, our scheme is resistant to such collusion. As in previous work, we maintain the property that the scheme enables the client to detect any attempt by the server(s) at corruption of the answer, even when the attempt is collusive and coordinated among the servers.