Practical secure decision tree learning in a teletreatment application
| Autor: | Hoogh, de, S.J.A., Schoenmakers, B., Chen, Ping, Op den Akker, H., Christin, N., Safavi-Naini, R. |
|---|---|
| Přispěvatelé: | Discrete Mathematics, Coding Theory and Cryptology |
| Jazyk: | angličtina |
| Rok vydání: | 2014 |
| Předmět: | |
| Zdroj: | Proceedings of the 18th International Conference on Financial Cryptography, 179-194 STARTPAGE=179;ENDPAGE=194;TITLE=Proceedings of the 18th International Conference on Financial Cryptography Financial Cryptography and Data Security ISBN: 9783662454718 Financial Cryptography Financial Cryptography and Data Security (18th International Conference, FC 2014, Christ Church, Barbados, March 3-7, 2014, Revised Selected Papers), 179-194 STARTPAGE=179;ENDPAGE=194;TITLE=Financial Cryptography and Data Security (18th International Conference, FC 2014, Christ Church, Barbados, March 3-7, 2014, Revised Selected Papers) |
| ISSN: | 0302-9743 |
| Popis: | In this paper we develop a range of practical cryptographic protocols for secure decision tree learning, a primary problem in privacy preserving data mining. We focus on particular variants of the well-known ID3 algorithm allowing a high level of security and performance at the same time. Our approach is basically to design special-purpose secure multiparty computations, hence privacy will be guaranteed as long as the honest parties form a sufficiently large quorum. Our main ID3 protocol will ensure that the entire database of transactions remains secret except for the information leaked from the decision tree output by the protocol. We instantiate the underlying ID3 algorithm such that the performance of the protocol is enhanced considerably, while at the same time limiting the information leakage from the decision tree. Concretely, we apply a threshold for the number of transactions below which the decision tree will consist of a single leaf—limiting information leakage. We base the choice of the “best” predicting attribute for the root of a decision tree on the Gini index rather than the well-known information gain based on Shannon entropy, and we develop a particularly efficient protocol for securely finding the attribute of highest Gini index. Moreover, we present advanced secure ID3 protocols, which generate the decision tree as a secret output, and which allow secure lookup of predictions (even hiding the transaction for which the prediction is made). In all cases, the resulting decision trees are of the same quality as commonly obtained for the ID3 algorithm. We have implemented our protocols in Python using VIFF, where the underlying protocols are based on Shamir secret sharing. Due to a judicious use of secret indexing and masking techniques, we are able to code the protocols in a recursive manner without any loss of efficiency. To demonstrate practical feasibility we apply the secure ID3 protocols to an automated health care system of a real-life rehabilitation organization. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|