Computing arbitrary functions of encrypted data
نویسندگان
چکیده
منابع مشابه
Computing on Encrypted Data
Encryption secures our stored data but seems to make it inert. Can we process encrypted data without having to decrypt it first? Answers to this fundamental question give rise to a wide variety of applications. Here, we explore this question in a number of settings, focusing on how interaction and secure hardware can help us compute on encrypted data, and what can be done if we have neither int...
متن کامل6.892 Computing on Encrypted Data
So far, we have studied the problem of outsourcing computation when we want our data to be private from the server. Today, we will forget about privacy and focus on the problem of verifying that the server computes correctly for us. Specifically, we will look at decision problems. We consider the problem where we send the cloud x, and the cloud (efficiently) computes both f(x) as well as a proo...
متن کامل6.892 Computing on Encrypted Data
Computing environments change: everyone has portable computing devices (in form of mobile phones) and access to large servers (in the cloud). This change presents fundamental challenge of outsourcing computation, which is motivated by the asymmetry of the available computing power. In recent computing scenarios clients are trusted (but weak), while computationally strong servers are untrusted a...
متن کاملTwo-Party Computing with Encrypted Data
We consider a new model for online secure computation on encrypted inputs in the presence of malicious adversaries. The inputs are independent of the circuit computed in the sense that they can be contributed by separate third parties. The model attempts to emulate as closely as possible the model of “Computing with Encrypted Data” that was put forth in 1978 by Rivest, Adleman and Dertouzos whi...
متن کامل6.892 Computing on Encrypted Data Lecture 4
In the previous lecture we constructed a LWE-based secret-key encryption scheme that is somewhat homomorphic. More precisely, the scheme supports evaluation of log n depth circuits for every < 1 after using the Dimension Reduction technique that we also introduced in the previous lecture. Building upon this starting point, we will introduce two more techniques in this lecture. The first techniq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 2010
ISSN: 0001-0782,1557-7317
DOI: 10.1145/1666420.1666444