Filtering for Private Collaborative Benchmarking

  • Florian Kerschbaum
  • Orestis Terzidis
Conference paper

DOI: 10.1007/11766155_29

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3995)
Cite this paper as:
Kerschbaum F., Terzidis O. (2006) Filtering for Private Collaborative Benchmarking. In: Müller G. (eds) Emerging Trends in Information and Communication Security. Lecture Notes in Computer Science, vol 3995. Springer, Berlin, Heidelberg

Abstract

Collaborative Benchmarking is an important issue for modern enterprises, but the business performance quantities used as input are often highly confidential. Secure Multi-Party Computation can offer protocols that can compute benchmarks without leaking the input variables. Benchmarking is a process of comparing to the “best”, so often it is necessary to only include the k-best enterprises for computing a benchmark to not distort the result with some outlying performances. We present a protocol that can be used as a filter, before running any collaborative benchmarking protocol that restricts the participants to the k best values. Our protocol doesn’t use the general circuit construction technique for SMC aiming to optimize performance. As building blocks we present the fastest implementation of Yao’s millionaires’ protocol and a protocol that achieves a fair shuffle in O(log n) rounds.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Florian Kerschbaum
    • 1
  • Orestis Terzidis
    • 1
  1. 1.SAP ResearchKarlsruheGermany

Personalised recommendations