高效量子安全多方最大公约数协议及其在私有集合运算中的应用

IF 5.8 2区 物理与天体物理 Q1 OPTICS EPJ Quantum Technology Pub Date : 2024-09-09 DOI:10.1140/epjqt/s40507-024-00268-4
Zi-Xian Li, Wen-Jie Liu, Bing-Mei Su
{"title":"高效量子安全多方最大公约数协议及其在私有集合运算中的应用","authors":"Zi-Xian Li,&nbsp;Wen-Jie Liu,&nbsp;Bing-Mei Su","doi":"10.1140/epjqt/s40507-024-00268-4","DOIUrl":null,"url":null,"abstract":"<div><p>Private set intersection (PSI) has important application value, however, current quantum PSI protocols are either unsuitable for multi-party scenarios or inefficient. Recently, Imran (arXiv:2303.17196v3, 2023) proposed two quantum secure multi-party greatest common divisor (GCD) protocols that can be used for PSI, but with the downside of information leakage and resource consumption. In this paper, we propose a novel quantum secure multi-party GCD protocol that has higher security and lower complexity. To hide privacy, each party randomly selects a coefficient within a range determined by his input integer, and with the assistance of a semi-honest third party TP, all parties secretly calculate the linear combination of their inputs under these coefficients. Once enough linear combinations are collected, TP calculates the GCD of these combinations, which is equal to the GCD of all input integers. To verify the honesty of participants, a quantum zero-knowledge proof sub-protocol is designed. Analysis shows that our GCD protocol is correct and has security against malicious attacks. Moreover, its complexity is polynomial level and lower than Imran’s. Furthermore, we demonstrate the scalability of our GCD protocol in private set operations, such as private set intersection, private set intersection cardinality, private multi-set intersection, etc.</p></div>","PeriodicalId":547,"journal":{"name":"EPJ Quantum Technology","volume":null,"pages":null},"PeriodicalIF":5.8000,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://epjquantumtechnology.springeropen.com/counter/pdf/10.1140/epjqt/s40507-024-00268-4","citationCount":"0","resultStr":"{\"title\":\"Efficient quantum secure multi-party greatest common divisor protocol and its applications in private set operations\",\"authors\":\"Zi-Xian Li,&nbsp;Wen-Jie Liu,&nbsp;Bing-Mei Su\",\"doi\":\"10.1140/epjqt/s40507-024-00268-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Private set intersection (PSI) has important application value, however, current quantum PSI protocols are either unsuitable for multi-party scenarios or inefficient. Recently, Imran (arXiv:2303.17196v3, 2023) proposed two quantum secure multi-party greatest common divisor (GCD) protocols that can be used for PSI, but with the downside of information leakage and resource consumption. In this paper, we propose a novel quantum secure multi-party GCD protocol that has higher security and lower complexity. To hide privacy, each party randomly selects a coefficient within a range determined by his input integer, and with the assistance of a semi-honest third party TP, all parties secretly calculate the linear combination of their inputs under these coefficients. Once enough linear combinations are collected, TP calculates the GCD of these combinations, which is equal to the GCD of all input integers. To verify the honesty of participants, a quantum zero-knowledge proof sub-protocol is designed. Analysis shows that our GCD protocol is correct and has security against malicious attacks. Moreover, its complexity is polynomial level and lower than Imran’s. Furthermore, we demonstrate the scalability of our GCD protocol in private set operations, such as private set intersection, private set intersection cardinality, private multi-set intersection, etc.</p></div>\",\"PeriodicalId\":547,\"journal\":{\"name\":\"EPJ Quantum Technology\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":5.8000,\"publicationDate\":\"2024-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://epjquantumtechnology.springeropen.com/counter/pdf/10.1140/epjqt/s40507-024-00268-4\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EPJ Quantum Technology\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://link.springer.com/article/10.1140/epjqt/s40507-024-00268-4\",\"RegionNum\":2,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"OPTICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EPJ Quantum Technology","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.1140/epjqt/s40507-024-00268-4","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPTICS","Score":null,"Total":0}
引用次数: 0

摘要

私集相交(PSI)具有重要的应用价值,然而,目前的量子 PSI 协议要么不适合多方场景,要么效率低下。最近,Imran(arXiv:2303.17196v3, 2023)提出了两个量子安全多方最大公约数(GCD)协议,可用于 PSI,但存在信息泄露和资源消耗的缺点。在本文中,我们提出了一种新型量子安全多方最大公约数(GCD)协议,它具有更高的安全性和更低的复杂度。为了隐藏隐私,每一方在由其输入整数决定的范围内随机选择一个系数,在半诚信第三方 TP 的协助下,各方秘密计算其输入在这些系数下的线性组合。一旦收集到足够多的线性组合,TP 就会计算出这些组合的 GCD,它等于所有输入整数的 GCD。为了验证参与者的诚实性,我们设计了一个量子零知识证明子协议。分析表明,我们的 GCD 协议是正确的,并且具有抵御恶意攻击的安全性。而且,它的复杂度是多项式级的,低于伊姆兰协议。此外,我们还证明了我们的 GCD 协议在私有集操作中的可扩展性,如私有集相交、私有集相交卡明度、私有多集相交等。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Efficient quantum secure multi-party greatest common divisor protocol and its applications in private set operations

Private set intersection (PSI) has important application value, however, current quantum PSI protocols are either unsuitable for multi-party scenarios or inefficient. Recently, Imran (arXiv:2303.17196v3, 2023) proposed two quantum secure multi-party greatest common divisor (GCD) protocols that can be used for PSI, but with the downside of information leakage and resource consumption. In this paper, we propose a novel quantum secure multi-party GCD protocol that has higher security and lower complexity. To hide privacy, each party randomly selects a coefficient within a range determined by his input integer, and with the assistance of a semi-honest third party TP, all parties secretly calculate the linear combination of their inputs under these coefficients. Once enough linear combinations are collected, TP calculates the GCD of these combinations, which is equal to the GCD of all input integers. To verify the honesty of participants, a quantum zero-knowledge proof sub-protocol is designed. Analysis shows that our GCD protocol is correct and has security against malicious attacks. Moreover, its complexity is polynomial level and lower than Imran’s. Furthermore, we demonstrate the scalability of our GCD protocol in private set operations, such as private set intersection, private set intersection cardinality, private multi-set intersection, etc.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
EPJ Quantum Technology
EPJ Quantum Technology Physics and Astronomy-Atomic and Molecular Physics, and Optics
CiteScore
7.70
自引率
7.50%
发文量
28
审稿时长
71 days
期刊介绍: Driven by advances in technology and experimental capability, the last decade has seen the emergence of quantum technology: a new praxis for controlling the quantum world. It is now possible to engineer complex, multi-component systems that merge the once distinct fields of quantum optics and condensed matter physics. EPJ Quantum Technology covers theoretical and experimental advances in subjects including but not limited to the following: Quantum measurement, metrology and lithography Quantum complex systems, networks and cellular automata Quantum electromechanical systems Quantum optomechanical systems Quantum machines, engineering and nanorobotics Quantum control theory Quantum information, communication and computation Quantum thermodynamics Quantum metamaterials The effect of Casimir forces on micro- and nano-electromechanical systems Quantum biology Quantum sensing Hybrid quantum systems Quantum simulations.
期刊最新文献
Generation of phonon quantum states and quantum correlations among single photon emitters in hexagonal boron nitride Teaching quantum information science to secondary school students with photon polarization and which-path encoding A computational study and analysis of Variational Quantum Eigensolver over multiple parameters for molecules and ions Quantum data encoding: a comparative analysis of classical-to-quantum mapping techniques and their impact on machine learning accuracy A methodology to select and adjust quantum noise models through emulators: benchmarking against real backends
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1