Designing privacy-preserving interval operations based on homomorphic encryption and secret sharing techniques

Article type: Research Article

Authors: Wüller, Stefan^{a; *} | Mayer, Daniel^b | Förg, Fabian^b | Schüppen, Samuel^a | Assadsolimani, Benjamin^a | Meyer, Ulrike^a | Wetzel, Susanne^b

Affiliations: [a] Computer Science Department, RWTH Aachen University, Mies-van-der-Rohe Str. 15, D-52074, Aachen, Germany. E-mails: [email protected], [email protected], [email protected], [email protected] | [b] Computer Science Department, Stevens Institute of Technology, 1 Castle Point on Hudson, Hoboken, NJ 07030-5991, USA. E-mails: [email protected], [email protected], [email protected]

Correspondence: [*] Corresponding author. E-mail: [email protected].

Abstract: This paper introduces two-party protocols for various operations on two integer intervals that are privacy-preserving in the semi-honest model. Specifically, this work proposes new protocols for determining whether two intervals overlap; computing the boundaries and size of the overlap; and selecting a random sub-interval within the overlap. The protocols are presented both for homomorphic encryption and for secret sharing as basic secure multi-party computation techniques. Moreover, this paper presents a comprehensive performance evaluation of the newly-developed protocols.

Keywords: Privacy, secure multi-party computation, interval operations, homomorphic encryption, secret sharing

DOI: 10.3233/JCS-16830

Journal: Journal of Computer Security, vol. 25, no. 1, pp. 59-81, 2017