Website of Daniel A. Mayer

Implementation and Performance Evaluation of Privacy-Preserving Fair Reconciliation Protocols on Ordered Sets

Authors

Daniel A. Mayer, Dominik Teubert, Susanne Wetzel, and Ulrike Meyer

Conference

Proceedings of the First ACM Conference on Data and Application Security and Privacy (CODASPY), 2011

Abstract

Recently, new protocols were proposed which allow two parties to reconcile their ordered input sets in a fair and privacy-preserving manner. In this paper we present the design and implementation of these protocols on different platforms and extensively study their performance.

In particular, we present the design of a library for privacy-preserving reconciliation protocols and provide details on an efficient C++ implementation of this design. Furthermore, we present details on the implementation of a privacy-preserving iPhone application built on top of this library. The performance of both the library and the iPhone application are comprehensively analyzed. Our performance tests show that it is possible to efficiently implement private set intersection as a generic component on a desktop computer. Furthermore, the tests confirm the theoretically determined quadratic worst-case behavior of the privacy-preserving reconciliation protocols on the desktop as well as the iPhone platform. The main result of the performance analysis is that the protocols show linear runtime performance for average-case inputs. This is a significant improvement over the worst-case and is key for making these protocols highly viable for a wider range of applications in practice.

Download

PDF Download

BibTeX

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
@inproceedings{codaspy2011,
 author = {Mayer, Daniel A. and Teubert, Dominik and Wetzel, Susanne and Meyer, Ulrike},
 title = {Implementation and Performance Evaluation of Privacy-Preserving Fair Reconciliation Protocols on Ordered Sets},
 booktitle = {Proceedings of the First ACM Conference on Data and Application Security and Privacy},
 series = {CODASPY},
 year = {2011},
 isbn = {978-1-4503-0466-5},
 location = {San Antonio, TX, USA},
 pages = {109--120},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/1943513.1943529},
 doi = {10.1145/1943513.1943529},
 publisher = {ACM},
 address = {New York, NY, USA},
 abstract = { Recently, new protocols were proposed which allow two parties to reconcile their ordered input sets in a fair and privacy-preserving manner. In this paper we present the design and implementation of these protocols on different platforms and extensively study their performance.

In particular, we present the design of a library for privacy-preserving reconciliation protocols and provide details on an efficient C++ implementation of this design. Furthermore, we present details on the implementation of a privacy-preserving iPhone application built on top of this library. The performance of both the library and the iPhone application are comprehensively analyzed. Our performance tests show that it is possible to efficiently implement private set intersection as a generic component on a desktop computer. Furthermore, the tests confirm the theoretically determined quadratic worst-case behavior of the privacy-preserving reconciliation protocols on the desktop as well as the iPhone platform. The main result of the performance analysis is that the protocols show linear runtime performance for average-case inputs. This is a significant improvement over the worst-case and is key for making these protocols highly viable for a wider range of applications in practice.}
}