资源论文Max-Sum Goes Private

Max-Sum Goes Private

2019-11-18 | |  58 |   40 |   0

Abstract As part of the ongoing effort of designing secure DCOP algorithms, we propose P-M AX -S UM, the first private algorithm that is based on M AX -S UM. The proposed algorithm has multiple agents preforming the role of each node in the factor graph, on which the M AX -S UM algorithm operates. P-M AX S UM preserves three types of privacy: topology privacy, constraint privacy, and assignment/decision privacy. By allowing a single call to a trusted coordinator, P-M AX -S UM also preserves agent privacy. The two main cryptographic means that enable this privacy preservation are secret sharing and homomorphic encryption. Our experiments on structured and realistic problems show that the overhead of privacy preservation in terms of runtime is reasonable.

上一篇:Collective Biobjective Optimization Algorithm for Parallel Test Paper Generation

下一篇:Applying Max-Sum to Asymmetric Distributed Constraint Optimization

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...