Secure computation on the web: Computing without simultaneous interaction

93Citations
Citations of this article
72Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. However, its use in practice seems limited. We argue that one of the reasons for this is that the model of computation on the web is not suited to the type of communication patterns needed for secure computation. Specifically, in most web scenarios clients independently connect to servers, interact with them and then leave. This rules out the use of secure computation protocols that require that all participants interact simultaneously. We initiate a study of secure computation in a client-server model where each client connects to the server once and interacts with it, without any other client necessarily being connected at the same time. We point out some inherent limitations in this model and present definitions that capture what can be done. We also present a general feasibility result and several truly practical protocols for a number of functions of interest. All our protocols are based on standard assumptions, and we achieve security both in the semi-honest and malicious adversary models. © 2011 International Association for Cryptologic Research.

References Powered by Scopus

Fully Homomorphic Encryption Using Ideal Lattices

4665Citations
N/AReaders
Get full text

How to prove yourself: Practical solutions to identification and signature problems

2562Citations
N/AReaders
Get full text

Robust non-interactive zero knowledge

166Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Advances and open problems in federated learning

3205Citations
N/AReaders
Get full text

Practical secure aggregation for privacy-preserving machine learning

2359Citations
N/AReaders
Get full text

On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

712Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Halevi, S., Lindell, Y., & Pinkas, B. (2011). Secure computation on the web: Computing without simultaneous interaction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6841 LNCS, pp. 132–150). Springer Verlag. https://doi.org/10.1007/978-3-642-22792-9_8

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 39

66%

Researcher 10

17%

Professor / Associate Prof. 8

14%

Lecturer / Post doc 2

3%

Readers' Discipline

Tooltip

Computer Science 53

85%

Engineering 4

6%

Mathematics 3

5%

Physics and Astronomy 2

3%

Save time finding and organizing research with Mendeley

Sign up for free