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
Le calcul multipartite (MPC) est une méthode cryptographique qui permet à un ensemble de parties de calculer une fonction conjointe arbitraire des entrées privées de toutes les parties et ne révèle aucune information autre que la sortie. Le MPC basé sur un schéma de partage secret (SS-MPC) et un circuit garbled (GC) est connu comme le schéma MPC le plus courant. Une autre méthode cryptographique, le chiffrement homomorphique (HE), calcule une fonction arbitraire représentée sous forme de circuit en utilisant des textes chiffrés sans les déchiffrer. Ces technologies sont dans une relation de compromis entre les complexités de communication/tour et le coût de calcul. L'évaluation des arbres de décision privés (PDTE) est l'une des applications clés de ces technologies. Il existe plusieurs protocoles PDTE à cycle constant basés sur des schémas GC, HE ou hybrides qui sont sécurisés même si un adversaire malveillant pouvant s'écarter des spécifications du protocole corrompt certaines parties. Il existe également d'autres protocoles basés uniquement sur SS-MPC qui ne sont sécurisés que si un adversaire semi-honnête qui suit la spécification du protocole corrompt certaines parties. Cependant, à notre connaissance, il n’existe actuellement aucun protocole PDTE à cycle constant basé uniquement sur SS-MPC qui soit sécurisé contre un adversaire malveillant. Dans ce travail, nous proposons un protocole PDTE à quatre parties à cycle constant qui assure une sécurité malveillante. Notre protocole fournit le PDTE de manière sécurisée et efficace même lorsque l'environnement de communication présente une latence importante.
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.
Copier
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
Copier
@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},}
Copier
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 -