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
MPC(Multiparty Computation)는 입력 값을 공개하지 않고 회로로 표현된 임의의 함수를 계산하는 기술입니다. 일반적인 MPC는 비밀 공유(SS) 방식, 왜곡된 회로(GC) 및 동형 암호화(HE)를 사용합니다. 이러한 암호화 기술은 계산 비용, 통신 비용 및 계산 가능한 회로 유형에 대해 절충 관계를 갖습니다. 따라서 최적의 선택은 컴퓨팅 리소스, 통신 환경, 애플리케이션과 관련된 기능에 따라 달라집니다. PDTE(Private Decision Tree Evaluation)는 보안 컴퓨팅의 중요한 응용 프로그램 중 하나입니다. 현장에서 GC, HE 및 SS-MPC를 사용하여 지속적인 통신 라운드를 제공하는 여러 PDTE 프로토콜이 있습니다. 그러나 우리가 아는 한, 링을 통한 SS 기반 MPC(더 낮은 계산 비용과 통신 복잡성만 필요함)를 사용하여 지속적인 통신 라운드를 수행하는 PDTE 프로토콜은 사소하지 않으며 여전히 누락되어 있습니다. 본 논문에서는 하나의 손상이 있는 링을 통한 3PC(Third Party Computation) 프로토콜 기반의 PDTE 프로토콜을 제안합니다. 우리는 또한 순진한 구성보다 더 효율적인 하나의 손상으로 현장을 통한 또 다른 XNUMX자 PDTE 프로토콜을 제안합니다.
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.
부
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
부
@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},}
부
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 -