Privacy preserving data mining

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1880, Issue , 2000, Pages 36-54

  Lindell, Yehuda ^a   Pinkas, Benny ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DATA PRIVACY; DATABASE SYSTEMS; DECISION TREES; TREES (MATHEMATICS);

COMPLEX PROBLEMS; CRYPTOGRAPHIC PROTOCOLS; DATA MINING ALGORITHM; DECISION TREE LEARNING; GENERIC SOLUTIONS; MEDICAL RESEARCH; PRIVACY PRESERVING DATA MINING; SECURE MULTI-PARTY COMPUTATION;

DATA MINING;

EID: 84974555530     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44598-6_3     Document Type: Conference Paper

References (21)

1. M. Bellare and S. Micali, Non-interactive oblivious transfer and applications, Advances in Cryptology-Crypto ’89, pp. 547-557, 1990.
2. M. Ben-Or, S. Goldwasser and A. Wigderson, Completeness theorems for non cryptographic fault tolerant distributed computation, 20th STOC, (1988), 1-9.
3. D. Boneh and M. Franklin, Efficient generation of shared RSA keys, Proc. of Crypto’ 97, LNCS, Vol. 1233, Springer-Verlag, pp. 425-439, 1997.
4. R. Canetti, Security and Composition of Multi-party Cryptographic Protocols. To appear in the Journal of Cryptology. Available from the Theory of Cryptography Library at http://philby.ucsd.edu/cryptlib, 1998.
5. D. Chaum, C. Crepeau and I. Damgard, Multiparty unconditionally secure protocols, 20th Proc. ACM Symp. on Theory of Computing, (1988), 11-19.
6. B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan, Private Information Retrieval, 36th FOCS, pp. 41-50, 1995.
7. R. Cramer, N. Gilboa, M. Naor, B. Pinkas and G. Poupard, Oblivious Polynomial Evaluation, 2000.
8. S. Even, O. Goldreich and A. Lempel, A Randomized Protocol for Signing Contracts, Communications of the ACM 28, pp. 637-647, 1985.
9. R. Fagin, M. Naor and P. Winkler, Comparing Information Without Leaking It, Communications of the ACM, vol 39, May 1996, pp. 77-85.
10. J. Feigenbaum, J. Fong, M. Strauss and R. N. Wright, Secure Multiparty Computation of Approximations, manuscript, 2000.
11. N. Gilboa, Two Party RSA Key Generation, Proc of Crypto ’99, Lecture Notes in Computer Science, Vol. 1666, Springer-Verlag, pp. 116-129, 1999.
12. O. Goldreich, Secure Multi-Party Computation, 1998. (Available at http://philby.ucsd.edu)
13. 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, pp. 218-229, 1987.
14. J. Kilian, Uses of randomness in algorithms and protocols, MIT Press, 1990.
15. T. Mitchell, Machine Learning. McGraw Hill, 1997.
16. M. Naor and B. Pinkas, Oblivious Transfer and Polynomial Evaluation, Proc. of the 31st STOC, Atlanta, GA, pp. 245-254, May 1-4, 1999.
17. M. Naor and B. Pinkas, Efficient Oblivious Transfer Protocols, manuscript, 2000.
18. P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuocity Classes. Proc. of Eurocrypt ’99, LNCS Vol. 1592, pp. 223-238, 1999.
19. J. Ross Quinlan, Induction of Decision Trees. Machine Learning 1(1): 81-106(1986)
20. M. O. Rabin, How to exchange secrets by oblivious transfer, Tech. Memo TR-81, Aiken Computation Laboratory, 1981.
21. A.C. Yao, How to generate and exchange secrets, Proc. of the 27th IEEE Symp. on Foundations of Computer Science, 1986, pp. 162-167.