arXiv:2605.22039cs.DCcs.AI2026-05

提出安全并行计算大规模矩阵行列式的方法,适合边缘设备实时处理。

Secure and Parallel Determinant Computation for Large-Scale Matrices in Edge Environments

论文配图:Secure and Parallel Determinant Computation for Large-Scale Matrices in Edge Environments
图 1 · 摘自论文原文
  • 用轻量加密混淆矩阵结构与数值,保持行列式不变性。
  • 支持任意数量边缘服务器并行计算,通信仅单向,降低开销。
  • 提供两种验证算法,确保结果正确且客户端负担小。

边缘计算使资源受限的客户端可将密集计算任务委托给分布式边缘服务器,尤其在物联网环境中。矩阵行列式计算(MDC)对控制系统、密码学和机器学习至关重要,但传统算法具有立方复杂度,难以满足边缘场景下的实时需求。本文提出安全并行行列式计算(SPDC)框架,在N个分布式边缘服务器上实现隐私保护的MDC。该框架通过复合元素扰动(CED)实现隐私:结合逐元素混淆(EWO)与潘斯旋转定理(PRT),在隐藏矩阵结构与数值的同时保留行列式性质。采用并行LU分解将加密矩阵块分发至任意数量不可信边缘服务器,实现高效可扩展计算。单向通信模型消除服务器间交互,降低协调开销。为确保结果完整性且减轻客户端负担,引入两种验证算法:Q_2(概率性标量方法)与Q_3(确定性低复杂度替代方案)。数学分析表明,该框架具备强隐私与安全性、低计算开销及部署灵活性,适用于分布式边缘辅助系统中的安全、可扩展、实时行列式计算。

原文摘要 · Abstract (English)

The advent of edge computing has enabled resource-constrained clients to delegate intensive computational tasks to distributed edge servers, especially within Internet of Things (IoT) environments. Among such tasks, Matrix Determinant Computation (MDC) remains critical for applications in control systems, cryptography, and machine learning. However, the cubic complexity of traditional determinant algorithms makes them unsuitable for real-time processing in constrained edge scenarios. We propose a Secure Parallel Determinant Computation (SPDC) framework, which provides strong security guaranties, including privacy-preserving MDC, across N distributed edge servers. The framework achieves privacy through Composite Element Distortion (CED) - a lightweight encryption method that combines Element-wise Obfuscation (EWO) and the Panth Rotation Theorem (PRT) to conceal both structural and numerical matrix content while preserving determinant properties. Parallel LU decomposition is used to distribute encrypted matrix blocks across an arbitrary number of untrusted edge servers, enabling efficient and scalable determinant computation. A one-way communication model further reduces coordination overhead by eliminating inter-server interactions. To ensure result integrity with minimal client burden, we further introduce two verification algorithms: Q_2, a probabilistic scalar method, and Q_3, a deterministic and low-complexity alternative. Mathematical analysis demonstrates that the proposed framework provides strong privacy and security guaranties, low computational overhead, and deployment flexibility - making it well-suited for secure, scalable, and real-time MDC in distributed edge-assisted systems.

边缘计算行列式计算安全计算并行计算

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。