Building a privacy-preserving benchmarking enterprise system

被引:1
作者
Kerschbaum, Florian [1 ]
机构
[1] SAP Res, Karlsruhe, Germany
来源
11TH IEEE INTERNATIONAL ENTERPRISE DISTRIBUTED OBJECT COMPUTING CONFERENCE, PROCEEDINGS | 2007年
关键词
D O I
10.1109/EDOC.2007.13
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Benchmarking is the process of comparing one's own performance to the statistics of a group of competitors, named peer group. It is a common and important process in the business world for many important business metrics, called key performance indicators (M). Privacy is of the utmost importance, since these KPIs allow the inference of sensitive information. Therefore several secure multiparty computation (SMC) protocols for securely and privately computing statistics of KPIs have recently been developed. These protocols are the basic building block for a privacy-preserving benchmarking system, but in order to complete an enterprise system that offers a benchmarking service to its customers more problems need to be solved. This paper addresses two remaining problems: peer group formation and protocol orchestration. We first analyze how peer group participation impacts privacy and vice-versa. Given current network performance limitations we conclude that in order for KPIs to remain private one subscriber can participate in at most one peer group. Peer group formation is the process of forming sensible peer groups out of the set of subscribers. A sensible peer group is one that is useful for benchmarking, i.e. a group of similar companies, under the constraint that one subscriber can participate in at most one peer group. We characterize subscribers by a set of discrete criteria and therefore view the automatic peer group formation as a data clustering problem. A data clustering algorithm customized for automatic peer group formation is required to build clusters whose size does not fall below a minimum threshold. We present a high-performance modification of k-means clustering that takes the minimum cluster size as an additional parameter which might be of independent interest. In a simulation we evaluate its practical applicability to automatic peer group formation. Our final approach is the first automatic peer group formation algorithm for an enterprise benchmarking system. Polling-based protocol orchestration allows the subscribers to remain passive clients, i.e. require no inbound connection, e.g. through a company firewall. We show through simulation that such a polling-based orchestration can be expected to complete within one polling interval.
引用
收藏
页码:87 / 96
页数:10
相关论文
共 14 条
  • [1] [Anonymous], 2001, ICML, DOI DOI 10.1109/TPAMI.2002.1017616
  • [2] Atallah M., 2004, P 2004 ACM WORKSHOP, P103, DOI [10.1145/1029179.1029204, DOI 10.1145/1029179.1029204]
  • [3] BANERJEE A, 2002, P INT JOINT C NEUR N
  • [4] BOGETOFT P, 2005, GROUP DECISION NEGOT, V14
  • [5] BOGETOFT P, 2005, BRICS REPORT SERIES
  • [6] CROTTS J, 2006, P C TRAV TOUR RES AS
  • [7] Demiriz, 2000, CONSTRAINED K MEANS
  • [8] JAIN A, 1999, IN PRESS ACM COMPUTI, V31
  • [9] JONAS J, 2006, ADV ANAL ANONYMIZED
  • [10] KERSCHBAUM F, 2006, P INT C EM TRENDS IN