A Privacy Preserving Collusion Secure DCOP Algorithm

@inproceedings{Tassa2019APP,
  title={A Privacy Preserving Collusion Secure DCOP Algorithm},
  author={Tamir Tassa and Tal Grinshpoun and A. Yanai},
  booktitle={IJCAI},
  year={2019}
}
  • Tamir Tassa, Tal Grinshpoun, A. Yanai
  • Published in IJCAI 2019
  • Computer Science
  • In recent years, several studies proposed privacy-preserving algorithms for solving Distributed Constraint Optimization Problems (DCOPs). All of those studies assumed that agents do not collude. In this study we propose the first privacy-preserving DCOP algorithm that is immune to coalitions, under the assumption of honest majority. Our algorithm -- PC-SyncBB -- is based on the classical Branch and Bound DCOP algorithm. It offers constraint, topology and decision privacy. We evaluate its… CONTINUE READING
    4 Citations
    A Study of Cooperation with Privacy Loss Based on Asymmetric Constraint Optimization Problem Among Agents
    Differentially Private Multi-Agent Planning for Logistic-like Problems
    • 1
    • PDF
    Mediated Secure Multi-Party Protocols for Collaborative Filtering
    New Algorithms for Continuous Distributed Constraint Optimization Problems.
    • 1
    • PDF

    References

    SHOWING 1-10 OF 31 REFERENCES
    P-SyncBB: A Privacy Preserving Branch and Bound DCOP Algorithm
    • 18
    • PDF
    Privacy Preserving Implementation of the Max-Sum Algorithm and its Variants
    • 10
    • PDF
    SSDPOP: improving the privacy of DCOP with secret sharing
    • 48
    • PDF
    The round complexity of secure protocols
    • 511
    • PDF
    Protocols for secure computations
    • A. Yao
    • Computer Science
    • FOCS 1982
    • 1982
    • 3,092
    Probabilistic encryption & how to play mental poker keeping secret all partial information
    • 781
    • PDF
    KOPT : Distributed DCOP Algorithm for Arbitrary k-optima with Monotonically Increasing Utility
    • 21
    • PDF