Reliable medical recommendation systems with patient privacy

ACM Transactions on Intelligent Systems and Technology

Volumn 4, Issue 4, 2013, Pages

  Hoens, T Ryan ^a   Blanton, Marina ^a   Steele, Aaron ^a   Chawla, Nitesh V ^a  

^a University of Notre Dame   (United States)

Author keywords

Framework; Privacy; Recommendation systems

Indexed keywords

FRAMEWORK; MEDICAL CONDITIONS; MEDICAL INFORMATION; PATIENT DATA; PATIENT PRIVACIES; PRIVACY CONCERNS; PROCESSING ARCHITECTURES; SECURE MULTI-PARTY COMPUTATION;

DATA PRIVACY; HOSPITAL DATA PROCESSING; RECOMMENDER SYSTEMS;

ARCHITECTURE;

EID: 84885617136     PISSN: 21576904     EISSN: 21576912     Source Type: Journal    
DOI: 10.1145/2508037.2508048     Document Type: Conference Paper

References (52)

1. ARMKNECHT, F. AND STRUFE, T. 2011. An efficient distributed privacy-preserving recommendation system. In Proceedings of the IEEE Ad Hoc Networking Workshop. 65-70.
2. BANKOVIC, Z.,VALLEJO, J.,FRAGA, D., ANDMOYA, J. 2011. Detecting bad-mouthing attacks on reputation systems using self-organizing maps. In Computational Intelligence in Security for Information Systems. Lecture Notes in Computer Science, vol. 6694, Springer Verlag, Berlin Heidelberg, 9-16.
3. BAUDRON, O.,FOUQUE, P.-A., POINTCHEVAL, D.,STERN, J., AND POUPARD,G. 2001. Practicalmulti-candidate election scheme. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC). 274-283.
4. BERJANI, B. AND STRUFE, T. 2011. A recommendation system for spots in location-based online social networks. In Proceedings of the EuroSys Workshop on Social Network Systems.
5. BLANTON, M. 2008. Online subscriptions with anonymous access. In Proceedings of the ACM Symposium on Information, Computer and Communications Security (ASIACCS). 217-227.
6. BLANTON, M. AND GASTI, P. 2011. Secure and efficient protocols for iris and fingerprint identification. In Proceedings of the European Symposium on Research in Computer Security (ESORICS). 190-209.
7. BONEH, D. AND FRANKLIN, M. 1997. Efficient generation of shared RSA keys. In Advances in Cryptology -CRYPTO. Lecture Notes in Computer Science, vol. 1294, Springer Verlag, Berlin Heidelberg, 425-439.
8. BOUDOT, F. 2000. Efficient proofs that a committed number lies in an interval. In Advances in Cryptology -EUROCRYPT. Lecture Notes in Computer Science, vol. 1807, Springer Verlag, Berlin Heidelberg, 431-444.
9. BUNN, P. AND OSTROVSKY, R. 2007. Secure two-party k-means clustering. In Proceedings of the ACM Conference on Computer and Communications Security (CCS). 486-497.
10. BURKE, R., MOBASHER, B.,WILLIAMS, C., AND BHAUMIK, R. 2006. Classification features for attack detection in collaborative recommender systems. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 542-547.
11. CAMENISCH, J. AND LYSYANSKAYA, A. 2002. A signature scheme with efficient protocols. In Proceedings of the International Conference on Security in Communication Networks (SCN). Lecture Notes in Computer Science, vol. 2576, Springer Verlag, Berlin Heidelberg, 268-289.
12. CAMENISCH, J. AND LYSYANSKAYA, A. 2004. Signature schemes and anonymous credentials from bilinear maps. In Advances in Cryptology-CRYPTO. Lecture Notes in Computer Science, vol. 3152, Springer Verlag, Berlin Heidelberg, 56-72.
13. CAMENISCH, J. AND STADLER, M. 1997. Proof systems for general statements about discrete logarithms. Tech. rep. No. 260, ETH Zurich.
14. CANETTI, R. 2000. Security and composition of multiparty cryptographic protocols. J. Cryptol. 13, 1, 143-202.
15. CANNY, J. F. 2002a. Collaborative filtering with privacy. In Proceedings of the IEEE Symposium on Security and Privacy. 45-57.
16. CANNY, J. F. 2002b. Collaborative filtering with privacy via factor analysis. In Proceedings of the ACM Conference on Research and Development in Information Retrieval (SIGIR). 238-245.
17. CHEN, S. AND WILLIAMS, M. A. 2010. Towards a comprehensive requirements architecture for privacy-Aware social recommender systems. In Proceedings of the Asia-Pacific Conference on Conceptual Modelling. Vol. 110. 33-42.
18. CHIRITA, P.-A., NEJDL, W., AND ZAMFIR, C. 2005. Preventing shilling attacks in online recommender systems. In Proceedings of the ACM International Workshop on Web Information and Data Management (WIDM). 67-74.
19. CRAMER, R., DAMGARD, I., AND NIELSEN, J. 2001. Multiparty computation from threshold homomorphic encryption. In Advances in Cryptology -EUROCRYPT. Lecture Notes in Computer Science, vol. 2045, Springer Verlag, Berlin Heidelberg, 280-289.
20. DAMGARD, I., GEISLER, M., AND KRØIGARD, M. 2008a. A correction to efficient and secure comparison for on-line auctions. Cryptology ePrint Archive, Report 2008/321.
21. DAMGARD, I., GEISLER, M., AND KRØIGARD, M. 2008b. Homomorphic encryption and secure comparison. J. Appl. Cryptol. 1, 1, 22-31.
22. DAMGARD, I. AND JURIK, M. 2001. A generalisation, a simplification and some applications of Paillier's probabilistic public-key system. In Proceedings of the InternationalWorkshop on Practice and Theory in Public Key Cryptography (PKC). 119-136.
23. DAMGARD, I. AND KOPROWSKI, M. 2001. Practical threshold RSA signatures without a trusted dealer. In Advances in Cryptology -EUROCRYPT. Lecture Notes in Computer Science, vol. 2045, Springer Verlag, Berlin Heidelberg, 152-165.
24. DELLAROCAS, C. 2000. Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior. In Proceedings of the ACM Conference on Electronic Commerce (EC). 150-157.
25. DIERKS, T. AND ALLEN, C. 1999. The TLS Protocol Version 1.0. RFC 2246 (Proposed Standard).
26. DIERKS, T. AND RESCORLA, E. 2006. The Transport Layer Security (TLS) Protocol Version 1.1. RFC 4346 (Proposed Standard).
27. DIERKS, T. AND RESCORLA, E. 2008. The Transport Layer Security (TLS) Protocol Version 1.2. RFC 5246 (Proposed Standard).
28. DWORK, C. 2006. Differential privacy. In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 4052, Springer Verlag, Berlin Heidelberg, 1-12.
29. DWORK, C. 2008. Differential privacy: A survey of results. In Proceedings of the International Conference on Theory and Applications of Models of Computation (TAMC). Lecture Notes in Computer Science, vol. 4978, Springer Verlag, Berlin Heidelberg, 1-19.
30. FOUQUE, P.-A., POUPARD, G., AND STERN, J. 2000. Sharing decryption in the context of voting or lotteries. In Proceedings of the International Conference on Financial Cryptography (FC). Lecture Notes in Computer Science, vol. 1962, Springer Verlag, Berlin Heidelberg, 90-104.
31. GOLDREICH,O. 2004. Foundations ofCryptography: Volume 2, Basic Applications. Cambridge University Press.
32. GROTH, J. 2010. A verifiable secret shuffle of homomorphic encryptions. J. Crypt. 546-579.
33. GROTH, J. AND ISHAI, Y. 2008. Sub-linear zero-knowledge argument for correctness of a shuffle. In Advances in Cryptology -EUROCRYPT. Lecture Notes in Computer Science, vol. 4965, Springer Verlag, Berlin Heidelberg, 379-396.
34. HOENS, T. R., BLANTON, M., AND CHAWLA, N. 2010a. A private and reliable recommendation system using a social network. In Proceedings of the IEEE International Conference on Information Privacy, Security, Risk and Trust (PASSAT). 816-825.
35. HOENS, T. R., BLANTON, M., AND CHAWLA, N. 2010b. Reliable medical recommendation systems with patient privacy. In Proceedings of the ACM International Health Informatics Symposium (IHI). 173-182.
36. KARGUPTA, H., DATTA, S.,WANG, Q., AND SIVAKUMAR, K. 2003. On the privacy preserving properties of random data perturbation techniques. In Proceedings of the IEEE International Conference on Data Mining (ICDM). 99-106.
37. KATZENBEISSER, S. AND PETKOVIC, M. 2008. Privacy-preserving recommendation systems for consumer healthcare services. In Proceedings of the IEEE International Conference on Availability, Reliability and Security (ARES). 889-895.
38. LAM, S. K. AND RIEDL, J. 2004. Shilling recommender systems for fun and profit. In Proceedings of the ACM International Conference on World Wide Web (WWW). 393-402.
39. LIPMAA, H., ASOKAN, N., AND NIEMI, V. 2002. Secure Vickrey auctions without threshold trust. In Proceedings of the 6th International Conference on Financial Cryptography (FC). 87-101.
40. MCSHERRY, F. AND MIRONOV, I. 2009. Differentially private recommender systems: Building privacy into the Netflix prize contenders. In Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (KDD). 627-636.
41. MEHTA, B.,HOFMANN, T., AND FANKHAUSER, P. 2007. Lies and propaganda: Detecting spam users in collaborative filtering. In Proceedings of the International Conference on Intelligent User Interfaces. 14-21.
42. MILLER, B.,KONSTAN, J., AND RIEDL, J. 2004. Pocketlens: Toward a personal recommender system. ACM Trans. Inf. Syst. 22, 3, 437-476.
43. MOBASHER, B., BURKE, R., WILLIAMS, C., AND BHAUMIK, R. 2006. Analysis and detection of segment-focused attacks against collaborative recommendation. Adv. Web Mining Web Usage Ana. 96-118.
44. PAILLIER, P. 1999. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology -EUROCRYPT. Lecture Notes in Computer Science, vol. 1592, Springer Verlag, Berlin Heidelberg, 223-238.
45. PEDERSEN, T. 1991. Non-interactive and information-Theoretic secure verifiable secret sharing. In Advances in Cryptology -CRYPTO. Lecture Notes in Computer Science, vol. 576, Springer Verlag, Berlin Heidelberg, 129-140.
46. PENG, K. AND BAO, F. 2010. A shuffling scheme with strict and strong security. In Proceedings of the 4th International Conference on Emerging Security Information, Systems, and Technologies. 201-206.
47. PENG, K., BOYD, C., AND DAWSON, E. 2005. Simple and efficient shuffling with provable correctness and ZK privacy. In Advances in Cryptology -CRYPTO. Lecture Notes in Computer Science, vol. 3621, Springer Verlag, Berlin Heidelberg, 188-204.
48. POLAT, H. AND DU, W. 2005. SVD-based collaborative filtering with privacy. In Proceedings of the ACM Symposium on Applied Computing (SAC). 791-795.
49. SCHOENMAKERS, B. AND TUYLS, P. 2006. Efficient binary conversion for Paillier encrypted values. In Advances in Cryptology -EUROCRYPT. Lecture Notes in Computer Science, vol. 4004, Springer Verlag, Berlin Heidelberg, 522-537.
50. SRIVATSA, M., XIONG, L., AND LIU, L. 2005. Trustguard: Countering vulnerabilities in reputation management for decentralized overlay networks. In Proceedings of the International Conference on World Wide Web (WWW). 422-431.
51. ZHAN, J., HSIEH, C. L., WANG, I. C., HSU, T. S., LIAU, C. J., AND WANG, D. W. 2010. Privacy-preserving collaborative recommender systems. Syst. Man, Cybernet. Part C: Appl. Rev. 40, 4, 472-476.
52. ZHANG, S., FORD, J., AND MAKEDON, F. 2006. A privacy-preserving collaborative filtering scheme with two-way communication. In Proceedings of the ACM Conference on Electronic Commerce (EC). 316-323.