Privacy preserving solution of DCOPs by mediation
From MaRDI portal
Publication:6161505
DOI10.1016/J.ARTINT.2023.103916OpenAlexW4361287024MaRDI QIDQ6161505
Tamir Tassa, Pablo Kogan, Tal Grinshpoun
Publication date: 27 June 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2023.103916
Cites Work
- Unnamed Item
- Fast large-scale honest-majority MPC for malicious adversaries
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
- Privacy stochastic games in distributed constraint reasoning
- PC-SyncBB: a privacy preserving collusion secure DCOP algorithm
- Governing convergence of Max-sum on DCOPs through damping and splitting
- Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs
- Explorative anytime local search for distributed constraint optimization
- Adopt: asynchronous distributed constraint optimization with quality guarantees
- Protecting Privacy through Distributed Computation in Multi-agent Decision Making
- P-SyncBB: A Privacy Preserving Branch and Bound DCOP Algorithm
- How to share a secret
- Emergence of Scaling in Random Networks
- Collusion-Free Multiparty Computation in the Mediated Model
- Improved Primitives for Secure Multiparty Integer Computation
- Collusion-Free Protocols in the Mediated Model
- Scalable and Unconditionally Secure Multiparty Computation
- The generalized distributive law
- Distributed Constraint Optimization Problems and Applications: A Survey
- Privacy Preserving Implementation of the Max-Sum Algorithm and its Variants
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- Theory of Cryptography
This page was built for publication: Privacy preserving solution of DCOPs by mediation
