Secure distributed constraint satisfaction: reaching agreement without revealing private information

DOI10.1016/j.artint.2004.10.007zbMath1132.68717OpenAlexW1975144303MaRDI QIDQ2457708

Katsutoshi Hirayama, Koutarou Suzuki, Makoto Yokoo

Publication date: 23 October 2007

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2004.10.007

zbMATH Keywords

cryptographyhomomorphic encryptiondistributed constraint satisfactionprivacy/security

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15)

Related Items (3)

Distributed constraint satisfaction with partially known constraints ⋮ Asynchronous forward-checking for DisCSPs ⋮ Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs

Cites Work

• Probabilistic encryption
• Publicly Verifiable Secret Sharing
• Secure Combinatorial Auctions by Dynamic Programming with Polynomial Secret Sharing
• How to share a secret
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Elliptic Curve Cryptosystems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Secure distributed constraint satisfaction: reaching agreement without revealing private information