Assuring BetterTimes
Artikel i vetenskaplig tidskrift, 2018

We present a privacy-assured multiplication protocol using which an arbitrary arithmetic formula with inputs from two parties over a finite field can be jointly computed on encrypted data using an additively homomorphic encryption scheme. Our protocol is secure against malicious adversaries. To motivate and illustrate applications of this technique, we demonstrate an attack on a class of known protocols showing how to compromise location privacy of honest users by manipulating messages in protocols with additively homomorphic encryption. We demonstrate how to apply the technique in order to solve different problems in geometric applications. We evaluate our approach using a prototypical implementation. The results show that the added overhead of our approach is small compared to insecure outsourced multiplication.

privacy-enhancing technologies

secure multi-party computation

Location privacy

Författare

Per Hallgren

Chalmers, Data- och informationsteknik, Informationssäkerhet

Ravi Kishore

International Institute of Information Technology

Martin Ochoa

Universidad Nacional de Rosario

Singapore University of Technology and Design

Andrei Sabelfeld

Chalmers, Data- och informationsteknik, Informationssäkerhet

Journal of Computer Security

0926-227X (ISSN)

Vol. 26 4 557-587

Ämneskategorier

Datorteknik

Datavetenskap (datalogi)

Styrkeområden

Informations- och kommunikationsteknik

Drivkrafter

Hållbar utveckling

DOI

10.3233/JCS-171085

Mer information

Senast uppdaterat

2018-08-20