The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A computação multipartidária (MPC) é a tecnologia que calcula uma função arbitrária representada como um circuito sem revelar valores de entrada. O MPC típico usa esquemas de compartilhamento secreto (SS), circuito ilegível (GC) e criptografia homomórfica (HE). Essas tecnologias criptográficas têm uma relação de compensação quanto ao custo de computação, custo de comunicação e tipo de circuito computável. Conseqüentemente, a escolha ideal depende dos recursos de computação, do ambiente de comunicação e da função relacionada aos aplicativos. A avaliação da árvore de decisão privada (PDTE) é uma das aplicações importantes da computação segura. Existem vários protocolos PDTE com rodadas de comunicação constantes usando GC, HE e SS-MPC em campo. No entanto, até onde sabemos, os protocolos PDTE com rodadas de comunicação constantes usando MPC baseados em SS sobre o anel (exigindo apenas menores custos de computação e complexidade de comunicação) não são triviais e ainda estão ausentes. Neste artigo, propomos um protocolo PDTE baseado em um protocolo de computação de três partes (3PC) sobre o anel com uma corrupção. Também propomos outro protocolo PDTE tripartite em campo com uma corrupção que é mais eficiente do que a construção ingênua.
Hikaru TSUCHIDA
NEC Corporation,University of Tsukuba
Takashi NISHIDE
University of Tsukuba
Yusaku MAEDA
The University of Tokyo
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Hikaru TSUCHIDA, Takashi NISHIDE, Yusaku MAEDA, "Private Decision Tree Evaluation with Constant Rounds via (Only) SS-3PC over Ring and Field" in IEICE TRANSACTIONS on Fundamentals,
vol. E105-A, no. 3, pp. 214-230, March 2022, doi: 10.1587/transfun.2021CIP0018.
Abstract: Multiparty computation (MPC) is the technology that computes an arbitrary function represented as a circuit without revealing input values. Typical MPC uses secret sharing (SS) schemes, garbled circuit (GC), and homomorphic encryption (HE). These cryptographic technologies have a trade-off relationship for the computation cost, communication cost, and type of computable circuit. Hence, the optimal choice depends on the computing resources, communication environment, and function related to applications. The private decision tree evaluation (PDTE) is one of the important applications of secure computation. There exist several PDTE protocols with constant communication rounds using GC, HE, and SS-MPC over the field. However, to the best of our knowledge, PDTE protocols with constant communication rounds using MPC based on SS over the ring (requiring only lower computation costs and communication complexity) are non-trivial and still missing. In this paper, we propose a PDTE protocol based on a three-party computation (3PC) protocol over the ring with one corruption. We also propose another three-party PDTE protocol over the field with one corruption that is more efficient than the naive construction.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2021CIP0018/_p
Copiar
@ARTICLE{e105-a_3_214,
author={Hikaru TSUCHIDA, Takashi NISHIDE, Yusaku MAEDA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Private Decision Tree Evaluation with Constant Rounds via (Only) SS-3PC over Ring and Field},
year={2022},
volume={E105-A},
number={3},
pages={214-230},
abstract={Multiparty computation (MPC) is the technology that computes an arbitrary function represented as a circuit without revealing input values. Typical MPC uses secret sharing (SS) schemes, garbled circuit (GC), and homomorphic encryption (HE). These cryptographic technologies have a trade-off relationship for the computation cost, communication cost, and type of computable circuit. Hence, the optimal choice depends on the computing resources, communication environment, and function related to applications. The private decision tree evaluation (PDTE) is one of the important applications of secure computation. There exist several PDTE protocols with constant communication rounds using GC, HE, and SS-MPC over the field. However, to the best of our knowledge, PDTE protocols with constant communication rounds using MPC based on SS over the ring (requiring only lower computation costs and communication complexity) are non-trivial and still missing. In this paper, we propose a PDTE protocol based on a three-party computation (3PC) protocol over the ring with one corruption. We also propose another three-party PDTE protocol over the field with one corruption that is more efficient than the naive construction.},
keywords={},
doi={10.1587/transfun.2021CIP0018},
ISSN={1745-1337},
month={March},}
Copiar
TY - JOUR
TI - Private Decision Tree Evaluation with Constant Rounds via (Only) SS-3PC over Ring and Field
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 214
EP - 230
AU - Hikaru TSUCHIDA
AU - Takashi NISHIDE
AU - Yusaku MAEDA
PY - 2022
DO - 10.1587/transfun.2021CIP0018
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E105-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2022
AB - Multiparty computation (MPC) is the technology that computes an arbitrary function represented as a circuit without revealing input values. Typical MPC uses secret sharing (SS) schemes, garbled circuit (GC), and homomorphic encryption (HE). These cryptographic technologies have a trade-off relationship for the computation cost, communication cost, and type of computable circuit. Hence, the optimal choice depends on the computing resources, communication environment, and function related to applications. The private decision tree evaluation (PDTE) is one of the important applications of secure computation. There exist several PDTE protocols with constant communication rounds using GC, HE, and SS-MPC over the field. However, to the best of our knowledge, PDTE protocols with constant communication rounds using MPC based on SS over the ring (requiring only lower computation costs and communication complexity) are non-trivial and still missing. In this paper, we propose a PDTE protocol based on a three-party computation (3PC) protocol over the ring with one corruption. We also propose another three-party PDTE protocol over the field with one corruption that is more efficient than the naive construction.
ER -