Assuring BetterTimes
Journal article, 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.

secure multi-party computation

privacy-enhancing technologies

Location privacy


Per Hallgren

Chalmers, Computer Science and Engineering (Chalmers), Information Security

Ravi Kishore

International Institute of Information Technology

Martin Ochoa

Singapore University of Technology and Design

Universidad Nacional de Rosario

Andrei Sabelfeld

Universidad Nacional de Rosario

Journal of Computer Security

0926-227X (ISSN)

Vol. 26 4 557-587

Subject Categories

Computer Engineering

Computer Science

Areas of Advance

Information and Communication Technology

Driving Forces

Sustainable development



More information

Latest update

9/3/2021 2