Privacy-preserving cooperative statistical analysis

Proceedings - Annual Computer Security Applications Conference, ACSAC

Volumn 2001-January, Issue , 2001, Pages 102-110

  Du, Wenliang ^a   Atallah, Mikhail J ^b  

^a Syracuse University   (United States)

^b Purdue University   (United States)

Author keywords

Computer science education; Computer security; Cryptographic protocols; Ducts; Educational institutions; Information security; Internet; Performance analysis; Remuneration; Statistical analysis

Indexed keywords

CRYPTOGRAPHY; DATA PRIVACY; DUCTS; EDUCATION COMPUTING; INTERNET; INTERNET PROTOCOLS; PERTURBATION TECHNIQUES; SECURITY OF DATA; SECURITY SYSTEMS; STATISTICS;

COMPUTER SCIENCE EDUCATION; CRYPTOGRAPHIC PROTOCOLS; EDUCATIONAL INSTITUTIONS; PERFORMANCE ANALYSIS; REMUNERATION;

STATISTICAL METHODS;

EID: 84927517111     PISSN: 10639527     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSAC.2001.991526     Document Type: Conference Paper

References (13)

1. J. Benaloh. Dense probabilistic encryption. In Proceedings of the Workshop on Selected Areas of Cryptography, pages 120-128, Kingston, ON, May 1994
2. G. Brassard, C. Crepeau and J. Robert. All-or-nothing disclosure of secrets. In Advances in Cryptology-Crypto86, Lecture Notes in Computer Science, volume 234-238, 1987
3. O. Goldreich. Secure multi-party computation (working draft). Available from http://www.wisdom.weizmann.ac.il/home/oded/public html/ foc.html, 1998
4. S. Even, O. Goldreich and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28:637-647, 1985
5. C. Cachin, S. Micali and M. Stadler. Computationally private information retrieval with polylogarithmic communication. Advances in Cryptology: EUROCRYPT '99, Lecture Notes in Computer Science, 1592:402-414, 1999
6. O. Goldreich, S. Micali and A. Wigderson. How to play any mental game. In Proceedings of the 19th annual ACM symposium on Theory of computing, pages 218-229, 1987
7. D. Naccache and J. Stern. A new cryptosystem based on higher residues. In Proceedings of the 5th ACM Conference on Computer and Communications Security, pages 59-66, 1998
8. Author names are deleted for blind review purpose. Protocols for secure remote database access with approximate matching. Technical report, 2001
9. Author names are deleted for blind review purpose. Secure multi-party computational geometry. Technical report, 2001
10. M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation (extended abstract). In Proceedings of the 31th ACM Symposium on Theory of Computing, pages 245-254, Atanta, GA, USA, May 1-4 1999
11. T. Okamoto and S. Uchiyama. An efficient public-key cryptosystem. In Advances in Cryptology-EUROCRYPT 98, pages 308-318, 1998
12. P. Paillier. Public-key cryptosystems based on composite degree residue classes. In Advances in Cryptology-EUROCRYPT 99, pages 223-238, 1999
13. A.C. Yao. How to generate and exchange secrets. In Proceedings 27th IEEE Symposium on Foundations of Computer Science, pages 162-167, 1986