Arithmetic circuit for the first solution of distributed CSPs with cryptographic multi-party computations

Proceedings - IEEE/WIC International Conference on Intelligent Agent Technology, IAT'03

Volumn , Issue , 2003, Pages 609-613

  Silaghi, Marius Cǎlin ^a  

^a FLORIDA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARITHMETIC CIRCUIT; BASIC SOLUTIONS; CONSTRAINT SATISFACTION PROBLEMS; DISTRIBUTED CONSTRAINT SATISFACTION; LARGE CLASS; MEETING SCHEDULING; MULTIPARTY COMPUTATION; SECRET SHARING SCHEMES; THRESHOLD SCHEMES;

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

References (11)

1. W. Diffie and M. Hellman. Multiuser cryptographic techniques. IEEE Transactions on Information Theory, 1976.
2. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In Proc. of 27th IEEE FOCS, pages 174-187, Toronto, 1986.
3. M. Hirt, U. Maurer, and B. Przydatek. Efficient secure multi-party computation. In Advances in Cryptology - ASIACRYPT'OO, volume 1976 of LNCS, pages 143-161, 2000.
4. P. Meseguer and M. Jimenez. Distributed forward checking. In DCS, 2000.
5. A. Shamir. How to share a secret. Comm. of the ACM, 22:612-613, 1979.
6. M. Silaghi. Solving a distributed csp with cryptographic multi-party computations, without revealing constraints and without involving trusted servers. In IJCAI-DCR, 2003.
7. M. C. Silaghi and B. Faltings. A comparison of DisCSP algorithms with respect to privacy. In AAMAS-DCR, 2002.
8. M.-C. Silaghi, D. Sam-Haroud, and B. Faltings. Asynchronous search with private constraints. In Proc. of AA2000, pages 177-178, Barcelona, June 2000.
9. R. Wallace and E. Freuder. Constraint-based multi-agent meeting scheduling: Effects of agent heterogeneity on performance and privacy loss. In DCR, pages 176-182, 2002.
10. A. Yao. Protocols for secure computations. In FOCS, pages 160-164, 1982.
11. M. Yokoo, K. Suzuki, and K. Hirayama. Secure distributed constraint satisfaction: Reaching agreement without revealing private information. In CP, 2002.