Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 381361, 12 pages
http://dx.doi.org/10.1155/2014/381361
Research Article

Sharing Privacy Protected and Statistically Sound Clinical Research Data Using Outsourced Data Storage

Center for Information Security Technologies (CIST), Korea University, Anam-dong, Seongbuk-gu, Seoul 136-713, Republic of Korea

Received 14 November 2013; Accepted 28 April 2014; Published 18 May 2014

Academic Editor: Jongsung Kim

Copyright © 2014 Geontae Noh et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. “Health Iinsurance Portability and Accountability Act of 1996,” Public Law 104-191, 104th Congress, August 1996.
  2. Z. Lin, A. B. Owen, and R. B. Altman, “Genomic research and human subject privacy,” Science, vol. 305, no. 5681, p. 183, 2004. View at Publisher · View at Google Scholar · View at Scopus
  3. G. Loukides, J. C. Denny, and B. Malin, “The disclosure of diagnosis codes can breach research participants' privacy,” Journal of the American Medical Informatics Association, vol. 17, no. 3, pp. 322–327, 2010. View at Publisher · View at Google Scholar · View at Scopus
  4. K. El Emam, “Methods for the de-identification of electronic health records for genomic research,” Genome Medicine, vol. 3, no. 4, article 25, pp. 1–25, 2011. View at Publisher · View at Google Scholar · View at Scopus
  5. P. Samarati and L. Sweeney, “Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression,” Tech. Rep. SRI-CSL-98-04, SRI Computer Science Laboratory, 1998. View at Google Scholar
  6. P. Samarati, “Protecting respondents' identities in microdata release,” IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 6, pp. 1010–1027, 2001. View at Publisher · View at Google Scholar · View at Scopus
  7. L. Sweeney, “k-anonymity: a model for protecting privacy,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 10, no. 5, pp. 557–570, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam, “-diversity: privacy beyond k-anonymity,” ACM Transactions on Knowledge Discovery from Data, vol. 1, no. 1, article 3, pp. 1–3, 2007. View at Publisher · View at Google Scholar · View at Scopus
  9. N. Li, T. Li, and S. Venkatasubramanian, “t-closeness: privacy beyond k-anonymity and -diversity,” in Proceedings of the 23rd International Conference on Data Engineering (ICDE '07), pp. 106–115, April 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. D. R. Karp, S. Carlin, R. Cook-Deegan et al., “Ethical and practical issues associated with aggregating databases,” PLoS Medicine, vol. 5, no. 9, article e190, pp. 1333–1337, 2008. View at Publisher · View at Google Scholar · View at Scopus
  11. J. Buchmann, A. May, and U. Vollmer, “Perspectives for cryptographic long-term security,” Communications of the ACM, vol. 49, no. 9, pp. 50–55, 2006. View at Publisher · View at Google Scholar · View at Scopus
  12. P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing, vol. 26, no. 5, pp. 1484–1509, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. C. Gentry, “Fully homomorphic encryption using ideal lattices,” in Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC '09), pp. 169–178, May 2009. View at MathSciNet
  14. C. Gentry, S. Halevi, and V. Vaikuntanathan, “A simple BGN-type cryptosystem from LWE,” in Advances in Cryptology—EUROCRYPT 2010, vol. 6110 of Lecture Notes in Computer Science, pp. 506–522, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. H. Hacıgümüş, B. Iyer, and S. Mehrotra, “Efficient execution of aggregation queries over encrypted relational databases,” in Database Systems for Advanced Applications, vol. 2973 of Lecture Notes in Computer Science, pp. 125–136, 2004. View at Google Scholar
  16. E. Mykletun and G. Tsudik, “Aggregation queries in the databaase-as-a-service model,” in Proceedings of 20th Annual on Data and Applications Security, pp. 89–103, July 2006.
  17. Z. Yang, S. Zhong, and R. N. Wright, “Privacy-preserving queries on encrypted data,” in Proceedings of the 11th European Symposium On Research In Computer Security (ESORICS '06), pp. 479–495, September 2006.
  18. G. Amanatidis, A. Boldyreva, and A. O'Neill, “Provably-secure schemes for basic query support in outsourced databases,” in Data and Applications Security XXI, pp. 14–30, 2007. View at Google Scholar
  19. T. Ge and S. Zdonik, “Answering aggregation queries in a secure system model,” in Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB '07), pp. 519–530, September 2007.
  20. W. K. Wong, D. W. Cheung, B. Kao, and N. Mamoulis, “Secure kNN computation on encrypted databases,” in Proceedings of the ACM International Conference on Management of Data (SIGMOD '09), pp. 139–152, June 2009. View at Publisher · View at Google Scholar · View at Scopus
  21. B. Thompson, S. Haber, W. G. Horne, T. Sander, and D. Yao, “Privacy-preserving computation and verification of aggregate queries on outsourced databases,” in Proceedings of the 9th Privacy Enhancing Technologies Symposium (PETS '09), pp. 185–201, August 2009. View at Publisher · View at Google Scholar
  22. A. D. Molina, M. Salajegheh, and K. Fu, “HICCUPS: health information collaborative collection using privacy and security,” in Proceedings of the 1st ACM Workshop on Security and Privacy in Medical and Home-Care Systems (SPIMACS '09), pp. 21–30, November 2009. View at Publisher · View at Google Scholar · View at Scopus
  23. R. Lu, X. Liang, X. Li, X. Lin, and X. Shen, “EPPA: an efficient and privacy-preserving aggregation scheme for secure smart grid communications,” IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 9, pp. 1621–1632, 2012. View at Publisher · View at Google Scholar
  24. O. Regev, “On lattices, learning with errors, random linear codes, and cryptography,” Journal of the ACM, vol. 56, no. 6, article 34, pp. 1–40, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  25. J. Katz and Y. Lindell, Introduction to Modern Cryptography: Principles and Protocols, Chapman & Hall, Boca Raton, Fla, USA, 1st edition, 2007. View at MathSciNet
  26. J. Alwen and C. Peikert, “Generating shorter bases for hard random lattices,” Theory of Computing Systems, vol. 48, no. 3, pp. 535–553, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  27. M. Ajtai, “Generating hard instances of lattice problems (extended abstract),” in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC '96), pp. 99–108, 1996. View at Publisher · View at Google Scholar · View at MathSciNet
  28. O. Goldreich, S. Goldwasser, and S. Halevi, “Collision-free hashing from lattice problems,” in Studies in Complexity and Cryptography, vol. 6650 of Lecture Notes in Computer Science, pp. 30–39, Springer, Heidelberg, Germany, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. O. Goldreich, H. Krawczyk, and M. Luby, “On the existence of pseudorandom generators,” SIAM Journal on Computing, vol. 22, no. 6, pp. 1163–1175, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  30. S. C. Ramanna and P. Sarkar, “On quantifying the resistance of concrete hash functions to generic multicollision attacks,” IEEE Transactions on Information Theory, vol. 57, no. 7, pp. 4798–4816, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  31. C. Dwork, “Differential privacy,” in Automata, Languages and Programming, vol. 4052 of Lecture Notes in Computer Science, pp. 1–12, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet