Distributed constraint satisfaction and optimization with privacy enforcement

Proceedings - IEEE/WIC/ACM International Conference on Intelligent Agent Technology. IAT 2004

Volumn , Issue , 2004, Pages 531-535

  Silaghi, Marius C ^a   Mitra, Debasis ^a  

^a Florida Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEM (CSP); DISTRIBUTED NEGOTIATION; MODEL OPTIMIZATION; PRIVACY ENFORCEMENT;

COMPUTATIONAL METHODS; COMPUTER SIMULATION; DIGITAL ARITHMETIC; MATHEMATICAL MODELS; OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING; RESOURCE ALLOCATION;

CONSTRAINT THEORY;

EID: 16244381413     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IAT.2004.1343012     Document Type: Conference Paper

References (12)

1. M. Ben-Or, S. Goldwasser, and A. Widgerson. Completeness theorems for non-cryptographic fault-tolerant distributed computating. In STOC, pages 1-10, 1988.
2. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Com. of ACM, 24(2):84-88, 1981.
3. B. Fallings. Incentive compatible open constraint optimization. In Electronic Commerce, 2003.
4. J. Liu, H. Jing, and Y. Tang. Multi-agent oriented constraint satisfaction. Artificial Intelligence, 136:101-144, 2002.
5. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Eurocrypt'99, volume 1592 of LNCS, pages 223-238, 1999.
6. A. Shamir. How to share a secret. Comm. of the ACM, 22:612-613, 1979.
7. M. Silaghi. Arithmetic circuit for the first solution of distributed CSPs with cryptographic multi-party computations. In IAT, Halifax, 2003.
8. M. Silaghi. Solving a distributed CSP with cryptographic multi-party computations, without revealing constraints and without involving trusted servers. In IJCAI-DCR, 2003.
9. M. Silaghi. A suite of secure multi-party algorithms for solving DisCSPs. Technical Report CS-2004-04, FIT, 2004.
10. M. Silaghi and V. Rajeshirke. The effect of policies for selecting the solution of a DisCSP on privacy loss. In AAMAS, 2004.
11. R. Wallace and M. Silaghi. Using privacy loss to guide decisions in distributed CSP search. In FLAIRS'04, 2004.
12. M. Yokoo, K. Suzuki, and K. Hirayama. Secure distributed constraint satisfaction: Reaching agreement without revealing private information. In CP, 2002.