On Secret-Sharing-based Secure Two-Party Computation.

Saved in:
Bibliographic Details
Title: On Secret-Sharing-based Secure Two-Party Computation.
Authors: LIN, WEI-CHUNG1 jason1709j23911709@gmaiL.com, WU, HSIN-LUNG2 hsinlung@mailmtpu.edu.tw
Source: Journal of Information Science & Engineering. May2026, Vol. 42 Issue 3, p547-557. 11p.
Subjects: Cryptography
Abstract: This paper studies secure multi-party computation (secure MPC) protocols constructed by secret-sharing techniques. One of well-known secret-sharing-based secure MPC protocols is the CCD protocol previously developed by Chaum, Crepeau and DAmgard which is of high efficiency. However, the CCD-based MPC protocol has a limitation that the number of participants is required to be larger than 2. Until now, it is still unknown whether there a CCD-based secure two-party computation (secure 2PC) protocol exists or not. In this work, we address this open problem by first defining the feasibility of CCD-based secure 2PC protocol construction. Then, based on the feasibility definition, we give an impossibility proof for constructing a CCD-based secure 2PC protocol. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Information Science & Engineering is the property of Institute of Information Science, Academia Sinica and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:This paper studies secure multi-party computation (secure MPC) protocols constructed by secret-sharing techniques. One of well-known secret-sharing-based secure MPC protocols is the CCD protocol previously developed by Chaum, Crepeau and DAmgard which is of high efficiency. However, the CCD-based MPC protocol has a limitation that the number of participants is required to be larger than 2. Until now, it is still unknown whether there a CCD-based secure two-party computation (secure 2PC) protocol exists or not. In this work, we address this open problem by first defining the feasibility of CCD-based secure 2PC protocol construction. Then, based on the feasibility definition, we give an impossibility proof for constructing a CCD-based secure 2PC protocol. [ABSTRACT FROM AUTHOR]
ISSN:10162364
DOI:10.6688/JISE.202605_42(3).0003