Decision trees such as BDD (Binary Decision Diagrams) are commonly used for decision-making. The structure of the decision tree might be the know-how of the owner of the tree. Thus, when Alice provides a decision tree and Bob evaluates the tree, Alice wants to hide the structure of the decision tree from Bob. Though Bob can know the information about the nodes Bob traversed, the other node and edge information must be hidden. During the evaluation, Bob might use his private information. Thus, the traversed nodes and edges and the final result need to be hidden from Alice. To achieve these requirements, we propose a card-based decision tree evaluation protocol. By the nature of card-based cryptographic protocols that they are executed in a public place, the protocol is simpler than the ones executed on computers.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Card-Based Secure Evaluation of Decision Trees

  • Yoshifumi Manabe,
  • Naoki Kobayashi

摘要

Decision trees such as BDD (Binary Decision Diagrams) are commonly used for decision-making. The structure of the decision tree might be the know-how of the owner of the tree. Thus, when Alice provides a decision tree and Bob evaluates the tree, Alice wants to hide the structure of the decision tree from Bob. Though Bob can know the information about the nodes Bob traversed, the other node and edge information must be hidden. During the evaluation, Bob might use his private information. Thus, the traversed nodes and edges and the final result need to be hidden from Alice. To achieve these requirements, we propose a card-based decision tree evaluation protocol. By the nature of card-based cryptographic protocols that they are executed in a public place, the protocol is simpler than the ones executed on computers.