Fast secure computation based on a secret sharing scheme for n < 2k − 1

Secure computation is a major issue that affects the utilization of Big Data. Two main approaches are employed to achieve secure computation: homomorphic encryption (HE). and secret sharing schemes (SSSs), where the computational cost of the latter is generally much less than that of HE. Aminuddin et al. proposed a secure product-sum computation that allows secure multiplication for n < 2k − 1 by using the (scalar value x polynomial) approach. However, this approach requires a polynomial calculation because it uses Shamir's SSS, so it cannot be processed rapidly. In this study, we propose a fast secure computation method based on the XOR scheme, and we evaluate its performance and security.

[1]  Tal Rabin,et al.  Simplified VSS and fast-track multiparty computations with applications to threshold cryptography , 1998, PODC '98.

[2]  Avi Wigderson,et al.  Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) , 1988, STOC.

[3]  Ueli Maurer,et al.  General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.

[4]  Ramakrishnan Srikant,et al.  Privacy-preserving data mining , 2000, SIGMOD '00.

[5]  Keiichi Iwamura,et al.  Conditionally Secure Secrecy Computation using Secret Sharing Scheme for n<2k-1 (full paper) , 2017, IACR Cryptol. ePrint Arch..

[6]  Yuval Ishai,et al.  Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography , 2010, IACR Cryptol. ePrint Arch..

[7]  Toshiaki Tanaka,et al.  A New (k, n)-Threshold Secret Sharing Scheme and Its Extension , 2008, ISC.

[8]  Toshiaki Tanaka,et al.  On a Fast (k, n)-Threshold Secret Sharing Scheme , 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[9]  Ivan Damgård,et al.  Multiparty Computation from Somewhat Homomorphic Encryption , 2012, IACR Cryptol. ePrint Arch..

[10]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[11]  Keiichi Iwamura,et al.  Secrecy Multiplication Based on a (k, n)-Threshold Secret-Sharing Scheme Using Only k Servers , 2015, CSA 2015.

[12]  Kazuo Ohta,et al.  Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol , 2007, Public Key Cryptography.

[13]  Yehuda Lindell,et al.  High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority , 2017, IACR Cryptol. ePrint Arch..

[14]  Kurihara Jun,et al.  A Fast (4,n)-Threshold Secret Sharing Scheme Using Exclusive-OR Operations, and Its Extension to (k,n)-Threshold Schemes , 2007 .

[15]  Keiichi Iwamura,et al.  Secrecy Computation without Changing Polynomial Degree in Shamir's (K, N) Secret Sharing Scheme , 2016, DCNET.

[16]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[17]  Marcel Keller,et al.  Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits , 2013, ESORICS.