Secure Two-Party Matrix Multiplication from Lattices and Its Application to Encrypted Control

• URL: http://arxiv.org/abs/2603.22857v1
• Date: Tue, 24 Mar 2026 06:51:51 GMT
• Title: Secure Two-Party Matrix Multiplication from Lattices and Its Application to Encrypted Control
• Abstract summary: The proposed protocol is provably secure under standard lattice-based cryptographic assumptions.<n>We demonstrate the feasibility of the protocol by applying it to the secure implementation of a linear control law.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this study, we propose a two-party computation protocol for approximate matrix multiplication of fixed-point numbers. The proposed protocol is provably secure under standard lattice-based cryptographic assumptions and enables matrix multiplication at a desired approximation level within a single round of communication. We demonstrate the feasibility of the protocol by applying it to the secure implementation of a linear control law. Our evaluation reveals that the client achieves lower online computational complexity compared to the original controller computation, while ensuring the privacy of controller inputs, outputs, and parameters. Furthermore, a numerical example confirms that the proposed method maintains sufficient precision of control inputs even in the presence of approximation and quantization errors.

Related papers

• Experimental Examination of Secure Two-Party Controller Computation [1.0832844764942349]
  Two-party computation protocol for running dynamic controllers over secret sharing has been proposed.<n>This protocol enables operating dynamic controllers for an infinite time horizon without controller-state decryption, controller-state reset, or input re-encryption.<n>In this study, we demonstrate the feasibility of the protocol through implementation on a commercial cloud platform with an inverted pendulum testbed.
  arXiv  Detail & Related papers  (2026-05-12T02:54:41Z)
• Minimal Information Control Invariance via Vector Quantization [2.094349987888854]
  We study how many distinct control signals are needed to render a compact set forward invariant under sampled-data control.<n>We propose a vector-quantized autoencoder that jointly learns a state-space partition and a finite control codebook.<n>We empirically characterize the minimum sensing resolution compatible with safe operation.
  arXiv  Detail & Related papers  (2026-04-03T15:53:07Z)
• Variational Encrypted Model Predictive Control [1.3416169841532526]
  We develop a variational encrypted model predictive control protocol whose online execution relies only on encrypted operations.<n>The proposed approach reformulates the MPC problem into a sampling-based estimator, in which the decryption of the quadratic cost is naturally handled by tilting the sampling distribution.<n>We analyze the effect of encryption-induced errors on optimality, and simulation results demonstrate the practical applicability of the proposed method.
  arXiv  Detail & Related papers  (2026-03-19T20:23:52Z)
• Verifying Closed-Loop Contractivity of Learning-Based Controllers via Partitioning [52.23804865017831]
  We address the problem of verifying closed-loop contraction in nonlinear control systems whose controller and contraction metric are both parameterized by neural networks.<n>We derive a tractable and scalable sufficient condition for closed-loop contractivity that reduces to checking that the dominant eigenvalue of a symmetric Metzler matrix is nonpositive.
  arXiv  Detail & Related papers  (2025-12-01T23:06:56Z)
• Unsupervised Conformal Inference: Bootstrapping and Alignment to Control LLM Uncertainty [49.19257648205146]
  We propose an unsupervised conformal inference framework for generation.<n>Our gates achieve close-to-nominal coverage and provide tighter, more stable thresholds than split UCP.<n>The result is a label-free, API-compatible gate for test-time filtering.
  arXiv  Detail & Related papers  (2025-09-26T23:40:47Z)
• Client-Aided Secure Two-Party Computation of Dynamic Controllers [1.217503190366097]
  The proposed protocol realizes outsourcing of controller computation to two servers.<n>The feasibility of the protocol is demonstrated through numerical examples of PID and observer-based controls.
  arXiv  Detail & Related papers  (2025-03-04T01:35:47Z)
• Secure and Efficient Two-party Quantum Scalar Product Protocol With Application to Privacy-preserving Matrix Multiplication [2.770988618353868]
  Two-party quantum scalar product (S2SP) is a promising research area within secure multiparty computation (SMC) Existing quantum S2SP protocols are not efficient enough, and the complexity is usually close to exponential level. In this paper, a novel secure two-party quantum scalar product (S2QSP) protocol based on Fourier states is proposed to achieve higher efficiency.
  arXiv  Detail & Related papers  (2023-09-23T14:33:46Z)
• Encrypted Dynamic Control exploiting Limited Number of Multiplications and a Method using RLWE-based Cryptosystem [0.3749861135832073]
  We present a method to encrypt dynamic controllers that can be implemented through most homomorphic encryption schemes. As a result, the encrypted controller involves only a limited number of homomorphic multiplications on every encrypted data. We propose a customization of the method for Ring Learning With Errors (RLWE)-based cryptosystems, where a vector of messages can be encrypted into a single ciphertext.
  arXiv  Detail & Related papers  (2023-07-07T08:24:48Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Actor-Critic based Improper Reinforcement Learning [61.430513757337486]
  We consider an improper reinforcement learning setting where a learner is given $M$ base controllers for an unknown Markov decision process. We propose two algorithms: (1) a Policy Gradient-based approach; and (2) an algorithm that can switch between a simple Actor-Critic scheme and a Natural Actor-Critic scheme.
  arXiv  Detail & Related papers  (2022-07-19T05:55:02Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.