CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

BetterTimes: Privacy-assured Outsourced Multiplications for Additively Homomorphic Encryption on Finite Fields

Per A. Hallgren (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; Martin Ochoa ; Andrei Sabelfeld (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers))
Lecture Notes in Computer Science - Proceedings of the International Conference on Provable Security (ProvSec), Kanazawa, Japan, November 24-26, 2015 (0302-9743). Vol. 9451 (2015), p. 291-309.
[Konferensbidrag, refereegranskat]

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.

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2015-12-04. Senast ändrad 2016-07-04.
CPL Pubid: 227239


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)


Informations- och kommunikationsteknik
Data- och informationsvetenskap

Chalmers infrastruktur

Relaterade publikationer

Denna publikation ingår i:

Decentralized Application Security