Loading…
A novel circular semiquantum private comparison protocol of equality without a pre-shared key based on \c{hi}-type states
In this paper, we adopt \c{hi}-type states to design a novel circular semiquantum private comparison (SQPC) protocol which can determine the equality of private inputs from two semiquantum users within one round implementation under the help of a semi-honest third party (TP) who possesses complete q...
Saved in:
Published in: | arXiv.org 2023-06 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | |
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Jiang-Yuan, Lian Tian-Yu, Ye |
description | In this paper, we adopt \c{hi}-type states to design a novel circular semiquantum private comparison (SQPC) protocol which can determine the equality of private inputs from two semiquantum users within one round implementation under the help of a semi-honest third party (TP) who possesses complete quantum capabilities. Here, it is assumed that the semi-honest TP has the abilities to launch all possible attacks to steal useful information about two semiquantum users' private inputs but cannot conspire with anyone else. The travelling particles go from TP to Alice, Alice to Bob and back from Bob to TP. The security analysis turns out the proposed SQPC protocol can resist both the outside attacks and the inside attacks. The proposed SQPC protocol has no demand for unitary operations. Compared with some existing SQPC protocols of equality with quantum entangled states, the proposed SQPC protocol has some advantages more or less:(1)it requires no pre-shared key among different participants; (2)it doesn't need quantum entanglement swapping; and(3)it employs no delay lines. |
format | article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2828557828</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2828557828</sourcerecordid><originalsourceid>FETCH-proquest_journals_28285578283</originalsourceid><addsrcrecordid>eNqNjdFqAkEMRQehoLT-Q8Dnhe2sq_sqovQDfCzIdIzs6OxmnWQsi_jv5qEf0Jfkcs_NzcTMbFV9Fs3S2qmZM1_KsrSrta3rambGDfR0xwg-JJ-jS8DYhVt2veQOhhTuThA8dYNLgalXi4Q8RaAzoOZikBF-g7SUBZxiLLh1CU9wxRF-HKvSs2__aMOzkHFAYNFO_jBvZxcZ53_73Sz2u8P2q9APt4wsxwvl1Cs62sY2db3WWf0v9QJ-Kk9a</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2828557828</pqid></control><display><type>article</type><title>A novel circular semiquantum private comparison protocol of equality without a pre-shared key based on \c{hi}-type states</title><source>Publicly Available Content Database</source><creator>Jiang-Yuan, Lian ; Tian-Yu, Ye</creator><creatorcontrib>Jiang-Yuan, Lian ; Tian-Yu, Ye</creatorcontrib><description>In this paper, we adopt \c{hi}-type states to design a novel circular semiquantum private comparison (SQPC) protocol which can determine the equality of private inputs from two semiquantum users within one round implementation under the help of a semi-honest third party (TP) who possesses complete quantum capabilities. Here, it is assumed that the semi-honest TP has the abilities to launch all possible attacks to steal useful information about two semiquantum users' private inputs but cannot conspire with anyone else. The travelling particles go from TP to Alice, Alice to Bob and back from Bob to TP. The security analysis turns out the proposed SQPC protocol can resist both the outside attacks and the inside attacks. The proposed SQPC protocol has no demand for unitary operations. Compared with some existing SQPC protocols of equality with quantum entangled states, the proposed SQPC protocol has some advantages more or less:(1)it requires no pre-shared key among different participants; (2)it doesn't need quantum entanglement swapping; and(3)it employs no delay lines.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Delay lines ; Entangled states ; Equality ; Protocol ; Quantum entanglement</subject><ispartof>arXiv.org, 2023-06</ispartof><rights>2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2828557828?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Jiang-Yuan, Lian</creatorcontrib><creatorcontrib>Tian-Yu, Ye</creatorcontrib><title>A novel circular semiquantum private comparison protocol of equality without a pre-shared key based on \c{hi}-type states</title><title>arXiv.org</title><description>In this paper, we adopt \c{hi}-type states to design a novel circular semiquantum private comparison (SQPC) protocol which can determine the equality of private inputs from two semiquantum users within one round implementation under the help of a semi-honest third party (TP) who possesses complete quantum capabilities. Here, it is assumed that the semi-honest TP has the abilities to launch all possible attacks to steal useful information about two semiquantum users' private inputs but cannot conspire with anyone else. The travelling particles go from TP to Alice, Alice to Bob and back from Bob to TP. The security analysis turns out the proposed SQPC protocol can resist both the outside attacks and the inside attacks. The proposed SQPC protocol has no demand for unitary operations. Compared with some existing SQPC protocols of equality with quantum entangled states, the proposed SQPC protocol has some advantages more or less:(1)it requires no pre-shared key among different participants; (2)it doesn't need quantum entanglement swapping; and(3)it employs no delay lines.</description><subject>Delay lines</subject><subject>Entangled states</subject><subject>Equality</subject><subject>Protocol</subject><subject>Quantum entanglement</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNjdFqAkEMRQehoLT-Q8Dnhe2sq_sqovQDfCzIdIzs6OxmnWQsi_jv5qEf0Jfkcs_NzcTMbFV9Fs3S2qmZM1_KsrSrta3rambGDfR0xwg-JJ-jS8DYhVt2veQOhhTuThA8dYNLgalXi4Q8RaAzoOZikBF-g7SUBZxiLLh1CU9wxRF-HKvSs2__aMOzkHFAYNFO_jBvZxcZ53_73Sz2u8P2q9APt4wsxwvl1Cs62sY2db3WWf0v9QJ-Kk9a</recordid><startdate>20230621</startdate><enddate>20230621</enddate><creator>Jiang-Yuan, Lian</creator><creator>Tian-Yu, Ye</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20230621</creationdate><title>A novel circular semiquantum private comparison protocol of equality without a pre-shared key based on \c{hi}-type states</title><author>Jiang-Yuan, Lian ; Tian-Yu, Ye</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_28285578283</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Delay lines</topic><topic>Entangled states</topic><topic>Equality</topic><topic>Protocol</topic><topic>Quantum entanglement</topic><toplevel>online_resources</toplevel><creatorcontrib>Jiang-Yuan, Lian</creatorcontrib><creatorcontrib>Tian-Yu, Ye</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jiang-Yuan, Lian</au><au>Tian-Yu, Ye</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>A novel circular semiquantum private comparison protocol of equality without a pre-shared key based on \c{hi}-type states</atitle><jtitle>arXiv.org</jtitle><date>2023-06-21</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>In this paper, we adopt \c{hi}-type states to design a novel circular semiquantum private comparison (SQPC) protocol which can determine the equality of private inputs from two semiquantum users within one round implementation under the help of a semi-honest third party (TP) who possesses complete quantum capabilities. Here, it is assumed that the semi-honest TP has the abilities to launch all possible attacks to steal useful information about two semiquantum users' private inputs but cannot conspire with anyone else. The travelling particles go from TP to Alice, Alice to Bob and back from Bob to TP. The security analysis turns out the proposed SQPC protocol can resist both the outside attacks and the inside attacks. The proposed SQPC protocol has no demand for unitary operations. Compared with some existing SQPC protocols of equality with quantum entangled states, the proposed SQPC protocol has some advantages more or less:(1)it requires no pre-shared key among different participants; (2)it doesn't need quantum entanglement swapping; and(3)it employs no delay lines.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2023-06 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_2828557828 |
source | Publicly Available Content Database |
subjects | Delay lines Entangled states Equality Protocol Quantum entanglement |
title | A novel circular semiquantum private comparison protocol of equality without a pre-shared key based on \c{hi}-type states |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T01%3A28%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=A%20novel%20circular%20semiquantum%20private%20comparison%20protocol%20of%20equality%20without%20a%20pre-shared%20key%20based%20on%20%5Cc%7Bhi%7D-type%20states&rft.jtitle=arXiv.org&rft.au=Jiang-Yuan,%20Lian&rft.date=2023-06-21&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2828557828%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_28285578283%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2828557828&rft_id=info:pmid/&rfr_iscdi=true |