221 search results - page 1 / 45 » Computing arbitrary functions of encrypted data |
CACM
2010
13 years 4 months ago
2010
Suppose that you want to delegate the ability to process your data, without giving away access to it. We show that this separation is possible: we describe a "fully homomorph...
STOC
2012
ACM
11 years 7 months ago
2012
ACM
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted “cloud” server. In this notion that we call on-the-fly multiparty c...
TRUST
2010
Springer
13 years 9 months ago
2010
Springer
Secure outsourcing of computation to an untrusted (cloud) service provider is becoming more and more important. Pure cryptographic solutions based on fully homomorphic and verifia...
STOC
2009
ACM
13 years 11 months ago
2009
ACM
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in t...
CCS
2010
ACM
13 years 4 months ago
2010
ACM
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...