首页/论文/quant-ph/0001045

arXiv quant-ph/00010452000-01-13quant-ph

Quantum key distribution relied on trusted information center

Guihua Zeng, Zhongyang Wang, Xinmei Wang

备注：: 20 pages

英文摘要：

Quantum correlation between two particles and among three particles show nonclassic properties that can be used for providing secure transmission of information. In this paper, we propose two quantum key distribution schemes for quantum cryptographic network, which use the correlation properties of two and three particles. One is implemented by the Greenberger-Horne-Zeilinger state, and another is implemented by the Bell states. These schemes need a trusted information center like that in the classic cryptography. The optimal efficiency of the proposed protocols are higher than that in the previous schemes.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Blind Quantum Computation without Trusted Center

Blind quantum computation (BQC) protocol allows a client having partially quantum ability to del- egate his quantum computation to a remote quantum server without leaking any information about the input, the output and the intended computation. Recently, many BQC protocols have been proposed with the intention to make the ability of client more classical. In this paper, we propose two BQC protocols, in which the client does not have to generate photons, but only has to perform either rotation or reorder on the received photons.

2015-09-19quant-ph

Trusted center verification model and classical channel remote state preparation

The classical channel remote state preparation (ccRSP) is an important two-party primitive in quantum cryptography. Alice (classical polynomial-time) and Bob (quantum polynomial-time) exchange polynomial rounds of classical messages, and Bob finally gets random single-qubit states while Alice finally gets classical descriptions of the states. In [T. Morimae, arXiv:2003.10712], an information-theoretically-sound non-interactive protocol for the verification of quantum computing was proposed. The verifier of the protocol is classical, but the trusted center is assumed that sends random single-qu…

2020-09-01quant-ph

Blind quantum computation with completely classical client and a trusted center

Blind quantum computation (BQC) enables a client without enough quantum power to delegate his quantum computation to a quantum server, while keeping the input data, the algorithm and the result unknown to the server. In the studies of practical BQC protocol, an important problem is how to reduce the quantum requirement of the client. Multi-server BQC protocols have been proposed to solve this problem. We review the double-server and triple-server protocols [Li et al., Phys. Rev. A 89, 040302(R) (2014)], and propose a modified double-server BQC protocol with a trusted center. In our protocol, t…

2015-10-02quant-ph

Information-theoretically-sound non-interactive classical verification of quantum computing with trusted center

The posthoc verification protocol [J. F. Fitzsimons, M. Hajdu{\v s}ek, and T. Morimae, Physical Review Letters {\bf120}, 040501 (2018)] enables an information-theoretically-sound non-interactive verification of quantum computing, but the message from the prover to the verifier is quantum and the verifier has to do single-qubit measurements. The Mahadev protocol removes these quantum parts, but the soundness becomes the computational one. In this paper, we construct an information-theoretically-sound non-interactive classical verification protocol for quantum computing with a trusted center. Th…

2020-03-24cs.CCcs.CRquant-ph

Quantum k-means algorithm based on Trusted server in Quantum Cloud Computing

We propose a quantum k-means algorithm based on quantum cloud computing that effectively solves the problem that the client can not afford to execute the same quantum subroutine repeatedly in the face of large training samples. In the quantum k-means algorithm, the core subroutine is the Quantum minimization algorithm (GroverOptim), the client needs to repeat several Grover searches to find the minimum value in each iteration to find a new clustering center, so we use quantum homomorphic encryption scheme (QHE) to encrypt the data and upload it to the cloud for computing. After calculation, th…

2020-11-09quant-ph

Finite-key analysis for twin-field quantum key distribution with composable security

Long-distance quantum key distribution (QKD) has long time seriously relied on trusted relay or quantum repeater, which either has security threat or is far from practical implementation. Recently, a solution called twin-field (TF) QKD and its variants have been proposed to overcome this challenge. However, most security proofs are complicated, a majority of which could only ensure security against collective attacks. Until now, the full and simple security proof can only be provided with asymptotic resource assumption. Here, we provide a composable finite-key analysis for coherent-state-based…

2019-11-20quant-ph

更多相关论文收起更多论文

基于金刚石中锗空位色心（GeV）的温度传感器灵敏度优化

Optimization of the sensitivity of a temperature sensor based on germanium-vacancy color center (GeV) in diamond

本文比较了金刚石GeV色心温度传感器的零声子线测量法与二向色镜分束信号比值法，证明在约300 °C且滤波参数最优时，新方法灵敏度接近原方法两倍。

2024-12-06physics.ins-detquant-ph

Quantum Search on Encrypted Data Based on Quantum Homomorphic Encryption

We propose a homomorphic search protocol based on quantum homomorphic encryption, in which a client Alice with limited quantum ability can give her encrypted data to a powerful but untrusted quantum server and let the server search for her without decryption. By outsourcing the interactive key-update process to a trusted key center, Alice only needs to prepare and encrypt her original data and to decrypt the ciphered search result in linear time. Besides, we also present a compact and perfectly secure quantum homomorphic evaluation protocol for Cliford circuits, where the decryption key can be…

2020-03-22cs.CRquant-ph

Bayesian estimation for quantum sensing in the absence of single-shot detection

Quantum information protocols, such as quantum error correction and quantum phase estimation, have been widely used to enhance the performance of quantum sensors. While these protocols have relied on single-shot detection, in most practical applications only an averaged readout is available, as in the case of room-temperature sensing with the electron spin associated with a nitrogen-vacancy center in diamond. Here, we theoretically investigate the application of the quantum phase estimation algorithm for high dynamic-range magnetometry, in the case where single-shot readout is not available. W…

2019-03-11cond-mat.mes-hallquant-ph

部署和验证城域量子密钥分发安全网络：架构与现场性能

Deploying and validating a metropolitan QKD secure network: architecture and field performance

QTI S.r.l.（QTI有限公司）；Politecnico di Torino（都灵理工大学）；Telsy S.p.A.（Telsy股份公司）；TI Sparkle S.p.A.（TI Sparkle股份公司）；TIM S.p.A.（TIM股份公司）

针对量子计算机对经典公钥基础设施的威胁，报告米兰数据中心间城域量子安全网络的部署与验证。采用分层架构，集成多种技术，经动态路径重新配置和应用层验证，确立其用于生产部署的就绪性并提供可复制蓝图。

2026-07-14quant-ph

基于全盲量子计算的云数据量子可搜索加密

Quantum Searchable Encryption for Cloud Data Based on Full-Blind Quantum Computation

针对云环境多客户端加密数据搜索问题，提出基于通用电路的多客户端 FBQC 模型并结合 Grover 算法构建量子可搜索加密方案，验证其可抵抗内外部攻击并保证数据与计算盲性。

2023-09-24cs.CRcs.ETquant-ph

基于旋转算子的多方动态量子同态加密方案

Multi-party dynamic quantum homomorphic encryption scheme based on rotation operators

本文提出一种基于旋转算子的多方动态量子同态加密方案，通过解决T门非交互同态评估误差、动态管理服务器并引入可信密钥中心，将模型扩展至多客户端多服务器，提升了量子分布式网络的实用性与安全性。

2025-05-11math-phmath.MPquant-ph