Meeting scheduling guaranteeing n/2-privacy and resistant to statistical analysis (applicable to any DisCSP)

Proceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004

Volumn , Issue , 2004, Pages 711-715

  Silaghi, Marius Cǎlin ^a  

^a Florida Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARITHMETIC CIRCUITS; CONSTRAINT SATISFACTION PROBLEMS (CSP); DISTRIBUTED CSP (DISCSP); REJECTION ENCODING;

ALGORITHMS; CONSTRAINT THEORY; CRYPTOGRAPHY; DATA REDUCTION; FUNCTIONS; GRAPHIC METHODS; INFORMATION ANALYSIS; NETWORK PROTOCOLS; PROBABILITY; SECURITY OF DATA;

SCHEDULING;

EID: 15544367557     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WI.2004.10147     Document Type: Conference Paper

References (7)

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. Communications of the ACM, 24(2):84-88, 1981.
3. T. Herlea, J. Claessens, G. Neven, F. Piessens, B. Preneel, and B. Decker. On securely scheduling a meeting. In Proc. of IFIP SEC, pages 183-198, 2001.
4. M. Silaghi. Solving a distributed CSP with cryptographic multi-party computations, without revealing constraints and without involving trusted servers. In IJCAI-DCR, 2003.
5. M. Silaghi and V. Rajeshirke. The effect of policies for selecting the solution of a DisCSP on privacy loss. In AAMAS, 2004.
6. M. C. Silaghi and B. Faltings. A comparison of DisCSP algorithms with respect to privacy. In AAMAS-DCR, 2002.
7. R. Wallace and M. Silaghi. Using privacy loss to guide decisions in distributed CSP search. In FLAIRS'04, 2004.