Secure combinatorial optimization simulating DFS tree-based variable elimination

9th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2006

Volumn , Issue , 2006, Pages

  Silaghi, Marius Cǎlin ^a   Faltings, Boi ^b   Petcu, Adrian ^b  

^a FLORIDA INSTITUTE OF TECHNOLOGY   (United States)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARITHMETIC CIRCUIT; COMBINATORIAL PROBLEM; CONSTRAINT GRAPH; CONSTRAINT OPTIMIZATION PROBLEMS; CONSTRAINT SATISFACTION PROBLEMS; DEPTH-FIRST SEARCH; NP-HARD; OPTIMAL SOLUTIONS; SECURE MULTI-PARTY COMPUTATION; TREE-BASED; VARIABLE ELIMINATION;

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; CONSTRAINT THEORY; DATA STRUCTURES; DECODING; DYNAMIC PROGRAMMING; FORESTRY; LOGIC CIRCUITS; OPTIMAL SYSTEMS;

INTEGRATING CIRCUITS;

EID: 84864569795     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

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. (Pubitemid 11480996)
3. Z. Collin, R. Dechter, and S. Katz. Selfstabilizing distributed constraint satisfaction. Chicago Journal of Theoretical Computer Science, 2000.
4. I. Damgård, M. Fitzi, J. B. Nielsen, and T. Toft. How to split a shared number into bits in constant round and unconditionally secure. Cryptology ePrint Archive, Report 2005/140, 2005. http://eprint.iacr.org.
5. R. Dechter. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. AI'90, 1990.
6. Rina Dechter. Constraint Programming. Morgan Kaufman, 2003.
7. Juan Garay. Fair multi-party computation. In Workshop on Secure Multiparty Protocols, Amsterdam, October 2004.
8. O. Goldreich. Foundations of Cryptography, volume 2. Cambridge, 2004.
9. E. Kiltz. Unconditionally secure constant round multi-party computation for equality, comparison, bits and exponentiation. Cryptology ePrint Archive, Report 2005/066, 2005. http://eprint.iacr.org.
10. M. Merritt. Cryptographic Protocols. PhD thesis, Georgia Inst. of Tech., Feb 1983.
11. P.J. Modi, M. Tambe, W.-M. Shen, and M. Yokoo. An asynchronous complete method for distributed constraint optimization. In AAMAS, Melbourne, 2003.
12. Adrian Petcu and Boi Faltings. Approximations in distributed optimization. In Principles and Practice of Constraint Programming CP 2005, 2005.
13. Adrian Petcu and Boi Faltings. A scalable method for multiagent constraint optimization. In IJCAI, 2005.
14. Adrian Petcu and Boi Faltings. Superstabilizing, fault-containing multiagent combinatorial optimization. In Proceedings of the National Conference on Artificial Intelligence, AAAI-05, Pittsburgh, Pennsylvania, USA, July 2005. AAAI.
15. A. Shamir. How to share a secret. Comm. of the ACM, 22:612-613, 1979.
16. M. Silaghi. Using secure discsp solvers for generalized vickrey auctions, complete and stochastic secure techniques. In IJCAI05 DCR Workshop, 2005.
17. M.-C. Silaghi. Solving a distributed CSP with cryptographic multi-party computations, without revealing constraints and without involving trusted servers. In IJCAI-DCR, 2003.
18. M.-C. Silaghi. Meeting scheduling system guaranteeing n/2-privacy and resistant to statistical analysis (applicable to any DisCSP). In 3rd IC on Web Intelligence, pages 711-715, 2004.
19. M.-C. Silaghi. Secure multi-party computation (SMC) programming language. http://www.cs.fit.edu/~msilaghi/SMC/, 2004.
20. M.-C. Silaghi. Hiding absence of solution for a discsp. In FLAIRS'05, 2005.
21. M.-C. Silaghi. Zero-knowledge proofs for mixnets of secret shares and a version of ElGamal with modular homomorphism. Cryptology ePrint Archive, Report 2005/079, 2005. http://eprint.iacr.org.
22. M.-C. Silaghi and B. Faltings. A comparison of DisCSP algorithms with respect to privacy. In AAMAS-DCR, 2002.
23. M.-C. Silaghi and G. Friedrich. Secure stochastic multi-party computation for combinatorial problems. Technical Report CS-2005-14, FIT, 2005.
24. M.-C. Silaghi and D. Mitra. Distributed constraint satisfaction and optimization with privacy enforcement. In 3rd IC on Intelligent Agent Technology, pages 531-535, 2004. (Pubitemid 40456747)
25. M.-C. Silaghi and V. Rajeshirke. The effect of policies for selecting the solution of a DisCSP on privacy loss. In AAMAS, pages 1396-1397, 2004.
26. A.J. Viterbi. Error bounds for convolutional codes and an asymtotically opti mum decoding algorithm. IEEE Trans. on Information Theory, 13(2):260-267, 1967.
27. M. Yokoo and K. Suzuki. Generalized Vickrey Auctions without Third-Party Servers. In FC04, 2004.