Two-party computing with encrypted data

14Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 which involved a single online message. In our model, two parties publish their public keys in an offline stage, after which any party (i.e., any of the two and any third party) can publish encryption of their local inputs. Then in an on-line stage, given any common input circuit C and its set of inputs from among the published encryptions, the first party sends a single message to the second party, who completes the computation. © International Association for Cryptology Research 2007.

Cite

CITATION STYLE

APA

Choi, S. G., Elbaz, A., Juels, A., Malkin, T., & Yung, M. (2007). Two-party computing with encrypted data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4833 LNCS, pp. 298–314). Springer Verlag. https://doi.org/10.1007/978-3-540-76900-2_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free