Secure multi-party computation problems and their applications: A review and open problems

Proceedings New Security Paradigms Workshop

Volumn , Issue , 2001, Pages 13-22

  Du, Wenliang ^a   Atallah, Mikhail J ^b  

^a Syracuse University   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA MINING; DATA PRIVACY; DATABASE SYSTEMS; INTERNET;

COOPERATIVE COMPUTATION; PRIVATE INFORMATION; SECURE MULTIPARTY COMPUTATION PROBLEM;

SECURITY OF DATA;

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

References (64)

1. Rakesh Agrawal and Ramakrishnan Srikant. Privacy-preserving data mining. In Proceedings of the 2000 ACM SIGMOD on Management of data, pages 439-450, Dallas, TX USA, May 15 - 18 2000.
2. H. Kargupta, B. Park, D. Hershberger and E. Johnson. Collective data mining: A new perspective toward distributed data mining. Advances in Distributed and Parallel Knowledge Discovery, 1999.
3. A. Apostolico and Z. Galil, editors. Pattern Matching Algorithms. Oxford University Press, 1997.
4. J. Biskup and U. Flegel. On pseudonymization of audit data for intrusion detection. In Workshop on Design Issues in Anonymity and Unobservability, pages 161-180, 2000.
5. J. Biskup and U. Flegel. Transaction-based pseudonyms in audit data for privacy respecting intrusion detection. In Recent Advances in Intrusion Detection, pages 28-48, 2000.
6. C. Cachin. Efficient private bidding and auctions with an oblivious third party. In Proceedings of the 6th ACM conference on Computer and communications security, pages 120-127, Singapore, November 1-4 1999.
7. B. Chor and N. Gilboa. Computationally private information retrieval (extended abstract). In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, El Paso, TX USA, May 4-6 1997.
8. G. Brassard, C. Crépeau and J. Robert. All-or-nothing disclosure of secrets. In Advances in Cryptology - Crypto86, Lecture Notes in Computer Science, volume 234-238, 1987.
9. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994.
10. Y. Desmedt. Some recent research aspects of threshold cryptography. In Lecture Notes in Computer Science 1396, pages 158-173, Springer-Verlag, 1997.
11. Wenliang Du and Mikhail J. Atallah. Protocols for secure remote database access with approximate matching. In 7th ACM Conference on Computer and Communications Security (ACMCCS 2000), The First Workshop on Security and Privacy in E-Commerce, Athens, Greece, November 2000.
12. Wenliang Du and Mikhail J. Atallah. Privacy-preserving cooperative scientific computations. In 14th IEEE Computer Security Foundations Workshop, Nova Scotia, Canada, June 11-13 2001.
13. Wenliang Du and Mikhail J. Atallah. Privacy-preserving statistical analysis. In Proceeding of the 17th Annual Computer Security Applications Conference, New Orleans, Louisiana, USA, December 10-14 2001.
14. Wenliang Du and Mikhail J. Atallah. Secure multi-party computational geometry. In WADS2001: Seventh International Workshop on Algorithms and Data Structures, Providence, Rhode Island, USA, August 8-10 2001.
15. P. Gemmell. An introduction to threshold cryptography. In CryptoBytes, volume 2. RSA Laboratories, 1997.
16. O. Goldreich, Secure multi-party computation (working draft). Available from http://www.wisdom.weizmann.ac.il/home/oded/public_html/foc.html, 1998.
17. S. Even, O. Goldreich and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28:637-647, 1985.
18. S. Goldwasser. Multi-party computations: Past and present. In Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, Santa Barbara, CA USA, August 21-24 1997.
19. Y. Gertner, S. Goldwasser and T. Malkin, A random server model for private information retrieval. In 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM '98), 1998.
20. R. Gonzalezi and R. Woods. Digital Image Processing. Addison-Wesley, Reading, MA, 1992.
21. M. S. Goodstadt and V. Gruson. The randomized response technique: A test on drug use. Journal of the American Statistical Association, 70(352):814-818, December 1975.
22. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Comutational Biology. Cambridge University Press, 1997.
23. G. Di-Crescenzo, Y. Ishai and R. Ostrovsky. Universal service-providers for database private information retrieval. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, September 21 1998.
24. Y. Ishai and E. Kushilevitz. Improved upper bounds on information-theoretic private information retrieval (extended abstract). In Proceedings of the thirty-first annual ACM symposium on Theory of computing, Atlanta, GA USA, May 1-4 1999.
25. A. Jain. Fundamentals of Digital Image Processing. Prentice Hall, Englewood Cliffs, NJ, 1989.
26. B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan. Private information retrieval. In Proceedings of IEEE Symposium on Foundations of Computer Science, Milwaukee, WI USA, October 23-25 1995.
27. E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In Proceedings of the 38th annual IEEE computer society conference on Foundation of Computer Science, Miami Beach, Florida USA, October 20-22 1997.
28. Y. Gertner, Y. Ishai, E. Kushilevitz and T. Malkin. Protecting data privacy in private information retrieval schemes. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, Dallas, TX USA, May 24-26 1998.
29. Y. Lindel and B. Pinkas. Privacy preserving data mining. In Advances in Cryptology - Crypto2000, Lecture Notes in Computer Science, volume 1880, 2000.
30. 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.
31. 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.
32. 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, Atlanta, GA, USA, May 1-4 1999.
33. K. H. Pollock and Y. Bek. A comparison of three randomized response models for quantitative data. Journal of the American Statistical Association, 71(356):994-886, December 1976.
34. M. Rabin. How to exchange secrets by oblivious transfer. Technical Report Tech. Memo TR-81, Aiken Computation Laboratory, 1981.
35. B. Schneier. Applied Cryptography: Protocols, Algorithms, and Source Code in C. John Wiley & Sons, Inc., 1996.
36. A. Shamir. How to share a secret. Communication of the ACM, 22(11):612-613, 1979.
37. S. L. Warner. Randomized response: A surey technique for eliminating evasive answer bias. Journal of the American Statistical Association, 60(309):63-69, March 1965.
38. S. L. Warner. Randomized response: A surey technique for eliminating evasive answer bias. Journal of the American Statistical Association, 66(336):884-888, December 1971.
39. A.C. Yao. Protocols for secure computations. In Proceedings of the 23rd
40. P. Gemmell. An introduction to threshold cryptography. In CryptoBytes, volume 2. RSA Laboratories, 1997.
41. O. Goldreich, Secure multi-party computation (working draft). Available from http://www.wisdom.weizmann.ac.il/home/oded/public_html/foc.html, 1998.
42. S. Even, O. Goldreich and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28:637-647, 1985.
43. S. Goldwasser. Multi-party computations: Past and present. In Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, Santa Barbara, CA USA, August 21-24 1997.
44. Y. Gertner, S. Goldwasser and T. Malkin, A random server model for private information retrieval. In 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM '98), 1998.
45. R. Gonzalezi and R. Woods. Digital Image Processing. Addison-Wesley, Reading, MA, 1992.
46. M. S. Goodstadt and V. Gruson. The randomized response technique: A test on drug use. Journal of the American Statistical Association, 70(352):814-818, December 1975.
47. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Comutational Biology. Cambridge University Press, 1997.
48. G. Di-Crescenzo, Y. Ishai and R. Ostrovsky. Universal service-providers for database private information retrieval. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, September 21 1998.
49. Y. Ishai and E. Kushilevitz. Improved upper bounds on information-theoretic private information retrieval (extended abstract). In Proceedings of the thirty-first annual ACM symposium on Theory of computing, Atlanta, GA USA, May 1-4 1999.
50. A. Jain. Fundamentals of Digital Image Processing. Prentice Hall, Englewood Cliffs, NJ, 1989.
51. B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan. Private information retrieval. In Proceedings of IEEE Symposium on Foundations of Computer Science, Milwaukee, WI USA, October 23-25 1995.
52. E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In Proceedings of the 38th annual IEEE computer society conference on Foundation of Computer Science, Miami Beach, Florida USA, October 20-22 1997.
53. Y. Gertner, Y. Ishai, E. Kushilevitz and T. Malkin. Protecting data privacy in private information retrieval schemes. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, Dallas, TX USA, May 24-26 1998.
54. Y. Lindel and B. Pinkas. Privacy preserving data mining. In Advances in Cryptology - Crypto2000, Lecture Notes in Computer Science, volume 1880, 2000.
55. 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.
56. 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.
57. 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, Atlanta, GA, USA, May 1-4 1999.
58. K. H. Pollock and Y. Bek. A comparison of three randomized response models for quantitative data. Journal of the American Statistical Association, 71(356):994-886, December 1976.
59. M. Rabin. How to exchange secrets by oblivious transfer. Technical Report Tech. Memo TR-81, Aiken Computation Laboratory, 1981.
60. B. Schneier. Applied Cryptography: Protocols, Algorithms, and Source Code in C. John Wiley & Sons, Inc., 1996.
61. A. Shamir. How to share a secret. Communication of the ACM, 22(11):612-613, 1979.
62. S. L. Warner. Randomized response: A surey technique for eliminating evasive answer bias. Journal of the American Statistical Association, 60(309):63-69, March 1965.
63. S. L. Warner. Randomized response: A surey technique for eliminating evasive answer bias. Journal of the American Statistical Association, 66(336):884-888, December 1971.
64. A.C. Yao. Protocols for secure computations. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, 1982.Annual IEEE Symposium on Foundations of Computer Science, 1982.