An efficient private evaluation of a decision graph

Hiroki Sudo, Koji Nuida, Kana Shimizu*


研究成果: Conference contribution

4 被引用数 (Scopus)


A decision graph is a well-studied classifier and has been used to solve many real-world problems. We assumed a typical scenario between two parties in this study, in which one holds a decision graph and the other wants to know the class label of his/her query without disclosing the graph and query to the other. We propose a novel protocol for this scenario that can obliviously evaluate a graph that is designed by an efficient data structure called the graph level order unary degree sequence (GLOUDS). The time and communication complexities of this protocol are linear to the number of nodes in the graph and do not include any exponential factors. The experiment results revealed that the actual runtime and communication size were well concordant with theoretical complexities. Our method can process a graph with approximately 500 nodes in only 11 s on a standard laptop computer. We also compared the runtime of our method with that of previous methods and confirmed that it was one order of magnitude faster than the previous methods.

ホスト出版物のタイトルInformation Security and Cryptology – ICISC 2018 - 21st International Conference, Revised Selected Papers
編集者Kwangsu Lee
出版社Springer Verlag
出版ステータスPublished - 2019
イベント21st International Conference on Information Security and Cryptology, ICISC 2018 - Seoul, Korea, Republic of
継続期間: 2018 11月 282018 11月 30


名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
11396 LNCS


Other21st International Conference on Information Security and Cryptology, ICISC 2018
国/地域Korea, Republic of

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)


「An efficient private evaluation of a decision graph」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。