Private feasible solution determination

Abstract Applying secure multi‐party computation (SMC) to implement secure linear programming is an important problem of SMC. Private feasible solution determination means that one of the participants has a private value and the other participants have some constraints, and they want to cooperativel...

Full description

Saved in:
Bibliographic Details
Main Authors: Xue Ge, Jiawei Dou, Wenli Wang, Yingnan Wang
Format: Article
Language:English
Published: Wiley 2021-01-01
Series:IET Information Security
Subjects:
Online Access:https://doi.org/10.1049/ise2.12003
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832546755010363392
author Xue Ge
Jiawei Dou
Wenli Wang
Yingnan Wang
author_facet Xue Ge
Jiawei Dou
Wenli Wang
Yingnan Wang
author_sort Xue Ge
collection DOAJ
description Abstract Applying secure multi‐party computation (SMC) to implement secure linear programming is an important problem of SMC. Private feasible solution determination means that one of the participants has a private value and the other participants have some constraints, and they want to cooperatively determine whether the private value satisfies the constraints without disclosing their private information. This problem has important theoretical and practical significance in both scientific research and practice. In this study, the authors propose a protocol based on elliptic curve cryptosystem for this problem and prove that the protocol is secure in the semi‐honest model. Furthermore, threshold decryption elliptic curve cryptosystem is used to privately determine a feasible solution with multiple constraints for two‐party and multi‐party scenarios. The efficiency analysis shows that the protocols developed in this study are simple and efficient. Finally, the authors also show how to use these protocols to solve other SMC problems.
format Article
id doaj-art-a8bca94d70e345d0bf5d97d91aa4dfd1
institution Kabale University
issn 1751-8709
1751-8717
language English
publishDate 2021-01-01
publisher Wiley
record_format Article
series IET Information Security
spelling doaj-art-a8bca94d70e345d0bf5d97d91aa4dfd12025-02-03T06:47:25ZengWileyIET Information Security1751-87091751-87172021-01-01151768610.1049/ise2.12003Private feasible solution determinationXue Ge0Jiawei Dou1Wenli Wang2Yingnan Wang3School of Mathematics and Information Science Shaanxi Normal University Xi'an ChinaSchool of Mathematics and Information Science Shaanxi Normal University Xi'an ChinaSchool of Computer Science Shaanxi Normal University Xi'an ChinaSchool of Mathematics and Information Science Shaanxi Normal University Xi'an ChinaAbstract Applying secure multi‐party computation (SMC) to implement secure linear programming is an important problem of SMC. Private feasible solution determination means that one of the participants has a private value and the other participants have some constraints, and they want to cooperatively determine whether the private value satisfies the constraints without disclosing their private information. This problem has important theoretical and practical significance in both scientific research and practice. In this study, the authors propose a protocol based on elliptic curve cryptosystem for this problem and prove that the protocol is secure in the semi‐honest model. Furthermore, threshold decryption elliptic curve cryptosystem is used to privately determine a feasible solution with multiple constraints for two‐party and multi‐party scenarios. The efficiency analysis shows that the protocols developed in this study are simple and efficient. Finally, the authors also show how to use these protocols to solve other SMC problems.https://doi.org/10.1049/ise2.12003cryptographic protocolscryptographydata privacylinear programmingprotocolspublic key cryptography
spellingShingle Xue Ge
Jiawei Dou
Wenli Wang
Yingnan Wang
Private feasible solution determination
IET Information Security
cryptographic protocols
cryptography
data privacy
linear programming
protocols
public key cryptography
title Private feasible solution determination
title_full Private feasible solution determination
title_fullStr Private feasible solution determination
title_full_unstemmed Private feasible solution determination
title_short Private feasible solution determination
title_sort private feasible solution determination
topic cryptographic protocols
cryptography
data privacy
linear programming
protocols
public key cryptography
url https://doi.org/10.1049/ise2.12003
work_keys_str_mv AT xuege privatefeasiblesolutiondetermination
AT jiaweidou privatefeasiblesolutiondetermination
AT wenliwang privatefeasiblesolutiondetermination
AT yingnanwang privatefeasiblesolutiondetermination