An efficient simulation for quantum secure multiparty computation
Abstract The quantum secure multiparty computation is one of the important properties of secure quantum communication. In this paper, we propose a quantum secure multiparty summation (QSMS) protocol based on (t, n) threshold approach, which can be used in many complex quantum operations. To make thi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2021-01-01
|
| Series: | Scientific Reports |
| Online Access: | https://doi.org/10.1038/s41598-021-81799-z |
| _version_ | 1818428972947472384 |
|---|---|
| author | Kartick Sutradhar Hari Om |
| author_facet | Kartick Sutradhar Hari Om |
| author_sort | Kartick Sutradhar |
| collection | DOAJ |
| description | Abstract The quantum secure multiparty computation is one of the important properties of secure quantum communication. In this paper, we propose a quantum secure multiparty summation (QSMS) protocol based on (t, n) threshold approach, which can be used in many complex quantum operations. To make this protocol secure and realistic, we combine both the classical and quantum phenomena. The existing protocols have some security and efficiency issues because they use (n, n) threshold approach, where all the honest players need to perform the quantum multiparty summation protocol. We however use a (t, n) threshold approach, where only t honest players need to compute the quantum summation protocol. Compared to other protocols our proposed protocol is more cost-effective, realistic, and secure. We also simulate it using the IBM corporation’s online quantum computer, or quantum experience. |
| first_indexed | 2024-12-14T15:10:07Z |
| format | Article |
| id | doaj.art-a19664599ea44052a072fa26ec5485b8 |
| institution | Directory Open Access Journal |
| issn | 2045-2322 |
| language | English |
| last_indexed | 2024-12-14T15:10:07Z |
| publishDate | 2021-01-01 |
| publisher | Nature Portfolio |
| record_format | Article |
| series | Scientific Reports |
| spelling | doaj.art-a19664599ea44052a072fa26ec5485b82022-12-21T22:56:36ZengNature PortfolioScientific Reports2045-23222021-01-011111910.1038/s41598-021-81799-zAn efficient simulation for quantum secure multiparty computationKartick Sutradhar0Hari Om1Department of Computer Science and Engineering, Indian Institute of Technology (ISM)Department of Computer Science and Engineering, Indian Institute of Technology (ISM)Abstract The quantum secure multiparty computation is one of the important properties of secure quantum communication. In this paper, we propose a quantum secure multiparty summation (QSMS) protocol based on (t, n) threshold approach, which can be used in many complex quantum operations. To make this protocol secure and realistic, we combine both the classical and quantum phenomena. The existing protocols have some security and efficiency issues because they use (n, n) threshold approach, where all the honest players need to perform the quantum multiparty summation protocol. We however use a (t, n) threshold approach, where only t honest players need to compute the quantum summation protocol. Compared to other protocols our proposed protocol is more cost-effective, realistic, and secure. We also simulate it using the IBM corporation’s online quantum computer, or quantum experience.https://doi.org/10.1038/s41598-021-81799-z |
| spellingShingle | Kartick Sutradhar Hari Om An efficient simulation for quantum secure multiparty computation Scientific Reports |
| title | An efficient simulation for quantum secure multiparty computation |
| title_full | An efficient simulation for quantum secure multiparty computation |
| title_fullStr | An efficient simulation for quantum secure multiparty computation |
| title_full_unstemmed | An efficient simulation for quantum secure multiparty computation |
| title_short | An efficient simulation for quantum secure multiparty computation |
| title_sort | efficient simulation for quantum secure multiparty computation |
| url | https://doi.org/10.1038/s41598-021-81799-z |
| work_keys_str_mv | AT karticksutradhar anefficientsimulationforquantumsecuremultipartycomputation AT hariom anefficientsimulationforquantumsecuremultipartycomputation AT karticksutradhar efficientsimulationforquantumsecuremultipartycomputation AT hariom efficientsimulationforquantumsecuremultipartycomputation |