.png){kind=icon}
返回
A constant round quantum secure protocol for oblivious polynomial evaluation
.png){kind=icon}
OA
AI
DOI：10.1016/j.jisa.2023.103560.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Oblivious polynomial evaluation (OPE) is a secure two-party cryptographic protocol that enables a receiver to obliviously retrieve polynomial value on its private input for a private polynomial of a sender. This paper deals with the problem of OPE in the quantum domain. Herein, we propose the construction of the first quantum secure OPE, namely QuOPE. Our design is a constant round protocol that only requires quantum communication of one quantum superposition state that achieves all the stipulated security requirements of an OPE. In particular, privacy and security of the sender and receiver's private data are ensured. In addition, we extend the idea of QuOPE to quantum rational polynomial evaluation (QuORPE). Furthermore, we explore the possibility of utilizing QuOPE as a building block in the automated medical diagnosis platform.
Keyword:
Oblivious polynomial evaluation
Quantum communication
Quantum computation
Long-term security
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
2.0K
被引数:
4.9K
机构
引用论文
Assessing the impacts of current and future concentrations of surface ozone on crop yield with meta-analysis采用元分析方法评估当前及未来地表臭氧浓度对作物产量的影响.png)
IF0
PREAI
分享收藏Learning to Measure: Adaptive Informationally Complete Generalized Measurements for Quantum AlgorithmsPRX QUANTUM
OAAI
PRX QUANTUMIF11
OAAI分享收藏
查看更多内容