Secret sharing for health data in multi-provider clouds

Proceedings - 2013 IEEE International Conference on Business Informatics, IEEE CBI 2013

Volumn , Issue , 2013, Pages 93-100

  Ermakova, Tatiana ^a   Fabian, Benjamin ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Cloud computing; Electronic health record; Secret sharing scheme; Security

Indexed keywords

CLOUD COMPUTING; DATA PRIVACY; HEALTH CARE; INFORMATION SCIENCE; RECORDS MANAGEMENT;

ELECTRONIC HEALTH RECORD; ENCRYPTION ALGORITHMS; GERMAN HEALTHCARE INDUSTRY; INFORMATION DISPERSAL ALGORITHMS; SECRET-SHARING; SECURITY; SECURITY AND PRIVACY PROTECTION; SYSTEMATIC LITERATURE REVIEW;

ALGORITHMS;

EID: 84898658957     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CBI.2013.22     Document Type: Conference Paper

References (19)

1. R. Baeza-Yates and B. Ribeiro-Neto, Modern InformationRetrieval: the concepts and technology behind search,2nd ed. Addison Wesley, 2011.
2. R. Datta, D. Joshi, and J. Wang, "Image retrieval: Ideas,influences and trends of the new age," ACM ComputingSurveys (CSUR), vol. 40, no. 2, pp. 1-60, 2008.
3. J. Kielman and J. Thomas, "Special issue: Foundationsand frontiers of visual analytics," Information Visualization,vol. 8, no. 4, pp. 239-314, 2009.
4. A. Kerren and F. Schreiber, "Toward the role of interactionin visual analytics," in Proceedings of the 2012 WinterSimulation Conference (WSC '12), 2012, pp. 420:1-420:13.
5. N. Amende, "A structured review of information visualizationsuccess measurement," in Proceedings of the 24th BCSInteraction Specialist Group Conference, ser. BCS '10, 2010,pp. 10-16.
6. J. Zhang, Visualization for information retrieval, ser. Theinformation retrieval series. Springer, 2008.
7. A. K. Jain, "Data clustering: 50 years beyond k-means,"Pattern Recognition Letters, vol. 31, no. 8, pp. 651-666, Jun.2010.
8. E. Xing, A. Ng, M. Jordan, and S. Russell, "Distancemetric learning with application to clustering with sideinformation,"in NIPS, 2003.
9. M. Bader, Space-Filling Curves: An Introduction with Applicationsin Scientific Computing. Springer, 2013.
10. A. Andoni and P. Indyk, "Near-optimal hashing algorithmsfor approximate nearest neighbor in high dimensions," Communicationsof the ACM, vol. 51, no. 1, pp. 117-122, 2008.
11. L. V. der Maaten, E. Postma, and H. V. den Herik, " Dimensionalityreduction: A comparative review," TiCC- TUDelft,NL, Tech. Rep. TR 2009-005, 2009.
12. G. Gutin and A. P. Punnen, The Traveling Salesman Problemand Its Variations. Springer, 2006.
13. S. Lin and B. W. Kernighan, "An effective heuristic algorithmfor the traveling-salesman problem," Operations Research,vol. 21, no. 2, pp. 498-516, 1973.
14. C. Spearman, "Footrule for measuring correlation," TheBritish Journal of Psychiatry, no. 2, pp. 89-108, 1906.
15. D. Park, A. Figueras, and C. Chen, "A hierarchical approachfor solving large-scale traveling salesman problem," in IEEEInternational Conference on Neural Networks, vol. 7, 1994,pp. 4613-4618 vol.7.
16. C. Li, G. Sun, D. Zhang, and S. Liu, "A hierarchicaldistributed evolutionary algorithm to TSP," in Advances inComputation and Intelligence, ser. Lecture Notes in ComputerScience, Z. Cai, C. Hu, Z. Kang, and Y. Liu, Eds.Springer Berlin / Heidelberg, 2010, vol. 6382, pp. 134-139.
17. T. Fischer and P. Merz, "A distributed chained lin- kernighanalgorithm for tsp problems," in Proceedings of the 19th IEEEInternational Parallel and Distributed Processing Symposium(IPDPS'05)- Papers- Volume 01. Washington, DC, USA:IEEE Computer Society, 2005.
18. W. Cook (contact), Concorde TSP solver, Last visited03/2013, http://www.tsp.gatech.edu/concorde.
19. A. Hanbury, N. Bhatti, M. Lupu, and R. M̈orzinger, "Patentimage retrieval: a survey," in Proceedings of the 4th workshopon Patent information retrieval, ser. PaIR '11, 2011, pp. 3-8.