A Secure and Lightweight Multi-Party Private Intersection-Sum Scheme over a Symmetric Cryptosystem
A private intersection-sum (PIS) scheme considers the private computing problem of how parties jointly compute the sum of associated values in the set intersection. In scenarios such as electronic voting, corporate credit investigation, and ad conversions, private data are held by different parties....
Main Authors: | , , , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-01-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/15/2/319 |
_version_ | 1797618079346196480 |
---|---|
author | Junwei Zhang Xin Kang Yang Liu Huawei Ma Teng Li Zhuo Ma Sergey Gataullin |
author_facet | Junwei Zhang Xin Kang Yang Liu Huawei Ma Teng Li Zhuo Ma Sergey Gataullin |
author_sort | Junwei Zhang |
collection | DOAJ |
description | A private intersection-sum (PIS) scheme considers the private computing problem of how parties jointly compute the sum of associated values in the set intersection. In scenarios such as electronic voting, corporate credit investigation, and ad conversions, private data are held by different parties. However, despite two-party PIS being well-developed in many previous works, its extended version, multi-party PIS, has rarely been discussed thus far. This is because, depending on the existing works, directly initiating multiple two-party PIS instances is considered to be a straightforward way to achieve multi-party PIS; however, by using this approach, the intersection-sum results of the two parties and the data only belonging to the two-party intersection will be leaked. Therefore, achieving secure multi-party PIS is still a challenge. In this paper, we propose a secure and lightweight multi-party private intersection-sum scheme called SLMP-PIS. We maintain data privacy based on zero sharing and oblivious pseudorandom functions to compute the multi-party intersection and consider the privacy of associated values using arithmetic sharing and symmetric encryption. The security analysis results show that our protocol is proven to be secure in the standard semi-honest security model. In addition, the experiment results demonstrate that our scheme is efficient and feasible in practice. Specifically, when the number of participants is five, the efficiency can be increased by 22.98%. |
first_indexed | 2024-03-11T08:05:09Z |
format | Article |
id | doaj.art-b01a93a9488c4a0d8650389c467c6472 |
institution | Directory Open Access Journal |
issn | 2073-8994 |
language | English |
last_indexed | 2024-03-11T08:05:09Z |
publishDate | 2023-01-01 |
publisher | MDPI AG |
record_format | Article |
series | Symmetry |
spelling | doaj.art-b01a93a9488c4a0d8650389c467c64722023-11-16T23:31:44ZengMDPI AGSymmetry2073-89942023-01-0115231910.3390/sym15020319A Secure and Lightweight Multi-Party Private Intersection-Sum Scheme over a Symmetric CryptosystemJunwei Zhang0Xin Kang1Yang Liu2Huawei Ma3Teng Li4Zhuo Ma5Sergey Gataullin6School of Cyber Engineering, Xidian University, Xi’an 710071, ChinaSchool of Cyber Engineering, Xidian University, Xi’an 710071, ChinaSchool of Cyber Engineering, Xidian University, Xi’an 710071, ChinaInstitute of Artificial Intelligence and Blockchain, Guangzhou University, Guangzhou 510006, ChinaSchool of Cyber Engineering, Xidian University, Xi’an 710071, ChinaSchool of Cyber Engineering, Xidian University, Xi’an 710071, ChinaFaculty of Digital Economy and Mass Communications, Moscow Technical University of Communications and Informatics, 123423 Moscow, RussiaA private intersection-sum (PIS) scheme considers the private computing problem of how parties jointly compute the sum of associated values in the set intersection. In scenarios such as electronic voting, corporate credit investigation, and ad conversions, private data are held by different parties. However, despite two-party PIS being well-developed in many previous works, its extended version, multi-party PIS, has rarely been discussed thus far. This is because, depending on the existing works, directly initiating multiple two-party PIS instances is considered to be a straightforward way to achieve multi-party PIS; however, by using this approach, the intersection-sum results of the two parties and the data only belonging to the two-party intersection will be leaked. Therefore, achieving secure multi-party PIS is still a challenge. In this paper, we propose a secure and lightweight multi-party private intersection-sum scheme called SLMP-PIS. We maintain data privacy based on zero sharing and oblivious pseudorandom functions to compute the multi-party intersection and consider the privacy of associated values using arithmetic sharing and symmetric encryption. The security analysis results show that our protocol is proven to be secure in the standard semi-honest security model. In addition, the experiment results demonstrate that our scheme is efficient and feasible in practice. Specifically, when the number of participants is five, the efficiency can be increased by 22.98%.https://www.mdpi.com/2073-8994/15/2/319private intersection-sumsecure computationcloud computing |
spellingShingle | Junwei Zhang Xin Kang Yang Liu Huawei Ma Teng Li Zhuo Ma Sergey Gataullin A Secure and Lightweight Multi-Party Private Intersection-Sum Scheme over a Symmetric Cryptosystem Symmetry private intersection-sum secure computation cloud computing |
title | A Secure and Lightweight Multi-Party Private Intersection-Sum Scheme over a Symmetric Cryptosystem |
title_full | A Secure and Lightweight Multi-Party Private Intersection-Sum Scheme over a Symmetric Cryptosystem |
title_fullStr | A Secure and Lightweight Multi-Party Private Intersection-Sum Scheme over a Symmetric Cryptosystem |
title_full_unstemmed | A Secure and Lightweight Multi-Party Private Intersection-Sum Scheme over a Symmetric Cryptosystem |
title_short | A Secure and Lightweight Multi-Party Private Intersection-Sum Scheme over a Symmetric Cryptosystem |
title_sort | secure and lightweight multi party private intersection sum scheme over a symmetric cryptosystem |
topic | private intersection-sum secure computation cloud computing |
url | https://www.mdpi.com/2073-8994/15/2/319 |
work_keys_str_mv | AT junweizhang asecureandlightweightmultipartyprivateintersectionsumschemeoverasymmetriccryptosystem AT xinkang asecureandlightweightmultipartyprivateintersectionsumschemeoverasymmetriccryptosystem AT yangliu asecureandlightweightmultipartyprivateintersectionsumschemeoverasymmetriccryptosystem AT huaweima asecureandlightweightmultipartyprivateintersectionsumschemeoverasymmetriccryptosystem AT tengli asecureandlightweightmultipartyprivateintersectionsumschemeoverasymmetriccryptosystem AT zhuoma asecureandlightweightmultipartyprivateintersectionsumschemeoverasymmetriccryptosystem AT sergeygataullin asecureandlightweightmultipartyprivateintersectionsumschemeoverasymmetriccryptosystem AT junweizhang secureandlightweightmultipartyprivateintersectionsumschemeoverasymmetriccryptosystem AT xinkang secureandlightweightmultipartyprivateintersectionsumschemeoverasymmetriccryptosystem AT yangliu secureandlightweightmultipartyprivateintersectionsumschemeoverasymmetriccryptosystem AT huaweima secureandlightweightmultipartyprivateintersectionsumschemeoverasymmetriccryptosystem AT tengli secureandlightweightmultipartyprivateintersectionsumschemeoverasymmetriccryptosystem AT zhuoma secureandlightweightmultipartyprivateintersectionsumschemeoverasymmetriccryptosystem AT sergeygataullin secureandlightweightmultipartyprivateintersectionsumschemeoverasymmetriccryptosystem |