Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Information Security and Cryptology – ICISC 2018 - 21st International Conference, Revised Selected Papers |
| Editors | Kwangsu Lee |
| Publisher | Springer-Verlag |
| Pages | 143-160 |
| Number of pages | 18 |
| ISBN (Print) | 9783030121457 |
| DOIs | |
| Publication status | Published - 2019 Jan 1 |
| Event | 21st International Conference on Information Security and Cryptology, ICISC 2018 - Seoul, Korea, Republic of Duration: 2018 Nov 28 → 2018 Nov 30 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 11396 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 21st International Conference on Information Security and Cryptology, ICISC 2018 |
|---|---|
| Country | Korea, Republic of |
| City | Seoul |
| Period | 18/11/28 → 18/11/30 |
Fingerprint
Keywords
- Decision graph
- GLOUDS
- Homomorphic encryption
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
Cite this
An efficient private evaluation of a decision graph. / Sudo, Hiroki; Nuida, Koji; Shimizu, Kana.
Information Security and Cryptology – ICISC 2018 - 21st International Conference, Revised Selected Papers. ed. / Kwangsu Lee. Springer-Verlag, 2019. p. 143-160 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11396 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - An efficient private evaluation of a decision graph
AU - Sudo, Hiroki
AU - Nuida, Koji
AU - Shimizu, Kana
PY - 2019/1/1
Y1 - 2019/1/1
N2 - 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.
AB - 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.
KW - Decision graph
KW - GLOUDS
KW - Homomorphic encryption
UR - http://www.scopus.com/inward/record.url?scp=85061098792&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85061098792&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-12146-4_10
DO - 10.1007/978-3-030-12146-4_10
M3 - Conference contribution
SN - 9783030121457
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 143
EP - 160
BT - Information Security and Cryptology – ICISC 2018 - 21st International Conference, Revised Selected Papers
A2 - Lee, Kwangsu
PB - Springer-Verlag
ER -