BetterTimes: Privacy-assured Outsourced Multiplications for Additively Homomorphic Encryption on Finite Fields
Paper in proceeding, 2015

We present a privacy-assured multiplication protocol using which an arbitrary arithmetic formula with inputs from two parties over a finite field F-p 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 evaluate our approach using a prototypical implementation. The results show that the added overhead of our approach is small compared to insecure outsourced multiplication.

Author

Per Hallgren

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Martin Ochoa

Technische Universitat Munchen

Singapore University of Technology and Design

Andrei Sabelfeld

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 9451 291-309
978-3-319-26058-7 (ISBN)

Areas of Advance

Information and Communication Technology

Subject Categories (SSIF 2011)

Computer and Information Science

Roots

Basic sciences

DOI

10.1007/978-3-319-26059-4_16

ISBN

978-3-319-26058-7

More information

Created

10/7/2017