Privacy-preserving ECG classification with branching programs and neural networks

IEEE Transactions on Information Forensics and Security

Volumn 6, Issue 2, 2011, Pages 452-468

  Barni, Mauro ^a   Failla, Pierluigi ^b   Lazzeretti, Riccardo ^a   Sadeghi, Ahmad Reza ^c   Schneider, Thomas ^c  

^a UNIVERSITY OF SIENA   (Italy)

^b Elettronica SpA   (Italy)

^c DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Linear branching programs; neural networks (NNs); privacy protection; quadratic discriminant function; secure biomedical systems; secure electrocardiogram (ECG) classification

Indexed keywords

BIOMEDICAL SYSTEMS; BRANCHING PROGRAMS; PRIVACY PROTECTION; QUADRATIC DISCRIMINANT FUNCTION; SECURE ELECTROCARDIOGRAM (ECG) CLASSIFICATION;

BIOELECTRIC PHENOMENA; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; DATA PRIVACY; DECISION TREES; ELECTROCARDIOGRAPHY; ELECTROCHROMIC DEVICES; SIGNAL PROCESSING;

NEURAL NETWORKS;

EID: 79957487964     PISSN: 15566013     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIFS.2011.2108650     Document Type: Article

References (55)

1. Z. Erkin, A. Piva, S. Katzenbeisser, R. Lagendijk, J. Shokrollahi, G. Neven, and M. Barni, "Protection and retrieval of encrypted multimedia content: When cryptography meets signal processing," EURASIP J. Inform. Sec., vol. 2007, p. 17, 2007.
2. R. Agrawal and R. Srikant, "Privacy-preserving data mining," SIGMOD Record, vol. 29, no. 2, pp. 439-450, 2000.
3. Y. Lindell and B. Pinkas, "Privacy preserving data mining," J. Cryptology, vol. 15, no. 3, pp. 177-206, 2008.
4. J. Bringer and H. Chabanne, "An authentication protocol with encrypted biometric data," in Proc. Progress Cryptology (AFRICACRYPT'08), 2008, pp. 109-124.
5. "Homomorphic Encryption For Secure Watermarking," WO Patent WO/2006/129,293, Dec. 2006.
6. E. Aimeur, G. Brassard, J. Fernandez, F. Onana, and Z. Rakowski, "Experimental demonstration of a hybrid privacy-preserving recommender system," in Proc. Int. Conf. Availability, Rel. Security., 2008, pp. 161-170, IEEE Computer Society.
7. M. Barni, P. Failla, V. Kolesnikov, R. Lazzeretti, A.-R. Sadeghi, and T. Schneider, "Efficient privacy-preserving classification of ECG signals," in Proc. IEEE Int. Workshop Inf. Forensics Security (WIFS09), 2009, pp. 91-95.
8. M. McBride, "Google health: Birth of a giant," Health Manage. Technol., vol. 29, pp. 8-10, 2008.
9. D. Blankenhorn,Microsoft HealthVault Is Nothing Like Google Health 2008 [Online]. Available: http://www.zdnet.com/blog/healthcare/microsoft- healthvault-is-nothing-like-google-health/742
10. U. R. Acharya, J. Suri, J. A. E. Spaan, and S. M. Krishnan, Advances in Cardiac Signal Processing. New York: Springer, 2007.
11. A. C. Yao, "How to generate and exchange secrets," in Proc. IEEE Symp. Foundations Comput. Sci. (FOCS'86), 1986, pp. 162-167.
12. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella, "Fairplay-A secure two-party computation system," in Proc. USENIX Security Symp. (Security' 04), San Diego, CA, 2004, pp. 287-302 [Online]. Available: http://www.cs.huji. ac.il/project/Fairplay
13. V. Kolesnikov and T. Schneider, "A practical universal circuit construction and secure evaluation of private functions," in Proc. Financial Cryptography Data Security (FC'08), 2008, vol. 5143, pp. 83-97, Springer, LNCS.
14. A.-R. Sadeghi and T. Schneider, "Generalized universal circuits for secure evaluation of private functions with application to data classification," in Proc. Int. Conf. Inf. Security Cryptology (ICISC'08), 2008, vol. 5461, pp. 336-353, Springer, LNCS.
15. D. Ge, N. Srinivasan, and S. M. Krishnan, "The application of autoregressive modeling in cardiac arrhythmia classification," in Advances in Cardiac Signal Processing. New York: Springer, 2007, pp. 209-226.
16. D. F. Ge, N. Srinivasan, and S.M. Krishnan, "Cardiac arrhythmia classification using autoregressive modeling," BioMed. Eng. OnLine, vol. 1, no. 1, pp. 5-5, 2002.
17. M. Barni, P. Failla, V. Kolesnikov, R. Lazzeretti, A.-R. Sadeghi, and T. Schneider, "Secure evaluation of private linear branching programs with medical applications," in Proc. Eur. Symp. Res. Comput. Security (ESORICS'09), 2009, vol. 5789, pp. 424-439, Springer, LNCS.
18. V. Kolesnikov, A.-R. Sadeghi, and T. Schneider, "Improved garbled circuit building blocks and applications to auctions and computing minima," in Cryptology Network Security (CANS'09), 2009, vol. 5888, pp. 1-20, Springer, LNCS.
19. B. Pinkas, T. Schneider, N. P. Smart, and S. C.Williams, "Secure twoparty computation is practical," in Proc. Adv. Cryptology (ASIACRYPT 2009), 2009, vol. 5912, pp. 250-267, Springer, LNCS.
20. V. Kolesnikov, A.-R. Sadeghi, and T. Schneider,Modular design of efficient secure function evaluation protocols Cryptology ePrint Archive, Rep. 2010/079, 2010 [Online]. Available: http://eprint.iacr.org
21. P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes," in Proc. Adv. Cryptology (EUROCRYPT'99), 1999, vol. 1592, pp. 223-238, Springer, LNCS.
22. J. Rajan and P. Rayner, "Generalized feature extraction for time-varying autoregressive models," IEEE Trans. Signal Process., vol. 44, no. 10, pp. 2498-2507, Oct. 1996. (Pubitemid 126776552)
23. G. E. P. Box, G. M. Jenkins, and G. C. Reinsel, Time Series Analysis. San Francisco, CA: Holden-day, 1976.
24. M. Kattan and R. Beck, "Artificial neural networks for medical classification decisions," Archives Pathology Lab. Medicine (1976), vol. 119, no. 8, pp. 672-677, 1995.
25. G. Arulampalam and A. Bouzerdoum, "Application of shunting inhibitory artificial neural networks to medical diagnosis," in Proc. ANZIIS 2001. Proc. 7th Australian New Zealand Intelligent Inf. Syst. Conf., Perth, WA, 2001, pp. 89-94.
26. A. L. Goldberger, L. A. N. Amaral, L. Glass, J. M. Hausdorff, P. C. Ivanov, R. G.Mark, J. E.Mietus, G. B.Moody, C.-K. Peng, and H. E. Stanley, "Physiobank, physiotoolkit, and physionet: Components of a new research resource for complex physiologic signals," Circulation, vol. 101, no. 23, pp. e215-e220, Jun. 2000.
27. M. Hagan and M. Menhaj, "Training feedforward networks with the marquardt algorithm," IEEE Trans. Neural Netw., vol. 5, no. 6, pp. 989-993, Nov. 1994.
28. Y. Lindell and B. Pinkas, "Secure multiparty computation for privacypreserving data mining," J. Privacy Confidentiality, vol. 1, no. 1, pp. 59-98, 2009.
29. M. Naor, B. Pinkas, and R. Sumner, "Privacy preserving auctions and mechanism design," in Proc. ACM Conf. Electron. Commerce, 1999, pp. 129-139.
30. Z. Erkin, M. Franz, J. Guajardo, S. Katzenbeisser, I. Lagendijk, and T. Toft, "Privacy-preserving face recognition," in Proc. Privacy Enhancing Technol. (PET'09), 2009, vol. 5672, pp. 235-253, Springer, LNCS.
31. A.-R. Sadeghi, T. Schneider, and I. Wehrenberg, "Efficient privacypreserving face recognition," in 12th Int. Conf. Inf. Security Cryptology (ICISC'09), 2009, vol. 5984, pp. 229-244, Springer, LNCS.
32. M. Osadchy, B. Pinkas, A. Jarrous, and B. Moskovich, "SCiFI-A system for secure face identification," in IEEE Symp. Security & Privacy (S&P'10)., 2010, pp. 239-254.
33. O. Goldreich, Foundations of cryptography Cambridge Univ. Press, 2004, vol. 2 [Online]. Available: http://www.wisdom.weizmann.ac.il/ oded/foc-vol2.html
34. Y. Lindell, B. Pinkas, and N. Smart, "Implementing two-party computation efficiently with security against malicious adversaries," in Proc. Security Cryptography For Networks (SCN'08), 2008, vol. 5229, pp. 2-20, Springer, LNCS.
35. I. Damgård and M. Jurik, "A generalisation, a simplification and some applications of paillier's probabilistic public-key system," in Proc. Public-Key Cryptography (PKC'01), 2001, pp. 119-136, Springer, LNCS. (Pubitemid 33232937)
36. T. Bianchi, A. Piva, and M. Barni, "Composite signal representation for fast and storage-efficient processing of encrypted signals," IEEE Trans. Inf. Forensics Security, vol. 5, no. 1, pp. 180-187, Mar. 2010.
37. D. Boneh, E.-J. Goh, and K. Nissim, "Evaluating 2-DNF formulas on ciphertexts," in Proc. Theor. Cryptography (TCC'05), 2005, vol. 3378, pp. 325-341, Springer, LNCS. (Pubitemid 41231172)
38. C. Gentry, "Fully homomorphic encryption using ideal lattices," in Proc. ACM Symp. Theor. Comput. (STOC'09)., 2009, pp. 169-178.
39. M. Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, "Fully homomorphic encryption over the integers," in Proc. Adv. Cryptology (EUROCRYPT' 10), 2010, vol. 6110, pp. 24-43, Springer, LNCS.
40. N. P. Smart and F. Vercauteren, "Fully homomorphic encryption with relatively small key and ciphertext sizes," in Proc. Public Key Cryptography (PKC'10), 2010, vol. 6056, pp. 420-443, Springer, LNCS.
41. Y. Lindell and B. Pinkas, "A proof of Yao's protocol for secure twoparty computation," J. Cryptology, vol. 22, no. 2, pp. 161-188, 2009 [Online]. Available: http://eprint.iacr.org/2004/175
42. O. Goldreich, Foundations of Cryptography: Volume 2, Basic Applications. Cambridge, U.K.: Cambridge Univ. Press, 2004.
43. C. Orlandi, A. Piva, and M. Barni, "Oblivious neural network computing from homomorphic encryption," EURASIP J. Inform. Sec., vol. 2007, p. 11, 2007.
44. J. Brickell, D. E. Porter, V. Shmatikov, and E. Witchel, "Privacy-preserving remote diagnostics," in Proc. ACM Comput. Commun. Security (ACM CCS'07)., 2007, pp. 498-507.
45. W. Henecka, S. Kögl, A.-R. Sadeghi, T. Schneider, and I. Wehrenberg, "TASTY: Tool for automating secure two-party computations," in Proc. ACM Comput. Commun. Security (CCS'10)., 2010, pp. 451-462.
46. K. Järvinen, V. Kolesnikov, A.-R. Sadeghi, and T. Schneider, "Garbled circuits for leakage-resilience: Hardware implementation and evaluation of one-time programs," in Proc. Cryptographic Hardware Embedded Syst. (CHES'10), 2010, vol. 6225, pp. 383-397, Springer, LNCS.
47. K. Järvinen, V. Kolesnikov, A.-R. Sadeghi, and T. Schneider, "Embedded SFE: Offloading server and network using hardware tokens," in Proc. Financial Cryptography Data Security (FC'10), 2010, vol. 6052, pp. 207-221, Springer, LNCS.
48. A.-R. Sadeghi, T. Schneider, and M. Winandy, "Token-based cloud computing-Secure outsourcing of data and arbitrary computations with lower latency," in Proc. Trust Trustworthy Comput. (TRUST'10)-Workshop Trust Cloud, 2010, vol. 6101, pp. 417-429, Springer, LNCS.
49. C. Aguilar, P. Gaborit, and J. Herranz, "Additively homomorphic encryption with d-operand multiplications," in Adv. Cryptology (CRYPTO'10), Santa Barbara, CA, 2010, pp. 138-154, Springer, LNCS.
50. NIST, U.S. National Institute of Standards and Technology, Federal information processing standards (FIPS 180-2). Announcing the secure hash standard Aug. 2002 [Online]. Available: http://csrc.nist.gov/publications/ fips/fips180-2/fips-180-2.pdf
51. D. Beaver, "Precomputing oblivious transfer," in Proc. Adv. Cryptology (CRYPTO'95), 1995, vol. 963, pp. 97-109, Springer, LNCS.
52. Y. Ishai, J. Kilian, K. Nissim, and E. Petrank, "Extending oblivious transfers efficiently," in Proc. Adv. Cryptology (CRYPTO'03), 2003, vol. 2729, pp. 145-161, Springer, LNCS. (Pubitemid 137636940)
53. M. Naor and B. Pinkas, "Efficient oblivious transfer protocols," in Proc. ACM-SIAM Symp. Discrete Algorithms (SODA'01), 2001, pp. 448-457, Society for Industrial and Applied Mathematics.
54. J. Boyar, R. Peralta, andD. Pochuev, "On the multiplicative complexity of boolean functions over the basis ," Theor. Comput. Sci., vol. 235, no. 1, pp. 43-57, 2000.
55. V. Kolesnikov and T. Schneider, "Improved garbled circuit: Free XOR gates and applications," in Proc. Int. Colloquium Automata, Languages Programming (ICALP'08), 2008, vol. 5126, pp. 486-498, Springer, LNCS.