The search functionality is under construction.

The search functionality is under construction.

Secure two-party computation is a cryptographic tool that enables two parties to compute a function jointly without revealing their inputs. It is known that any function can be realized in the correlated randomness (CR) model, where a trusted dealer distributes input-independent CR to the parties beforehand. Sometimes we can construct more efficient secure two-party protocol for a function *g* than that for a function *f*, where *g* is a restriction of *f*. However, it is not known in which case we can construct more efficient protocol for domain-restricted function. In this paper, we focus on the size of CR. We prove that we can construct more efficient protocol for a domain-restricted function when there is a “good” structure in CR space of a protocol for the original function, and show a unified way to construct a more efficient protocol in such case. In addition, we show two applications of the above result: The first application shows that some known techniques of reducing CR size for domain-restricted function can be derived in a unified way, and the second application shows that we can construct more efficient protocol than an existing one using our result.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E107-A No.3 pp.283-290

- Publication Date
- 2024/03/01

- Publicized
- 2023/10/04

- Online ISSN
- 1745-1337

- DOI
- 10.1587/transfun.2023CIP0023

- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)

- Category

Keitaro HIWATASHI

The University of Tokyo,National Institute of Advanced Industrial Science and Technology

Koji NUIDA

National Institute of Advanced Industrial Science and Technology,Kyushu University

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.

Copy

Keitaro HIWATASHI, Koji NUIDA, "Correlated Randomness Reduction in Domain-Restricted Secure Two-Party Computation" in IEICE TRANSACTIONS on Fundamentals,
vol. E107-A, no. 3, pp. 283-290, March 2024, doi: 10.1587/transfun.2023CIP0023.

Abstract: Secure two-party computation is a cryptographic tool that enables two parties to compute a function jointly without revealing their inputs. It is known that any function can be realized in the correlated randomness (CR) model, where a trusted dealer distributes input-independent CR to the parties beforehand. Sometimes we can construct more efficient secure two-party protocol for a function *g* than that for a function *f*, where *g* is a restriction of *f*. However, it is not known in which case we can construct more efficient protocol for domain-restricted function. In this paper, we focus on the size of CR. We prove that we can construct more efficient protocol for a domain-restricted function when there is a “good” structure in CR space of a protocol for the original function, and show a unified way to construct a more efficient protocol in such case. In addition, we show two applications of the above result: The first application shows that some known techniques of reducing CR size for domain-restricted function can be derived in a unified way, and the second application shows that we can construct more efficient protocol than an existing one using our result.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2023CIP0023/_p

Copy

@ARTICLE{e107-a_3_283,

author={Keitaro HIWATASHI, Koji NUIDA, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={Correlated Randomness Reduction in Domain-Restricted Secure Two-Party Computation},

year={2024},

volume={E107-A},

number={3},

pages={283-290},

abstract={Secure two-party computation is a cryptographic tool that enables two parties to compute a function jointly without revealing their inputs. It is known that any function can be realized in the correlated randomness (CR) model, where a trusted dealer distributes input-independent CR to the parties beforehand. Sometimes we can construct more efficient secure two-party protocol for a function *g* than that for a function *f*, where *g* is a restriction of *f*. However, it is not known in which case we can construct more efficient protocol for domain-restricted function. In this paper, we focus on the size of CR. We prove that we can construct more efficient protocol for a domain-restricted function when there is a “good” structure in CR space of a protocol for the original function, and show a unified way to construct a more efficient protocol in such case. In addition, we show two applications of the above result: The first application shows that some known techniques of reducing CR size for domain-restricted function can be derived in a unified way, and the second application shows that we can construct more efficient protocol than an existing one using our result.},

keywords={},

doi={10.1587/transfun.2023CIP0023},

ISSN={1745-1337},

month={March},}

Copy

TY - JOUR

TI - Correlated Randomness Reduction in Domain-Restricted Secure Two-Party Computation

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 283

EP - 290

AU - Keitaro HIWATASHI

AU - Koji NUIDA

PY - 2024

DO - 10.1587/transfun.2023CIP0023

JO - IEICE TRANSACTIONS on Fundamentals

SN - 1745-1337

VL - E107-A

IS - 3

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - March 2024

AB - Secure two-party computation is a cryptographic tool that enables two parties to compute a function jointly without revealing their inputs. It is known that any function can be realized in the correlated randomness (CR) model, where a trusted dealer distributes input-independent CR to the parties beforehand. Sometimes we can construct more efficient secure two-party protocol for a function *g* than that for a function *f*, where *g* is a restriction of *f*. However, it is not known in which case we can construct more efficient protocol for domain-restricted function. In this paper, we focus on the size of CR. We prove that we can construct more efficient protocol for a domain-restricted function when there is a “good” structure in CR space of a protocol for the original function, and show a unified way to construct a more efficient protocol in such case. In addition, we show two applications of the above result: The first application shows that some known techniques of reducing CR size for domain-restricted function can be derived in a unified way, and the second application shows that we can construct more efficient protocol than an existing one using our result.

ER -