基于秘密分享与MAC标签的可扩展分布式隐私保护FFT方法

By optimizing distributed FFT through a three-level network architecture and hierarchical communication topology, and combining third-party replication secret sharing and MAC tagging technology, the communication and security issues in distributed FFT computation are solved, achieving efficient, scalable, and privacy-preserving FFT computation.

CN122160053BActive Publication Date: 2026-07-17HUAZHONG AGRI UNIV

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
HUAZHONG AGRI UNIV
Filing Date
2026-05-08
Publication Date
2026-07-17

AI Technical Summary

Technical Problem

Existing distributed FFT computation suffers from several problems in data privacy protection, including conflicts between communication overhead and security mechanisms, computational bottlenecks in label verification, lack of differentiation in node roles, and complexity in cross-domain collaboration. These issues result in high communication complexity, large computational overhead, and poor scalability.

Method used

A layered communication and batch verification mechanism based on a three-level network architecture is adopted, which combines third-party replication and secret sharing with MAC tagging technology. Through layered communication topology and MAC batch verification protocol, the communication mode is optimized and the verification overhead is reduced.

Benefits of technology

It reduces the communication complexity from O(M) to O(M/N) under the malicious security model, and reduces the MAC verification overhead from 35% to below 8%, improving the security and scalability of the system and making it suitable for privacy computing scenarios with large-scale data.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN122160053B_ABST
    Figure CN122160053B_ABST
Patent Text Reader

Abstract

本发明涉及一种基于秘密分享与MAC标签的可扩展分布式隐私保护FFT方法及系统,包括:采用三方复制秘密分享技术将输入的原始数据分割为多个数据份额,为每个数据份额生成对应的MAC标签后进行秘密分享给各参与方集群;各参与方集群内部的计算节点对持有的数据份额的每一行进行一维快速傅里叶变换得到中间矩阵;对中间矩阵进行旋转因子乘得到旋转矩阵;各个计算节点将旋转矩阵按列方向划分为多个区段份额后,将各区段份额按区段份额的序号发送给对应的组长;计算节点计算列方向的快速傅里叶变换后得到输出矩阵,委托者对输出矩阵进行验证;在抵御恶意攻击的同时,将通信复杂度从O(M)降至O(M / N),并将MAC验证开销降至总耗时的8%以下,大幅提升了系统的可扩展性。
Need to check novelty before this filing date? Find Prior Art