Efficient Constructions of Non-interactive Secure Multiparty Computation from Pairwise Independent Hashing

Satoshi Obana, Maki Yoshida

2020

Abstract

An important issue of secure multi-party computation (MPC) is to improve the efficiency of communication. Non-interactive MPC (NIMPC) introduced by Beimel et al. in Crypto 2014 completely avoids interaction in the information theoretical setting by allowing a correlated randomness setup where the parties get correlated random strings beforehand and locally compute their messages sent to an external output server. Existing studies have been devoted to constructing NIMPC with small communication complexity, and many NIMPC have been presented so far. In this paper, we present a new generic construction of NIMPC for arbitrary functions from a class of functions called indicator functions. We employ pairwise independent hash functions to construct the proposed NIMPC, which results in smallest communication complexity compared to the existing generic constructions. We further present a concrete construction of NIMPC for the set of indicator functions with smallest communication complexity known so far. The construction also employs pairwise independent hash functions. It will be of independent interest to see how pairwise independent hash functions helps in constructing NIMPC.

Paper Citation

in Harvard Style

Obana S. and Yoshida M. (2020). Efficient Constructions of Non-interactive Secure Multiparty Computation from Pairwise Independent Hashing.In Proceedings of the 17th International Joint Conference on e-Business and Telecommunications - Volume 3: SECRYPT, ISBN 978-989-758-446-6, pages 322-329. DOI: 10.5220/0009819203220329

in Bibtex Style

@conference{secrypt20,
author={Satoshi Obana and Maki Yoshida},
title={Efficient Constructions of Non-interactive Secure Multiparty Computation from Pairwise Independent Hashing},
booktitle={Proceedings of the 17th International Joint Conference on e-Business and Telecommunications - Volume 3: SECRYPT,},
year={2020},
pages={322-329},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0009819203220329},
isbn={978-989-758-446-6},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 17th International Joint Conference on e-Business and Telecommunications - Volume 3: SECRYPT,
TI - Efficient Constructions of Non-interactive Secure Multiparty Computation from Pairwise Independent Hashing
SN - 978-989-758-446-6
AU - Obana S.
AU - Yoshida M.
PY - 2020
SP - 322
EP - 329
DO - 10.5220/0009819203220329