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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Kartick Sutradhar, Hari Om
Formato:	article
Lenguaje:	EN
Publicado:	Nature Portfolio 2021
Materias:	Medicine R Science Q
Acceso en línea:	https://doaj.org/article/a19664599ea44052a072fa26ec5485b8
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:a19664599ea44052a072fa26ec5485b8
record_format	dspace
spelling	oai:doaj.org-article:a19664599ea44052a072fa26ec5485b82021-12-02T13:57:49ZAn efficient simulation for quantum secure multiparty computation10.1038/s41598-021-81799-z2045-2322https://doaj.org/article/a19664599ea44052a072fa26ec5485b82021-01-01T00:00:00Zhttps://doi.org/10.1038/s41598-021-81799-zhttps://doaj.org/toc/2045-2322Abstract 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.Kartick SutradharHari OmNature PortfolioarticleMedicineRScienceQENScientific Reports, Vol 11, Iss 1, Pp 1-9 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Medicine R Science Q
spellingShingle	Medicine R Science Q Kartick Sutradhar Hari Om An efficient simulation for quantum secure multiparty computation
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.
format	article
author	Kartick Sutradhar Hari Om
author_facet	Kartick Sutradhar Hari Om
author_sort	Kartick Sutradhar
title	An efficient simulation for quantum secure multiparty computation
title_short	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_sort	efficient simulation for quantum secure multiparty computation
publisher	Nature Portfolio
publishDate	2021
url	https://doaj.org/article/a19664599ea44052a072fa26ec5485b8
work_keys_str_mv	AT karticksutradhar anefficientsimulationforquantumsecuremultipartycomputation AT hariom anefficientsimulationforquantumsecuremultipartycomputation AT karticksutradhar efficientsimulationforquantumsecuremultipartycomputation AT hariom efficientsimulationforquantumsecuremultipartycomputation
_version_	1718392277981724672

An efficient simulation for quantum secure multiparty computation

Ejemplares similares