Multi-party computation enables secure polynomial control based solely on secret-sharing
Encrypted control systems allow to evaluate feedback laws on external servers without revealing private information about state and input data, the control law, or the plant. While there are a number of encrypted control schemes available for linear feedback laws, only few results exist for the evaluation of more general control laws. Recently, an approach to encrypted polynomial control was presented, relying on two-party secret sharing and an inter-server communication protocol using homomorphic encryption. As homomorphic encryptions are much more computationally demanding than secret sharing, they make up for a tremendous amount of the overall computational demand of this scheme. For this reason, in this paper, we demonstrate that multi-party computation enables secure polynomial control based solely on secret sharing. We introduce a novel secure three-party control scheme based on three-party computation. Further, we propose a novel $n$-party control scheme to securely evaluate polynomial feedback laws of arbitrary degree without inter-server communication. The latter property makes it easier to realize the necessary requirement regarding non-collusion of the servers, with which perfect security can be guaranteed. Simulations suggest that the presented control schemes are many times less computationally demanding than the two-party scheme mentioned above.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
PolyDNN: Polynomial Representation of NN for Communication-less SMPC Inference
The structure and weights of Deep Neural Networks (DNN) typically encode and contain very valuable information about the dataset that was used to train the network. One way to protect this information when DNN is publish…
TranslationNimbus: Secure and Efficient Two-Party Inference for Transformers
Transformer models have gained significant attention due to their power in machine learning tasks. Their extensive deployment has raised concerns about the potential leakage of sensitive information during inference. How…
Quantum-secure multiparty deep learning
Secure multiparty computation enables the joint evaluation of multivariate functions across distributed users while ensuring the privacy of their local inputs. This field has become increasingly urgent due to the explodi…
Cloud ComputingDeep LearningQuantizationPADER: Paillier-based Secure Decentralized Social Recommendation
The prevalence of recommendation systems also brings privacy concerns to both the users and the sellers, as centralized platforms collect as much data as possible from them. To keep the data private, we propose PADER: a …
Recommendation SystemsPolyMPCNet: Towards ReLU-free Neural Architecture Search in Two-party Computation Based Private Inference
The rapid growth and deployment of deep learning (DL) has witnessed emerging privacy and security concerns. To mitigate these issues, secure multi-party computation (MPC) has been discussed, to enable the privacy-preserv…
Neural Architecture SearchPrivacy Preserving