中文版 | English
题名

Capacity of Quantum Private Information Retrieval with Colluding Servers

作者
发表日期
2021
DOI
发表期刊
ISSN
0018-9448
EISSN
1557-9654
卷号2020-June页码:1077-1082
摘要
Quantum private information retrieval (QPIR) is a protocol in which a user retrieves one of multiple files from n non-communicating servers by downloading quantum systems without revealing which file is retrieved. As variants of QPIR with stronger security requirements, symmetric QPIR is a protocol in which no other files than the target file are leaked to the user, and t-private QPIR is a protocol in which the identity of the target file is kept secret even if at most t servers may collude to reveal the identity. The QPIR capacity is the maximum ratio of the file size to the size of downloaded quantum systems, and we prove that the symmetric t-private QPIR capacity is min1, 2(n -t)/n for any 1 ≤ t < n. We construct a capacity-achieving QPIR protocol by the stabilizer formalism and prove the optimality of our protocol. The proposed capacity is greater than the classical counterpart.
关键词
相关链接[Scopus记录]
收录类别
SCI ; EI
语种
英语
学校署名
其他
WOS记录号
WOS:000673623300036
EI入藏号
20203709169862
EI主题词
Search engines ; Information theory ; Information retrieval
EI分类号
Information Theory and Signal Processing:716.1 ; Computer Software, Data Handling and Applications:723 ; Light/Optics:741.1 ; Information Retrieval and Use:903.3 ; Quantum Theory; Quantum Mechanics:931.4
ESI学科分类
COMPUTER SCIENCE
Scopus记录号
2-s2.0-85105598872
来源库
Scopus
引用统计
被引频次[WOS]:13
成果类型期刊论文
条目标识符http://sustech.caswiz.com/handle/2SGJ60CL/228508
专题研究生院
理学院_物理系
量子科学与工程研究院
作者单位
1.Graduate school of Mathematics, Nagoya University, Nagoya, 464-8602, Japan. (e-mail: m17021a@math.nagoya-u.ac.jp)
2.Shenzhen Institute for Quantum Science and Engineering, Southern University of Science and Technology, Shenzhen, 518055, China, Guangdong Provincial Key Laboratory of Quantum Science and Engineering, Southern University of Science and Technology, Shenzhen 518055, China, Shenzhen Key Laboratory of Quantum Science and Engineering, Southern University of Science and Technology, Shenzhen 518055, China, and Graduate School of Mathematics, Nagoya University, Nagoya, 464-8602, Japan.
推荐引用方式
GB/T 7714
Song,Seunghoan,Hayashi,Masahito. Capacity of Quantum Private Information Retrieval with Colluding Servers[J]. IEEE TRANSACTIONS ON INFORMATION THEORY,2021,2020-June:1077-1082.
APA
Song,Seunghoan,&Hayashi,Masahito.(2021).Capacity of Quantum Private Information Retrieval with Colluding Servers.IEEE TRANSACTIONS ON INFORMATION THEORY,2020-June,1077-1082.
MLA
Song,Seunghoan,et al."Capacity of Quantum Private Information Retrieval with Colluding Servers".IEEE TRANSACTIONS ON INFORMATION THEORY 2020-June(2021):1077-1082.
条目包含的文件
条目无相关文件。
个性服务
原文链接
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
导出为Excel格式
导出为Csv格式
Altmetrics Score
谷歌学术
谷歌学术中相似的文章
[Song,Seunghoan]的文章
[Hayashi,Masahito]的文章
百度学术
百度学术中相似的文章
[Song,Seunghoan]的文章
[Hayashi,Masahito]的文章
必应学术
必应学术中相似的文章
[Song,Seunghoan]的文章
[Hayashi,Masahito]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
[发表评论/异议/意见]
暂无评论

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。