Encrypted computing: Secure processing of encrypted medical data using the classification of ECG data as an example;Verschlüsselt rechnen: Sichere verarbeitung verschlüsselter medizinischer daten am beispiel der klassifikation von EKG daten

Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI)

Volumn P-174, Issue , 2010, Pages 11-26

  Sadeghi, Ahmad Reza ^a   Schneider, Thomas ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

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

References (35)

1. U. R. Acharya, J. Suri, J. A. E. Spaan und S. M. Krishnan. Advances in Cardiac Signal Processing, Kapitel 8. Springer, 2007.
2. E. Bangerter, M. Barbosa, D.J. Bernstein, I. Damgard, D. Page, J.I. Pagter, A.-R. Sadeghi und S. Sovio. Using Compilers to Enhance Cryptographic Product Development. In Information Security Solutions Europe (ISSE'10), Seiten 291-301. Vieweg+Teubner, 2010.
3. F. M. Bennett, D. J. Christini, H. Ahmed, K. Lutchen, J. M. Hausdorff und N. Oriol. Time series modeling of heart rate dynamics. In Computers in Cardiology 1993. Proceedings., Seiten 273-276, 1993.
4. A. Ben-David, N. Nisan und B. Pinkas. FairplayMP: A system for secure multiparty computation. In ACM Conference on Computer and Communications Security (CCS'08), Seiten 257-266. ACM, 2008. http://fairplayproject.net/ fairplayMP.html.
5. D. Beaver. Precomputing Oblivious Transfer. In Advances in Cryptology - CRYPTO' 95, LNCS, Band 963, Seiten 97-109. Springer, 1995.
6. M. Barni, P. Failla, V. Kolesnikov, R. Lazzeretti, A. Paus, A.-R. Sadeghi und T. Schneider. Efficient Privacy-Preserving Classification of ECG Signals. In IEEE International Workshop on Information Forensics and Security (IEEE WIFS'09), Seiten 91-95. IEEE, 2009.
7. M. Barni, P. Failla, V. Kolesnikov, R. Lazzeretti, A.-R. Sadeghi und T. Schneider. Secure Evaluation of Private Linear Branching Programs with Medical Applications. In European Symposium on Research in Computer Security (ESORICS'09), LNCS, Band 5789, Seiten 424-439. Springer, 2009.
8. D. Boneh, E.-J. Goh und K. Nissim. Evaluating 2-DNF Formulas on Ciphertexts. In Theory of Cryptography Cronference (TCC'05), LNCS, Band 3378, Seiten 325-341. Springer, 2005.
9. D. Blankenhorn. Microsoft HealthVault is nothing like Google Health, 2008.
10. M. Ben-Or, S. Goldwasser und A. Wigderson. Completeness Theorems for Non- Cryptographic Fault-Tolerant Distributed Computation. In Symposium on Theory of Computing (STOC'88), Seiten 1-10. ACM, 1988.
11. D. Chaum, C. Cŕepeau und I. Damgard. Multiparty Unconditionally Secure Protocols (Extended Abstract). In Symposium on Theory of Computing (STOC'88), Seiten 11-19. ACM, 1988.
12. M. v. Dijk, C. Gentry, S. Halevi und V. Vaikuntanathan. Fully Homomorphic Encryption over the Integers. In Advances in Cryptology - EUROCRYPT'10, LNCS, Band 6110, Seiten 24-43. Springer, 2010.
13. I. Damgard, M. Geisler, M. Krøigard und J. B. Nielsen. Asynchronous Multiparty Computation: Theory and Implementation. In Public Key Cryptography (PKC'09), LNCS, Band 5443, Seiten 160-179. Springer, 2009. http://viff.dk.
14. I. Damgard und M. Jurik. A Generalisation, a Simplification and some Applications of Paillier's Probabilistic Public-Key System. In Public-Key Cryptography (PKC'01), LNCS, Band 1992, Seiten 119-136. Springer, 2001.
15. P. Flor-Henry, J. L. Lind und Z. J. Koles. Quantitative EEG and source localization in fibromyalgia. International Journal of Psychophysiology, 69(3):142-142, 2008.
16. C. Gentry. Fully homomorphic encryption using ideal lattices. In ACM Symposium on Theory of Computing (STOC'09), Seiten 169-178. ACM, 2009.
17. C. Gentry, S. Halevi und V. Vaikuntanathan. A Simple BGN-type Cryptosystem from LWE. In Advances in Cryptology - EUROCRYPT'10, LNCS, Band 6110, Seiten 506- 522. Springer, 2010.
18. D. Giry und J.-J. Quisquater. Cryptographic Key Length Recommendation, March 2009. http://keylength.com.
19. D. F. Ge, N. Srinivasan und S. M. Krishnan. Cardiac arrhythmia classification using autoregressive modeling. BioMedical Engineering OnLine, 1(1):5, 2002.
20. W. Henecka, S. Kögl, A.-R. Sadeghi, T. Schneider und I. Wehrenberg. TASTY: Tool for Automating Secure Two-partY computations. In ACM Conference on Computer and Communications Security (CCS'10). ACM, October 4-8, 2010. http://tastyproject.net.
21. Y. Ishai, J. Kilian, K. Nissim und E. Petrank. Extending Oblivious Transfers Efficiently. In Advances in Cryptology - CRYPTO'03, LNCS, Band 2729, Seiten 145-161. Springer, 2003.
22. V. Kolesnikov, A.-R. Sadeghi und T. Schneider. Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima. In Cryptology and Network Security (CANS'09), LNCS, Band 5888, Seiten 1-20. Springer, 2009.
23. V. Kolesnikov, A.-R. Sadeghi und T. Schneider. Modular Design of Efficient Secure Function Evaluation Protocols. Cryptology ePrint Archive, Report 2010/079, 2010. http://eprint.iacr.org/2010/079/.
24. P. Kalra, J. Togami, G. Bansal, A. W. Partin, M. K. Brawer, R. J. Babaian, L. S. Ross und C. S. Niederberger. A neurocomputational model for prostate carcinoma detection. Cancer, 98(9):1849-1854, 2003.
25. Y. Lindell und B. Pinkas. A Proof of Yao's Protocol for Secure Two-Party Computation. Journal of Cryptology, 22(2):161-188, 2009. Cryptology ePrint Archive: Report 2004/175.
26. M. McBride. Google Health: Birth of a giant. Health Management Technology, 29:8- 10, 2008.
27. D. Malkhi, N. Nisan, B. Pinkas und Y. Sella. Fairplay - a secure two-party computation system. In USENIX Security Symposium, 2004. http://fairplayproject.net/fairplay.html.
28. M. Naor und B. Pinkas. Efficient oblivious transfer protocols. In ACM-SIAM Symposium On Discrete Algorithms (SODA'01), Seiten 448-457. Society for Industrial and Applied Mathematics, 2001.
29. M. Osadchy, B. Pinkas, A. Jarrous und B. Moskovich. SCiFI - A System for Secure Face Identification. In IEEE Symposium on Security & Privacy (S&P'10), Seiten 239- 254. IEEE, 2010.
30. P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Advances in Cryptology - EUROCRYPT'99, LNCS, Band 1592, Seiten 223-238. Springer, 1999.
31. B. Pinkas, T. Schneider, N. P. Smart und S. C. Williams. Secure Two-Party Computation is Practical. In Advances in Cryptology - ASIACRYPT'09, LNCS, Band 5912, Seiten 250-267. Springer, 2009.
32. N. P. Smart und F. Vercauteren. Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes. In Public Key Cryptography (PKC'10), LNCS, Band 6056, Seiten 420-443. Springer, 2010.
33. T. Sander, A. Young und M. Yung. Non-Interactive CryptoComputing for NC1. In IEEE Symposium on Foundations of Computer Science (FOCS'99), Seiten 554-566. IEEE, 1999.
34. S. Todd, M. Woodward, C. Bolton-Smith und H. Tunstall-Pedoe. An investigation of the relationship between antioxidant vitamin intake and coronary heart disease in men and women using discriminant analysis. Journal of Clinical Epidemiology, 48(2):297- 305, 1995.
35. A. C. Yao. How to Generate and Exchange Secrets. In IEEE Symposium on Foundations of Computer Science (FOCS'86), Seiten 162-167. IEEE, 1986.