loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Satoshi Obana 1 and Maki Yoshida 2

Affiliations: 1 Hosei University, Tokyo, Japan ; 2 NICT, Tokyo, Japan

Keyword(s): Secure Multiparty Computation, Non-interactive, Information Theoretical Security, Communication Complexity, Pairwise Independent Hash Functions.

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. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.12.161.77

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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 - SECRYPT; ISBN 978-989-758-446-6; ISSN 2184-7711, SciTePress, pages 322-329. DOI: 10.5220/0009819203220329

@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 - SECRYPT},
year={2020},
pages={322-329},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0009819203220329},
isbn={978-989-758-446-6},
issn={2184-7711},
}

TY - CONF

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

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic