Won-Ho Kye, M. S. Kim
In this paper, we briefly show how the quantum key distribution with blind polarization bases [Kye et al., Phys. Rev. Lett. 95, 040501 (2005)] can be made secure against the invisible photon attack.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
In this paper, we briefly show how the quantum key distribution with blind polarization bases [Kye et al., Phys. Rev. Lett. 95, 040501 (2005)] can be made secure against the impersonation attack.
The crucial issue of quantum communication protocol is its security. In this paper, we show that all the deterministic and direct two-way quantum communication protocols, sometimes called ping-pong (PP) protocols, are insecure when an eavesdropper uses the invisible photon to eavesdrop on the communication. With our invisible photon eavesdropping (IPE) scheme, the eavesdropper can obtain full information of the communication with zero risk of being detected. We show that this IPE scheme can be implemented experimentally with current technology. Finally, a possible improvement of PP communicati…
Blind quantum computation (BQC) protocol allows a client having partial quantum ability to delegate his quantum computation to a remote quantum server without leaking any information about the input, the output and the intended computation to the server. Several BQC protocols have been proposed, e.g., Li et al. in [1] proposed a triple-server BQC protocol and Xu et al. in [2] proposed a single-server BQC protocol. Though both papers claimed that their protocols can satisfy the requirement of privacy, this paper points out a security loophole in their protocols. With that the server can reveal …
Blind quantum computing [A. Broadbent, J. Fitzsimons, and E. Kashefi, Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science 517 (2009)] is a secure cloud quantum computing protocol which enables a client (who does not have enough quantum technology at her disposal) to delegate her quantum computation to a server (who has a universal quantum computer) without leaking any relevant information to the server. In [T. Morimae and K. Fujii, Phys. Rev. A {\bf87}, 050301(R) (2013)], a new blind quantum computing protocol, so called the measuring-Alice protocol, was proposed. …
This is a brief comment on the Letter by Balygin and his coworkers [Laser Phys. Lett. 15, 095203 (2018)]. We point out an error that invalidates the Letter's conclusions.
In this study, the security of Novel Enhanced Quantum Representation (NEQR) of quantum images are suggested by using the Quantum Fourier Transform (QFT) with blind trent. In the protocol, QFT and keys are used to share signature with recipients. So all members know only their signature information which are encrypted output of the QFT. This improves the security of the protocol. In addition, the security of the protocol is provided by using reorder QFT output qubits with permutation of the blind trent. The security analysis expresses security of the transfer of the image with effective secret …
For the realization of quantum key distribution, it is important to investigate its security based on a mathematical model that captures properties of the actual devices used by the legitimate users. Recently, Ferenczi, et. al. (Phys. Rev. A 86 042327 (2012)) pointed out potential influences that the losses in phase modulators and/or the unbalance in the transmission rate of beam splitters may have on the security of the phase-encoded BB84 and analyzed the security of this scheme, which is called the unbalanced BB84. In this paper, we ask whether blindly applying the post-processing of the bal…
Quantum Magic Reveals CP Phases Invisible to Entanglement in Spin-0 Decays
该研究展示了在自旋0衰变中，传统量子信息度量如纠缠度、负性、纠缠熵、优化CHSH界限和量子 Fisher 信息在CP相位方面是盲目的，但通过稳定器魔术可以揭示这些相位，提出两种实验可实现的CP见证器，其中线性幅度在HL-LHC实验中对H→τ+τ-衰变具有发现水平的灵敏度。
Recently, a broadcasting multiple blind signature scheme based on quantum teleportation has been proposed for the first time. It is claimed to have unconditional security and properties of quantum multiple signature and quantum blind signature. In this paper, we analyze the security of the protocol and show that the signatory Ui can learn the signed message m by a single particle measurement and the signed message m can be modified at random by anyone according to the scheme. Furthermore, there are some participant attacks and external attacks existing in the scheme. Finally we present an impr…
Optimizing Resource Costs: A Practical Guide to Achieving Target Security in Verifiable Blind Quantum Computing
提出一个框架，通过约束优化求解噪声鲁棒VBQC协议参数，最小化轮次数，并推导启发式公式以快速估计资源，通过离子阱服务器案例展示如何优化速率-保真度权衡以最小化端到端运行时间。
Blind Transpiler: An open-source library for universally blind and homomorphic quantum computations
本文开发首个将Qiskit电路转换为盲态对应物的开源库，用于盲量子计算。该库按模块化和可重用组件层设计，便于扩展新原语并抵御底层变化影响，还展示了其在盲态变分量子分类器中对鸢尾花数据集的实现。
The recently proposed Universal Blind Quantum Computation (UBQC) protocol allows a client to perform an arbitrary quantum computation on a remote server such that perfect privacy is guaranteed if the client is capable of producing random separable single qubit states. While from a theoretical point of view, this arguably constitutes the lowest possible quantum requirement, from a pragmatic point of view, generation of random single qubits which can be sent along long distances without loss is quite challenging and can never be achieved perfectly. In analogy to the concept of approximate securi…
We demonstrate the experimental feasibility of a Trojan-horse attack that remains nearly invisible to the single-photon detectors employed in practical quantum key distribution (QKD) systems, such as Clavis2 from ID Quantique. We perform a detailed numerical comparison of the attack performance against Scarani-Acin-Ribordy-Gisin (SARG04) QKD protocol at 1924nm versus that at 1536nm. The attack strategy was proposed earlier but found to be unsuccessful at the latter wavelength, as reported in N.~Jain et al., New J. Phys. 16, 123030 (2014). However at 1924nm, we show experimentally that the nois…
We investigate the possibility of "having someone carry out the work of executing a function for you, but without letting him learn anything about your input". Say Alice wants Bob to compute some known function f upon her input x, but wants to prevent Bob from learning anything about x. The situation arises for instance if client Alice has limited computational resources in comparison with mistrusted server Bob, or if x is an inherently mobile piece of data. Could there be a protocol whereby Bob is forced to compute f(x) "blindly", i.e. without observing x? We provide such a blind computation …
Blind quantum computation is a new secure quantum computing protocol which enables Alice who does not have sufficient quantum technology to delegate her quantum computation to Bob who has a fully-fledged quantum computer in such a way that Bob cannot learn anything about Alice's input, output, and algorithm. In previous protocols, Alice needs to have a device which generates quantum states, such as single-photon states. Here we propose another type of blind computing protocol where Alice does only measurements, such as the polarization measurements with a threshold detector. In several experim…
It is called blind quantum computation(BQC) that a client who has limited quantum technologies can delegate her quantum computing to a server who has fully-advanced quantum computers. But the privacy of the client's quantum inputs, algorithms and outputs is still a challenge. To realize a secure BQC, we mainly study how to hide quantum fourier transform (QFT) performed on Bell states. In this paper, three cases are considered as follows. For the first case, we design primary BQC protocols of QFT performed on qubits 12 of belonging to $\{|ϕ^\pm\rangle_{12},$ $|ψ^\pm\rangle_{12}\}$ with relevant…
Blindly Factorizing 21 Quantumly
提出经典可验证的盲目量子分解方案，将可分解的半素数从15推进到21，采用更难基数、非克利福德门及五EPR对，为扩展盲目量子分解奠定基础。
Composable Verification in the Circuit-Model via Magic-Blindness
本文引入一族针对Clifford+MSI电路的噪声鲁棒、可组合且高效的验证协议，通过魔法盲性概念实现与MBQC模型同等的安全性和鲁棒性，并降低量子通信成本。
We propose a new quantum key distribution scheme that uses the blind polarization basis. In our scheme the sender and the receiver share key information by exchanging qubits with arbitrary polarization angles without basis reconciliation. As only random polarizations are transmitted, our protocol is secure even when a key is embedded in a not-so-weak coherent-state pulse. We show its security against the photon number splitting attack and the impersonation attack.
We derive the time-dependent photo-detection probability equation of a superconducting single photon detector (SSPD) to study the responsive property for a pulse train at high repetition rate. Using this equation, we analyze the characteristics of SSPDs when illuminated by bright pulses in blinding attack on a quantum key distribution (QKD). We obtain good agreement between expected values based on our equation and actual experimental values. Such a time-dependent probability analysis contributes to security analysis.
Efficient Post-Quantum Secured Blind Computation
针对云端量子计算中的不可信服务器问题，本文提出一种仅需经典通信的可验证基于电路的盲计算模型，实现后量子计算安全。
We consider the security of the Bennett-Brassard 1984 (BB84) protocol for Quantum Key Distribution (QKD), with arbitrary individual imperfections simultaneously in the source and detectors. We provide the secure key generation rate, and show that only two parameters must be bounded to ensure security; the basis dependence of the source and a detector blinding parameter. The system may otherwise be completely uncharacterized and contain large losses.
Security of an ideal system for quantum key distribution can be formally proved. However, technological imperfections of real systems can be misused by an eavesdropper to get information about the key without causing a detectable change in the error rate. An example of this is the blinding attack where the eavesdropper manipulates detectors of the receiving party. To avoid such an attack, technical modifications of the device are usually required. In this paper we show that an extended measurement, similar to the Bell test measurement, can reveal the blinding attack without any modification of…
Blindness is a desirable feature in delegated computation. In the classical setting, blind computations protect the data or even the program run by a server. In the quantum regime, blind computing may also enable testing computational or other quantum properties of the server system. Here we propose a scheme for universal blind quantum computation using a quantum simulator capable of emulating Heisenberg-like Hamiltonians. Our scheme is inspired by the central spin Hamiltonian in which a single spin controls dynamics of a number of bath spins. We show how, by manipulating this spin, a client t…
Partial Blind Quantum Computation: A Framework for Selective Circuit Protection
针对UBQC全电路开销大的问题，提出选择性UBQC框架，仅保护敏感子电路，结合QHE与门校正机制，保持安全性并提升效率，以Grover算法为例验证优势。
In the last decade, efforts have been made to reconcile theoretical security with realistic imperfect implementations of quantum key distribution (QKD). Implementable countermeasures are proposed to patch the discovered loopholes. However, certain countermeasures are not as robust as would be expected. In this paper, we present a concrete example of ID Quantique's random-detector-efficiency countermeasure against detector blinding attacks. As a third-party tester, we have found that the first industrial implementation of this countermeasure is effective against the original blinding attack, bu…
Modern single-photon detectors based on avalanche photodiodes offer increasingly higher triggering speeds, thus fostering their use in several fields, prominently in the recent area of Quantum Key Distribution. To reduce the probability of an afterpulse, these detectors are usually equipped with a circuitry that disables the trigger for a certain time after a positive detection event, known as dead time. If the acquisition system connected to the detector is not properly designed, efficiency issues arise when the triggering rate is faster than the inverse of detector's dead-time. Moreover, whe…
In the standard oracle model, an oracle efficiently evaluates an unknown classical function independent of the quantum algorithm itself. Quantum algorithms have a complex interrelationship to their oracles; for example the possibility of quantum speedup is affected by the manner by which oracles are implemented. Therefore, it is physically meaningful to separate oracles from their quantum algorithms, and we introduce one such separation here. We define the Blind Oracular Quantum Computation (BOQC) scheme, in which the oracle is a distinct node in a quantum network. Our work augments the client…
We developed a countermeasure against blinding attacks on low-noise detectors with a background noise cancellation scheme in quantum key distribution (QKD) systems. Background noise cancellation includes self-differencing and balanced avalanche photon diode (APD) schemes and is considered a promising solution for low-noise APDs, which are critical components in high-performance QKD systems. However, its vulnerability to blinding attacks has been recently reported. In this work, we propose a new countermeasure that prevents this potential security loophole from being used in detector blinding a…
Blind quantum computation is a scheme that adds unconditional security to cloud quantum computation. In the protocol proposed by Broadbent, Fitzsimons, and Kashefi, the ability to prepare and transmit a single qubit is required for a user (client) who uses a quantum computer remotely. In case a weak coherent pulse is used as a pseudo single photon source, however, we must introduce decoy states, owing to the inherent risk of transmitting multiple photon. In this study, we demonstrate that by using a heralded single photon source and a probabilistic photon number resolving detector, we can gain…
This work revisits the security of classical signatures and ring signatures in a quantum world. For (ordinary) signatures, we focus on the arguably preferable security notion of blind-unforgeability recently proposed by Alagic et al. (Eurocrypt'20). We present two short signature schemes achieving this notion: one is in the quantum random oracle model, assuming quantum hardness of SIS; and the other is in the plain model, assuming quantum hardness of LWE with super-polynomial modulus. Prior to this work, the only known blind-unforgeable schemes are Lamport's one-time signature and the Winterni…
Verifiable blind quantum computing: Comparative analysis and design considerations for client architectures
本文对与物质量子比特服务器的可验证盲量子计算客户端架构作比较分析，识别出基于发射、测量、旋转的三类架构及多种变体，从多维度评估，给出执行协议速率方程等，为特定场景选最合适架构提供考量框架。
Verifiable blind probabilistic error cancellation
研究针对不可信量子硬件上端到端安全性问题，提出可验证的盲概率误差消除（VBPEC）协议，将概率误差消除技术纳入可组合安全范围，通过扩展验证方法和开发新证明技术，实现主动消除噪声，提高验证实用性，为委托量子计算奠定基础。
Verifiable blind observable estimation
本文提出VBOE协议，通过高效构建SDOE资源，实现对量子-经典混合算法的严格可组合验证，解决可观测量估计的验证难题。
We analyzed the security of the secure direct communication protocol based on secret transmitting order of particles recently proposed by Zhu, Xia, Fan, and Zhang [Phys. Rev. A 73, 022338 (2006)], and found that this scheme is insecure if an eavesdropper, say Eve, wants to steal the secret message with Trojan horse attack strategies. The vital loophole in this scheme is that the two authorized users check the security of their quantum channel only once. Eve can insert another spy photon, an invisible photon or a delay one in each photon which the sender Alice sends to the receiver Bob, and cap…
Communication-Optimal Blind Quantum Protocols
本文研究盲量子计算中Alice与Bob通信的最少资源，提出熵界技术量化所需量子比特数，并给出饱和该界的最优协议，证明Clifford门情形下可分离态足够。
We introduce a simple protocol for verifiable measurement-only blind quantum computing. Alice, a client, can perform only single-qubit measurements, whereas Bob, a server, can generate and store entangled many-qubit states. Bob generates copies of a graph state, which is a universal resource state for measurement-based quantum computing, and sends Alice each qubit of them one by one. Alice adaptively measures each qubit according to her program. If Bob is honest, he generates the correct graph state, and therefore Alice can obtain the correct computation result. Regarding the security, whateve…
Blind-spots of Randomized Benchmarking Under Temporal Correlations
本文推导了存在经典记忆的时间相关（非马尔可夫）噪声下平均序列保真度的解析表达式，揭示了随机基准测试对某些相互作用哈密顿量的时间相关性不可见，并指出时间相关性可能抑制最坏情况误差。
Blind quantum computation is a new secure quantum computing protocol where a client, who does not have enough quantum technologies at her disposal, can delegate her quantum computation to a server, who has a fully-fledged quantum computer, in such a way that the server cannot learn anything about client's input, output, and program. If the client interacts with only a single server, the client has to have some minimum quantum power, such as the ability of emitting randomly rotated single-qubit states or the ability of measuring states. If the client interacts with two servers who share Bell pa…
Detector blinding attacks on counterfactual quantum key distribution
本研究针对反事实量子密钥分发协议，提出两种探测器致盲攻击方法，证明其安全性漏洞，并强调实验实现需加入明确对策以抵御此类攻击。
Suppose some data have been encrypted, can you compute with the data without decrypting them? This problem has been studied as homomorphic encryption and blind computing. We consider this problem in the context of quantum information processing, and present the definitions of quantum homomorphic encryption (QHE) and quantum fully homomorphic encryption (QFHE). Then, based on quantum one-time pad (QOTP), we construct a symmetric QFHE scheme, where the evaluate algorithm depends on the secret key. This scheme permits any unitary transformation on any $n$-qubit state that has been encrypted. Comp…
A broadcasting multiple blind signature scheme based on quantum GHZ entanglement has been presented recently by Tian et al. It is said that the scheme's unconditional security is guaranteed by adopting quantum key preparation, quantum encryption algorithm and quantum entanglement. In this paper, we prove that each signatory can get the signed message just by an intercept-resend attack. Then, we show there still exists some participant attacks and external attacks. Specifically, we verify the message sender Alice can impersonate each signatory to sign the message at will, and so is the signatur…
Blind quantum computation (BQC) allows a client (Alice), who only possesses relatively poor quantum devices, to delegate universal quantum computation to a server (Bob) in such a way that Bob cannot know Alice's inputs, algorithm, and outputs. The quantum channel between Alice and Bob is noisy, and the loss over the long-distance quantum communication should also be taken into account. Here we propose to use decoherence-free subspace (DFS) to overcome the collective noise in the quantum channel for BQC, which we call DFS-BQC. We propose three variations of DFS-BQC protocols. One of them, a coh…
Implementation of classical client universal blind quantum computation with 8-state RSP in current architecture
本文针对完全经典客户端的安全委托量子计算需求，将UBQC与8态RSP结合，在IBM Quantum当前非交互架构中实现盲簇态制备与委托计算。
Fast gated avalanche photodiodes (APDs) are the most commonly used single photon detectors for high bit rate quantum key distribution (QKD). Their robustness against external attacks is crucial to the overall security of a QKD system or even an entire QKD network. Here, we investigate the behavior of a gigahertz-gated, self-differencing InGaAs APD under strong illumination, a tactic Eve often uses to bring detectors under her control. Our experiment and modelling reveal that the negative feedback by the photocurrent safeguards the detector from being blinded through reducing its avalanche prob…
Hidden multi-dimensional modulation side channels in quantum protocols
该研究揭示实际量子设备常存在隐藏多维调制，破坏协议的维度假设并引入侧信道，为量子密钥分发、盲量子计算等密码协议的安全评估提供重要警示。
Delegating difficult computations to remote large computation facilities, with appropriate security guarantees, is a possible solution for the ever-growing needs of personal computing power. For delegated computation protocols to be usable in a larger context---or simply to securely run two protocols in parallel---the security definitions need to be composable. Here, we define composable security for delegated quantum computation. We distinguish between protocols which provide only blindness---the computation is hidden from the server---and those that are also verifiable---the client can check…
Quantum cryptography is information-theoretically secure owing to its solid basis in quantum mechanics. However, generally, initial implementations with practical imperfections might open loopholes, allowing an eavesdropper to compromise the security of a quantum cryptographic system. This has been shown to happen for quantum key distribution (QKD). Here we apply experience from implementation security of QKD to several other quantum cryptographic primitives. We survey quantum digital signatures, quantum secret sharing, source-independent quantum random number generation, quantum secure direct…
Experimental verifiable multi-client blind quantum computing on a Qline architecture
本研究实现了首个在分布式架构上的两客户端可验证盲量子计算实验，展示了在多客户端分布式量子计算中验证技术的新视角。
The security of source has become an increasingly important issue in quantum cryptography. Based on the framework of measurement-device-independent quantum-key-distribution (MDI-QKD), the source becomes the only region exploitable by a potential eavesdropper (Eve). Phase randomization is a cornerstone assumption in most discrete-variable (DV-) quantum communication protocols (e.g., QKD, quantum coin tossing, weak coherent state blind quantum computing, and so on), and the violation of such an assumption is thus fatal to the security of those protocols. In this paper, we show a simple quantum h…
A Provably Secure Framework for Noise-Aware Delegated Quantum Computation and Storage
本文提出一种噪声感知分布式量子计算集成架构框架，整合分布式稳定子码主干、两级错误管理结构及基于陷阱的验证协议，可在非通信和有界合谋假设下实现量子计算的安全性，为安全量子云服务奠定基础。
Private distributed learning studies the problem of how multiple distributed entities collaboratively train a shared deep network with their private data unrevealed. With the security provided by the protocols of blind quantum computation, the cooperation between quantum physics and machine learning may lead to unparalleled prospect for solving private distributed learning tasks. In this paper, we introduce a quantum protocol for distributed learning that is able to utilize the computational power of the remote quantum servers while keeping the private data safe. For concreteness, we first int…
We propose an efficient strategy to attack a continuous-variable quantum key distribution (CV-QKD) system, that we call homodyne detector blinding. This attack strategy takes advantage of a generic vulnerability of homodyne receivers: a bright light pulse sent on the signal port can lead to a saturation of the detector electronics. While detector saturation has already been proposed to attack CV-QKD, the attack we study in this paper has the additional advantage of not requiring an eavesdropper to be phase locked with the homodyne receiver. We show that under certain conditions, an attacker ca…
Randomness, mainly in the form of random numbers, is the fundamental prerequisite for the security of many cryptographic tasks. Quantum randomness can be extracted even if adversaries are fully aware of the protocol and even control the randomness source. However, an adversary can further manipulate the randomness via tailored detector blinding attacks, which are hacking attacks suffered by protocols with trusted detectors. Here, by treating no-click events as valid events, we propose a quantum random number generation protocol that can simultaneously address source vulnerability and ferocious…
Quantum key distribution is rising as an important cryptographic primitive for protecting the communication infrastructure in the digital era. However, its implementation security is often weakened by components whose behavior deviates from what is expected. Here, we analyse the response of a self-differencing avalanche photodiode, a key enabler for high speed quantum key distribution, to intense light shone from a continuous-wave laser. Under incorrect settings, the cancellation entailed by the self-differencing circuitry can make the detector insensitive to single photons. However, we experi…
We define the functionality of delegated pseudo-secret random qubit generator (PSRQG), where a classical client can instruct the preparation of a sequence of random qubits at some distant party. Their classical description is (computationally) unknown to any other party (including the distant party preparing them) but known to the client. We emphasize the unique feature that no quantum communication is required to implement PSRQG. This enables classical clients to perform a class of quantum communication protocols with only a public classical channel with a quantum server. A key such example i…
We present an active anti-latching system for superconducting nanowire single-photon detectors. We experimentally test it against a bright-light attack, previously used to compromise security of quantum key distribution. Although our system detects continuous blinding, the detector is shown to be partially blindable and controllable by specially tailored sequences of bright pulses. Improvements to the countermeasure are suggested.
Fault-Class-Matched Test Oracles for Output-Invisible Quantum Transpiler Regressions
针对量子转译器回归中输出不可见故障，提出故障类别匹配的预言机家族，涵盖布局元数据、全局相位和可重复性，在真实回归和突变体上达到高敏感性与特异性，且成本低。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。