Leveraging the "Multi" in Secure Multi-Party Computation

Proceedings of the ACM Workshop on Privacy in the Electronic Society

Volumn , Issue , 2003, Pages 53-59

  Vaidya, Jaideep ^a   Clifton, Chris ^a  

^a Purdue University   (United States)

Author keywords

Privacy; Secure Distributed Computation; Secure Multi party Computation

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; FUNCTIONS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; RANDOM PROCESSES; VECTORS;

SECURE DISTRIBUTED COMPUTATION; SECURE MULTI-PARTY COMPUTATION;

DATA PRIVACY;

EID: 1642384656     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1005140.1005149     Document Type: Conference Paper

References (22)

1. R. Agrawal, A. Evfimievski, and R. Srikant. Information sharing across private databases, In Proceedings of ACM SIGMOD International Conference on Management of Data, San Diego, California, June 9-12 2003.
2. M. J. Atallah and W. Du. Secure multi-party computational geometry. In Seventh International Workshop on Algorithms and Data Structures (WADS 2001), Providence, Rhode Island, USA, Aug. 8-10 2001. [Online]. Available: http://www.cerias.purdue.edu/homes/duw/research/paper/wads2001.ps
3. D. Beaver. Commodity-based cryptography (extended abstract). In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. ACM Press, 1997, pages 446-455.
4. D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditionally secure protocols. In Proceedings of the 20th ACM Symposium on the Theory of Computing. ACM Press, 1988, pages 11-19.
5. W. Du and Z. Zhan. A practical approach to solve secure multi-party computation problems. In Proceedings of New Security Paradigms Workshop, Virginia Beach, virginia, USA, September 23-26 2002.
6. W. Du and M. J. Atallah. Privacy-preserving cooperative scientific computations. In 14th IEEE Computer Security Foundations Workshop, Nova Scotia, Canada, June 11-13 2001, pages 273-282. [Online]. Available: http://portal.acm.org
7. W. Du and M. J. Atallah. Privacy-preserving statistical analysis. In Proceeding of the 17th Annual Computer Security Applications Conference, New Orleans, Louisiana, USA, December 10-14 2001. [Online]. Available: http://www.cerias.purdue.edu/homes/duw/research/paper/acsac2001.ps
8. W. Du and M. J. Atallah. Secure multi-party computation problems and their applications: A review and open problems. In New Security Paradigms Workshop, Cloudcroft, New Mexico, USA, September 11-13 2001, pages 11-20. [Online]. Available: http://www.cerias.purdue.edu/homes/duw/research/paper/nspw2001.ps
9. W. Du and Z. Zhan. Building decision tree classifier on private data. In IEEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining, C. Clifton and V. Estivill-Castro, Eds., vol. 14. Maebashi City, Japan: Australian Computer Society, Dec. 9 2002, pages 1-8. [Online]. Available: http://www.jrpit.flinders.edu.au/CRPITVolume14.html
10. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game - a completeness theorem for protocols with honest majority. In 19th ACM Symposium on the Theory of Computing, 1987, pages 218-229. [Online]. Available: http://doi.acm.org/10.1145/28395.28420
11. O. Goldreich. Secure multi-party computation. Sept. 1998, (working draft). [Online]. Available: http://www.wisdom.weizmann.ac.il/~oded/pp.html
12. I. Ioannidis, A. Grama, and M. Atallah. A secure protocol for computing dot-products in clustered and distributed environments. In The 2002 International Conference on Parallel Processing, Vancouver, British Columbia, Aug. 18-21 2002.
13. M. Kantarcioglu and J. Vaidya. An architecture for privacy-preserving mining of client information. In IEEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining, C. Clifton and V. Estivill-Castro, Eds., vol. 14. Maebashi City, Japan: Australian Computer Society, Dec. 9 2002, pages 37-42. [Online]. Available: http://crpit.com/Vol14.html
14. M. Kantarcioǧlu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowledge Data Eng., to appear.
15. Y. Lindell and B. Pinkas. Privacy preserving data mining. In Advances in Cryptology - CRYPTO 2000. Springer-Verlag, Aug. 20-24 2000, pages 36-54. [Online]. Available: http://link.springer.de/link/service/series/0558/bibs/1880/18800036.htm
16. M. Naor and K. Nissim. Communication preserving protocols for secure function evaluation. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Heraklion, Crete, Greece, July 6-8 2001. [Online]. Available: http://doi.acm.org/10.1145/380752.380855
17. M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In Proceedings of the 1st ACM Conference on Electronic Commerce. ACM Press, 1999.
18. R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120-126, 1978. [Online]. Available: http://doi.acm.org/10.1145/359340.359342
19. B. Schneier, Applied Cryptography. 2nd ed. John Wiley & Sons, 1995.
20. J. Vaidya and C. Clifton. Privacy preserving association rule mining in vertically partitioned data. In The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, July 23-26 2002, pages 639-644. [Online]. Available: http://doi.acm.org/10.1145/775047.775142
21. J. Vaidya and C. Clifton. Secure set intersection cardinality with application to association rule mining. ACM Transactions on Information Systems Security, submitted.
22. A. C. Yao. How to generate and exchange secrets. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science. IEEE, 1986, pages 162-167.