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(다자간 계산)는 일련의 당사자가 모든 당사자의 개인 입력에 대한 임의의 공동 기능을 계산할 수 있게 하고 출력 이외의 정보는 공개하지 않는 암호화 방법입니다. SS-MPC(Secret Sharing Scheme) 및 GC(Garbled Circuit)를 기반으로 하는 MPC는 가장 일반적인 MPC 방식으로 알려져 있습니다. 또 다른 암호학적 방법인 동형암호(HE)는 암호문을 복호화하지 않고 이를 이용하여 회로로 표현되는 임의의 함수를 계산하는 것이다. 이러한 기술은 통신/라운드 복잡성 및 계산 비용에 대한 절충 관계에 있습니다. PDTE(Private Decision Tree Evaluation)는 이러한 기술의 주요 응용 프로그램 중 하나입니다. 프로토콜 사양에서 벗어날 수 있는 악의적인 공격자가 일부 당사자를 손상시키더라도 안전한 GC, HE 또는 하이브리드 방식을 기반으로 하는 여러 가지 상수 라운드 PDTE 프로토콜이 있습니다. 프로토콜 사양을 따르는 반 정직한 공격자가 일부 당사자를 손상시키는 경우에만 안전한 SS-MPC에만 기반한 다른 프로토콜도 있습니다. 그러나 우리가 아는 한, 현재 악의적인 적으로부터 안전한 SS-MPC만을 기반으로 하는 상수 라운드 PDTE 프로토콜은 없습니다. 본 연구에서는 악의적인 보안을 달성하는 지속적인 라운드 XNUMX자 PDTE 프로토콜을 제안합니다. 우리의 프로토콜은 통신 환경의 지연 시간이 긴 경우에도 PDTE를 안전하고 효율적으로 제공합니다.
Hikaru TSUCHIDA
NEC Corporation,University of Tsukuba
Takashi NISHIDE
University of Tsukuba
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, "Constant-Round Fair SS-4PC for Private Decision Tree Evaluation" in IEICE TRANSACTIONS on Fundamentals,
vol. E105-A, no. 9, pp. 1270-1288, September 2022, doi: 10.1587/transfun.2021DMP0016.
Abstract: Multiparty computation (MPC) is a cryptographic method that enables a set of parties to compute an arbitrary joint function of the private inputs of all parties and does not reveal any information other than the output. MPC based on a secret sharing scheme (SS-MPC) and garbled circuit (GC) is known as the most common MPC schemes. Another cryptographic method, homomorphic encryption (HE), computes an arbitrary function represented as a circuit by using ciphertexts without decrypting them. These technologies are in a trade-off relationship for the communication/round complexities, and the computation cost. The private decision tree evaluation (PDTE) is one of the key applications of these technologies. There exist several constant-round PDTE protocols based on GC, HE, or the hybrid schemes that are secure even if a malicious adversary who can deviate from protocol specifications corrupts some parties. There also exist other protocols based only on SS-MPC that are secure only if a semi-honest adversary who follows the protocol specification corrupts some parties. However, to the best of our knowledge, there are currently no constant-round PDTE protocols based only on SS-MPC that are secure against a malicious adversary. In this work, we propose a constant-round four-party PDTE protocol that achieves malicious security. Our protocol provides the PDTE securely and efficiently even when the communication environment has a large latency.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2021DMP0016/_p
부
@ARTICLE{e105-a_9_1270,
author={Hikaru TSUCHIDA, Takashi NISHIDE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Constant-Round Fair SS-4PC for Private Decision Tree Evaluation},
year={2022},
volume={E105-A},
number={9},
pages={1270-1288},
abstract={Multiparty computation (MPC) is a cryptographic method that enables a set of parties to compute an arbitrary joint function of the private inputs of all parties and does not reveal any information other than the output. MPC based on a secret sharing scheme (SS-MPC) and garbled circuit (GC) is known as the most common MPC schemes. Another cryptographic method, homomorphic encryption (HE), computes an arbitrary function represented as a circuit by using ciphertexts without decrypting them. These technologies are in a trade-off relationship for the communication/round complexities, and the computation cost. The private decision tree evaluation (PDTE) is one of the key applications of these technologies. There exist several constant-round PDTE protocols based on GC, HE, or the hybrid schemes that are secure even if a malicious adversary who can deviate from protocol specifications corrupts some parties. There also exist other protocols based only on SS-MPC that are secure only if a semi-honest adversary who follows the protocol specification corrupts some parties. However, to the best of our knowledge, there are currently no constant-round PDTE protocols based only on SS-MPC that are secure against a malicious adversary. In this work, we propose a constant-round four-party PDTE protocol that achieves malicious security. Our protocol provides the PDTE securely and efficiently even when the communication environment has a large latency.},
keywords={},
doi={10.1587/transfun.2021DMP0016},
ISSN={1745-1337},
month={September},}
부
TY - JOUR
TI - Constant-Round Fair SS-4PC for Private Decision Tree Evaluation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1270
EP - 1288
AU - Hikaru TSUCHIDA
AU - Takashi NISHIDE
PY - 2022
DO - 10.1587/transfun.2021DMP0016
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E105-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2022
AB - Multiparty computation (MPC) is a cryptographic method that enables a set of parties to compute an arbitrary joint function of the private inputs of all parties and does not reveal any information other than the output. MPC based on a secret sharing scheme (SS-MPC) and garbled circuit (GC) is known as the most common MPC schemes. Another cryptographic method, homomorphic encryption (HE), computes an arbitrary function represented as a circuit by using ciphertexts without decrypting them. These technologies are in a trade-off relationship for the communication/round complexities, and the computation cost. The private decision tree evaluation (PDTE) is one of the key applications of these technologies. There exist several constant-round PDTE protocols based on GC, HE, or the hybrid schemes that are secure even if a malicious adversary who can deviate from protocol specifications corrupts some parties. There also exist other protocols based only on SS-MPC that are secure only if a semi-honest adversary who follows the protocol specification corrupts some parties. However, to the best of our knowledge, there are currently no constant-round PDTE protocols based only on SS-MPC that are secure against a malicious adversary. In this work, we propose a constant-round four-party PDTE protocol that achieves malicious security. Our protocol provides the PDTE securely and efficiently even when the communication environment has a large latency.
ER -