Towards Empirical Aspects of Secure Scalar Product

Privacy is ultimately important, and there is a fair amount of research about it. However, few empirical studies about the cost of privacy are conducted. In the area of secure multiparty computation, the scalar product has long been reckoned as one of the most promising building blocks in place of the classic logic gates. The reason is not only the scalar product complete, which is as good as logic gates, but also the scalar product is much more efficient than logic gates. As a result, we set to study the computation and communication resources needed for some of the most well-known and frequently referred secure scalar-product protocols, including the composite-residuosity, the invertible-matrix, the polynomial-sharing, and the commodity-based approaches. Besides the implementation remarks of these approaches, we analyze and compare their execution time, computation time, and random number consumption, which are the most concerned resources when talking about secure protocols. Moreover, Fairplay the benchmark approach implementing Yao's famous circuit evaluation protocol, is included in our experiments in order to demonstrate the potential for the scalar product to replace logic gates.

[1]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[2]  Moni Naor,et al.  Efficient oblivious transfer protocols , 2001, SODA '01.

[3]  Bart Goethals,et al.  On Private Scalar Product Computation for Privacy-Preserving Data Mining , 2004, ICISC.

[4]  Yi-Ting Chiang,et al.  Information Theoretical Analysis of Two-Party Secret Computation , 2006, DBSec.

[5]  Joe Kilian,et al.  A general completeness theorem for two party games , 1991, STOC '91.

[6]  Yi-Ting Chiang,et al.  Secrecy of Two-Party Secure Computation , 2005, DBSec.

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

[8]  L. Turner,et al.  Inverse of the Vandermonde matrix with applications , 1966 .

[9]  Rafail Ostrovsky,et al.  Secure two-party k-means clustering , 2007, CCS '07.

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

[11]  Joe Kilian,et al.  Founding crytpography on oblivious transfer , 1988, STOC '88.

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

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

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

[15]  Da-Wei Wang,et al.  Information-Theoretically Secure Number-Product Protocol , 2007, 2007 International Conference on Machine Learning and Cybernetics.

[16]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[17]  Wenliang Du,et al.  A practical approach to solve Secure Multi-party Computation problems , 2002, NSPW '02.

[18]  Benny Pinkas,et al.  Fairplay - Secure Two-Party Computation System , 2004, USENIX Security Symposium.

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

[20]  Donald Beaver,et al.  Commodity-based cryptography (extended abstract) , 1997, STOC '97.