arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2412.04031cs.CR
收藏

多智能体系统中通过随机投影降维实现隐私保护

Dimension Reduction via Random Projection for Privacy in Multi-Agent Systems

Indian Institute of Technology, Guwahati(印度理工学院古瓦哈提分校)

Puspanjali Ghoshal, Ashok Singh Sairam

AI总结:

针对多智能体系统中数据共享的隐私风险与效用损失问题,提出一种基于鲁棒概念的压缩方法,通过随机投影降维清洗数据,并推导了满足效用约束的压缩矩阵范数界以保障隐私。

摘要:

在多智能体系统(MAS)中,个体智能体观测环境的各个方面,并将这些信息传输给负责聚合数据和推导系统参数的中央实体。为提高整体效率,智能体可能会在其观测结果中附加某些私有参数。例如,在众包交通监控系统中,通勤者不仅可能分享当前速度,还可能分享位置等敏感信息,以实现更准确的路线预测。然而,共享此类数据可能让中央实体或潜在对手推断出用户的私人细节,如日常行程。为缓解这些隐私风险,智能体在传输前对数据进行清洗。这种清洗不可避免地导致效用损失。本研究将该问题表述为效用-隐私权衡问题,提出一种利用鲁棒概念的新型压缩方法来清洗共享数据,并进一步推导了在满足预定义效用约束的情况下确保最大隐私所需的压缩矩阵范数的界。

英文摘要:

In a Multi-Agent System (MAS), individual agents observe various aspects of the environment and transmit this information to a central entity responsible for aggregating the data and deducing system parameters. To improve overall efficiency, agents may append certain private parameters to their observations. For example, in a crowd-sourced traffic monitoring system, commuters might share not only their current speed, but also sensitive information such as their location to enable more accurate route prediction. However, sharing such data can allow the central entity or a potential adversary to infer private details about the user, such as their daily routines. To mitigate these privacy risks, the agents sanitize the data before transmission. This sanitization inevitably results in a loss of utility. In this work, we formulate the problem as a utility-privacy trade-off and propose a novel compression-based approach leveraging the notion of robust concepts to sanitize the shared data. We further derive a bound on the norm of the compression matrix required to ensure maximal privacy while satisfying predefined utility constraints.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑