Privacy in Distributed Computations based on Real Number Secret Sharing

Privacy preservation in distributed computations is an important subject as digitization and new technologies enable collection and storage of vast amounts of data, including private data belonging to individuals. To this end, there is a need for a privacy preserving computation framework that minimises the leak of private information during computations while being efficient enough for practical usage. This paper presents a step towards such a framework with the proposal of a real number secret sharing scheme that works directly on real numbers without the need for conversion to integers which is the case in related schemes. The scheme offers computations like addition, multiplication, and division to be performed directly on secret shared data (the cipher text version of the data). Simulations show that the scheme is much more efficient in terms of accuracy than its counterpart version based on integers and finite field arithmetic. The drawback with the proposed scheme is that it is not perfectly secure. However, we provide a privacy analysis of the scheme, where we show that the leaked information can be upper bounded and asymptotically goes to zero. To demonstrate the scheme, we use it to perform Kalman filtering directly on secret shared data.

[1]  Farhad Farokhi,et al.  Towards Encrypted MPC for Linear Constrained Systems , 2018, IEEE Control Systems Letters.

[2]  Jan Willemson,et al.  Alternative Implementations of Secure Real Numbers , 2016, IACR Cryptol. ePrint Arch..

[3]  Gerhard Goos,et al.  Applied Cryptography and Network Security , 2012, Lecture Notes in Computer Science.

[4]  Octavian Catrina,et al.  Secure Computation with Fixed-Point Numbers , 2010, Financial Cryptography.

[5]  K Gordon,et al.  The multi-state Kalman Filter in medical monitoring. , 1986, Computer methods and programs in biomedicine.

[6]  Ignacio Cascudo,et al.  Privacy Preserving Recursive Least Squares Solutions , 2019, 2019 18th European Control Conference (ECC).

[7]  Donald Beaver,et al.  Efficient Multiparty Protocols Using Circuit Randomization , 1991, CRYPTO.

[8]  Privacy-Preserving Distributed Average Consensus based on Additive Secret Sharing , 2019, 2019 27th European Signal Processing Conference (EUSIPCO).

[9]  Octavian Catrina,et al.  Secure Multiparty Linear Programming Using Fixed-Point Arithmetic , 2010, ESORICS.

[10]  Yang Lu,et al.  Privacy preserving distributed optimization using homomorphic encryption , 2018, Autom..

[11]  Rafael Wisniewski,et al.  Privacy Preservation in Distributed Optimization via Dual Decomposition and ADMM , 2019, 2019 IEEE 58th Conference on Decision and Control (CDC).

[12]  Yihua Zhang,et al.  Secure Computation on Floating Point Numbers , 2013, NDSS.

[13]  T. Başar,et al.  A New Approach to Linear Filtering and Prediction Problems , 2001 .

[14]  Iman Shames,et al.  Secure and private control using semi-homomorphic encryption , 2017 .

[15]  Eran Omri,et al.  Turbospeedz: Double Your Online SPDZ! Improving SPDZ using Function Dependent Preprocessing , 2019, IACR Cryptol. ePrint Arch..

[16]  Rafael Wisniewski,et al.  Private Aggregation With Application to Distributed Optimization , 2021, IEEE Control Systems Letters.

[17]  Keke Gai,et al.  Advanced Fully Homomorphic Encryption Scheme Over Real Numbers , 2017, 2017 IEEE 4th International Conference on Cyber Security and Cloud Computing (CSCloud).

[18]  Francisco Javier González-Serrano,et al.  State estimation using an extended Kalman filter with privacy-protected observed inputs , 2014, 2014 IEEE International Workshop on Information Forensics and Security (WIFS).

[19]  Ivan Damgård,et al.  Secure Multiparty Computation and Secret Sharing , 2015 .

[20]  Qiongxiu Li,et al.  Privacy-Preserving Distributed Optimization via Subspace Perturbation: A General Framework , 2020, IEEE Transactions on Signal Processing.

[21]  László Csirmaz,et al.  Infinite secret sharing – Examples , 2013, J. Math. Cryptol..

[22]  Jim Basilakis,et al.  Efficient Parallel Binary Operations on Homomorphic Encrypted Real Numbers , 2019, IEEE Transactions on Emerging Topics in Computing.

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

[24]  Tom Høholdt,et al.  A Course in Error-Correcting Codes (EMS Textbooks in Mathematics) , 2004 .

[25]  Yang Song,et al.  Privacy-Aware Kalman Filtering , 2018, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[26]  Hans van Lint,et al.  Applications of Kalman Filtering in Trac Management and Control , 2012 .

[27]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[28]  Qiongxiu Li,et al.  A Privacy-Preserving Asynchronous Averaging Algorithm based on Shamir’s Secret Sharing , 2019, 2019 27th European Signal Processing Conference (EUSIPCO).

[29]  George J. Pappas,et al.  Differentially Private Filtering , 2012, IEEE Transactions on Automatic Control.

[30]  Ali Moeini,et al.  Forecasting monthly urban water demand using Extended Kalman Filter and Genetic Programming , 2011, Expert Syst. Appl..