Recently, new protocols were proposed which allow two parties to reconcile their ordered input sets in a fair and privacypreserving 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 privacypreserving 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.

No abstract

Abstract-Fair and privacy-preserving reconciliation protocols on ordered sets have been introduced recently. Despite the fact that these protocols promise to have a great impact in a variety of applications, so far their practical use has been explored to a limited extent only. This paper addresses this gap. As main contributions, this paper identifies e-voting, auctions, event scheduling, and policy reconciliation as four far-reaching areas of application and shows how fair and privacy-preserving reconciliation protocols can be used effectively in these contexts.

No abstract

Abstract. In this paper we present the design and implementation of a framework for comprehensive performance evaluation of algorithms, modules, and libraries. Our framework allows for the definition of welldefined test inputs and the subsequent scheduling and execution of structured tests. In addition, the framework provides a web-based interface for user interaction and allows for the convenient browsing, plotting, and statistical analysis of test results. We furthermore report on our experience in using the new framework in the development of cryptographic protocols and algorithms-specifically in the context of secure multi-party computation.