Paper 2019/325 Original: eprint.iacr.org/2019/325 ↗
An Efficient Private Evaluation of a Decision Graph
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.
Metadata
- Available format(s)
PDF- Category
- Applications
- Publication info
- Preprint.
- History
- 2019-03-29: last updated
- 2019-03-29: published
- Short URL
- https://ia.cr/2019/325
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2019/325,
author = {Hiroki Sudo and Koji Nuida and Kana Shimizu},
title = {An Efficient Private Evaluation of a Decision Graph},
howpublished = {Cryptology {ePrint} Archive, Paper 2019/325},
year = {2019},
url = {https://eprint.iacr.org/2019/325}
}