Private collaborative forecasting and benchmarking

Suppose a number of hospitals in a geographic area want to learn how their own heart-surgery unit is doing compared with the others in terms of mortality rates, subsequent complications, or any other quality metric. Similarly, a number of small businesses might want to use their recent point-of-sales data to cooperatively forecast future demand and thus make more informed decisions about inventory, capacity, employment, etc. These are simple examples of cooperative benchmarking and (respectively) forecasting that would benefit all participants as well as the public at large, as they would make it possible for participants to avail themselves of more precise and reliable data collected from many sources, to assess their own local performance in comparison to global trends, and to avoid many of the inefficiencies that currently arise because of having less information available for their decision-making. And yet, in spite of all these advantages, cooperative benchmarking and forecasting typically do not take place, because of the participants' unwillingness to share their information with others. Their reluctance to share is quite rational, and is due to fears of embarrassment, lawsuits, weakening their negotiating position (e.g., in case of over-capacity), revealing corporate performance and strategies, etc. The development and deployment of <i>private</i> benchmarking and forecasting technologies would allow such collaborations to take place without revealing any participant's data to the others, reaping the benefits of collaboration while avoiding the drawbacks. Moreover, this kind of technology would empower smaller organizations who could then cooperatively base their decisions on a much broader information base, in a way that is today restricted to only the largest corporations. This paper is a step towards this goal, as it gives protocols for forecasting and benchmarking that reveal to the participants the desired answers yet do not reveal to any participant any other participant's private data. We consider several forecasting methods, including linear regression and time series techniques such as moving average and exponential smoothing. One of the novel parts of this work, that further distinguishes it from previous work in secure multi-party computation, is that it involves floating point arithmetic, in particular it provides protocols to securely and efficiently perform division.

[1]  Andrew Chi-Chih Yao,et al.  How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[2]  Wenliang Du,et al.  Secure Multi-party Computational Geometry , 2001, WADS.

[3]  David Chaum,et al.  The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.

[4]  James R. Evans Applied production and operations management , 1987 .

[5]  Tal Rabin,et al.  Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.

[6]  Jacques Stern,et al.  Non-interactive Private Auctions , 2002, Financial Cryptography.

[7]  Wenliang Du,et al.  A study of several specific secure two-party computation problems , 2001 .

[8]  Williams Sh Collaborative planning, forecasting, and replenishment. , 1999 .

[9]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[10]  Wenliang Du,et al.  Privacy-preserving cooperative scientific computations , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..

[11]  Shafi Goldwasser,et al.  Multi party computations: past and present , 1997, PODC '97.

[12]  Arnold Schönhage,et al.  Schnelle Multiplikation großer Zahlen , 1971, Computing.

[13]  Hicham G. Elmongui,et al.  Secure supply-chain protocols , 2003, EEE International Conference on E-Commerce, 2003. CEC 2003..

[14]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[15]  Wenliang Du,et al.  Privacy-preserving cooperative statistical analysis , 2001, Seventeenth Annual Computer Security Applications Conference.

[16]  Helmut Alt,et al.  Comparing the combinational complexities of arithmetic functions , 1988, JACM.

[17]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[18]  Yehuda Lindell,et al.  Privacy Preserving Data Mining , 2000, Journal of Cryptology.

[19]  Stephen A. Cook,et al.  Log Depth Circuits for Division and Related Problems , 1984, SIAM J. Comput..

[20]  W. J. Stevenson,et al.  PRODUCTION OPERATIONS MANAGEMENT , 1992 .

[21]  Tatsuaki Okamoto,et al.  A New Public-Key Cryptosystem as Secure as Factoring , 1998, EUROCRYPT.

[22]  Oded Goldreich,et al.  Cryptography and cryptographic protocols , 2003, Distributed Computing.

[23]  Jacques Stern,et al.  A new public key cryptosystem based on higher residues , 1998, CCS '98.

[24]  Bruce Schneier,et al.  Applied cryptography : protocols, algorithms, and source codein C , 1996 .

[25]  E. Frazelle Supply chain strategy : the logistics of supply chain management , 2002 .

[26]  Hans H. Bauer,et al.  Collaborative planning, forecasting and replenishment (CPFR) : Rahmenbedingungen, Vorgehen und Aussichten , 2002 .