Li Yang, Chenmiao Wu
We realize shamir's no-key protocol via quantum computation of Boolean permutation and private quantum channel. The quantum no-key (QNK) protocol presented here is one with mutual authentications, and proved to be unconditionally secure. An important property of this protocol is that0 its authentication key can be reused permanently.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Quantum forgery attacks on COPA,AES-COPA and marble authenticated encryption algorithms
本文利用 Simon 算法构造针对 COPA、AES-COPA 和 Marble 认证加密算法的量子伪造攻击，将查询复杂度由 O(2^(n/2)) 降至 O(n)，成功率接近 100%。
Authenticated Sublinear Quantum Private Information Retrieval
本文研究可认证的次线性 QPIR，借助量子相对熵等给出更紧通信下界，并提出单服务器、多服务器等后量子安全协议。
Robust Quantum Public-Key Encryption with Applications to Quantum Key Distribution
本研究提出了一种仅需两条消息且满足永久安全性的 QKD 协议，基于抗量子单向函数假设，其核心贡献在于构建了仅依赖认证经典信道的量子公钥加密新方案。
We propose a bit-oriented quantum public-key scheme which uses Boolean function as private-key and randomly changed pairs of quantum state and classical string as public-keys. Contrast to the typical classical public-key scheme, one private-key in our scheme corresponds to an exponential number of public-keys. The goal of our scheme is to achieve information-theoretic security, and the security analysis is also given.
A private shared Cartesian frame is a novel form of private shared correlation that allows for both private classical and quantum communication. Cryptography using a private shared Cartesian frame has the remarkable property that asymptotically, if perfect privacy is demanded, the private classical capacity is three times the private quantum capacity. We demonstrate that if the requirement for perfect privacy is relaxed, then it is possible to use the properties of random subspaces to nearly triple the private quantum capacity, almost closing the gap between the private classical and quantum c…
We propose an entanglement-based quantum bit string commitment protocol whose composability is proven in the random oracle model. This protocol has the additional property of preserving the privacy of the committed message. Even though this property is not resilient against man-in-the-middle attacks, this threat can be circumvented by considering that the parties communicate through an authenticated channel. The protocol remains secure (but not private) if we realize the random oracles as physical unclonable functions in the so-called bad PUF model with access before the opening phase.
We present a quantum probabilistic encryption algorithm for a private-key encryption scheme based on conjugate coding of the qubit string. A probabilistic encryption algorithm is generally adopted in public-key encryption protocols. Here we consider the way it increases the unicity distance of both classical and quantum private-key encryption schemes. The security of quantum probabilistic private-key encryption schemes against two kinds of attacks is analyzed. By using the no-signalling postulate, we show that the scheme can resist attack to the key. The scheme's security against plaintext att…
Fully-homomorphic encryption (FHE) enables computation on encrypted data while maintaining secrecy. Recent research has shown that such schemes exist even for quantum computation. Given the numerous applications of classical FHE (zero-knowledge proofs, secure two-party computation, obfuscation, etc.) it is reasonable to hope that quantum FHE (or QFHE) will lead to many new results in the quantum setting. However, a crucial ingredient in almost all applications of FHE is circuit verification. Classically, verification is performed by checking a transcript of the homomorphic computation. Quantum…
We investigate the definition of security for encryption scheme in quantum context. We systematically define the indistinguishability and semantic security for quantum public-key and private-key encryption schemes, and for computational security, physical security and information-theoretic security. Based on our definition, we present a necessary and sufficient condition that leads to information-theoretic indistinguishability for quantum encryption scheme. The equivalence between the indistinguishability and semantic security of quantum encryption scheme is also proved.
We study the problem of encrypting and authenticating quantum data in the presence of adversaries making adaptive chosen plaintext and chosen ciphertext queries. Classically, security games use string copying and comparison to detect adversarial cheating in such scenarios. Quantumly, this approach would violate no-cloning. We develop new techniques to overcome this problem: we use entanglement to detect cheating, and rely on recent results for characterizing quantum encryption schemes. We give definitions for (i.) ciphertext unforgeability , (ii.) indistinguishability under adaptive chosen-cip…
Quantum Scheme for Private Set Intersection and Union Cardinality based on Quantum Homomorphic Encryption
针对量子资源受限下PSI/PSU隐私计算难题，提出基于QHE的交集与并集基数协议及量子电路，仅用Pauli和CNOT门即可在半诚实第三方协助下安全计算。
Broadbent and Islam (TCC '20) proposed a quantum cryptographic primitive called quantum encryption with certified deletion. In this primitive, a receiver in possession of a quantum ciphertext can generate a classical certificate that the encrypted message is deleted. Although their construction is information-theoretically secure, it is limited to the setting of one-time symmetric key encryption (SKE), where a sender and receiver have to share a common key in advance and the key can be used only once. Moreover, the sender has to generate a quantum state and send it to the receiver over a quant…
Tight Post-Quantum Parallel Repetition for Private-Coin Arguments
本文证明在同态加密下，交互式论证的并行重复可紧致指数降低可靠性误差，并推广至阈值验证者，进而构造首个仅需量子同态加密的QMA常数轮简洁论证。
We present a classification of quantum public-key encryption protocols. There are six elements in quantum public-key encryption: plaintext, ciphertext, public-key, private-key, encryption algorithm and decryption algorithm. According to the property of each element which is either quantum or classical, the quantum public-key encryption protocols can be divided into 64 kinds. Among 64 kinds of protocols, 8 kinds have already been constructed, 52 kinds can be proved to be impossible to construct and the remaining 4 kinds have not been presented effectively yet. This indicates that the research o…
Reverse Delegated Training and Private Inference via Perfectly-Secure Quantum Homomorphic Encryption
本文提出利用完美安全量子同态加密实现量子神经网络的反委托训练和隐私推断，通过Clifford+T分解构建加密模型并保护隐私。
Quantum information is a valuable resource which can be encrypted in order to protect it. We consider the size of the one-time pad that is needed to protect quantum information in a number of cases. The situation is dramatically different from the classical case: we prove that one can recycle the one-time pad without compromising security. The protocol for recycling relies on detecting whether eavesdropping has occurred, and further relies on the fact that information contained in the encrypted quantum state cannot be fully accessed. We prove the security of recycling rates when authentication…
We propose here a quantum secret sharing scheme that works for both quantum and classical secrets. The proposed scheme is based on both entanglement swapping and teleportation together. It allows sender to encrypt his/her secret and simultaneously distribute decryption information of the encrypted secret among distant parties where decryption shares are nonlocally correlated with each other. Two-fold quantum non-local correlations, generated through entanglement swapping and then teleporting quantum states over swapped maximally entangled pairs, guarantee both authentication and secrecy of the…
Two fault tolerant authenticated quantum dialogue (AQD) protocols are proposed in this paper by employing logical Bell states as the quantum resource, which combat the collective-dephasing noise and the collective-rotation noise, respectively. The two proposed protocols each can accomplish the mutual identity authentication and the dialogue between two participants simultaneously and securely over one kind of collective noise channels. In each of two proposed protocols, the information transmitted through the classical channel is assumed to be eavesdroppable and modifiable. The key for choosin…
We investigate how a classical private key can be used by two players, connected by an insecure one-way quantum channel, to perform private communication of quantum information. In particular we show that in order to transmit n qubits privately, 2n bits of shared private key are necessary and sufficient. This result may be viewed as the quantum analogue of the classical one-time pad encryption scheme. From the point of view of the eavesdropper, this encryption process can be seen as a randomization of the original state. We thus also obtain strict bounds on the amount of entropy necessary for …
Encryption schemes often derive their power from the properties of the underlying algebra on the symbols used. Inspired by group theoretic tools, we use the centralizer of a subgroup of operations to present a private-key quantum homomorphic encryption scheme that enables a broad class of quantum computation on encrypted data. A particular instance of our encoding hides up to a constant fraction of the information encrypted. This fraction can be made arbitrarily close to unity with overhead scaling only polynomially in the message length. This highlights the potential of our protocol to hide a…
In this paper, a novel information leakage resistant quantum dialogue (QD) protocol with single photons in both polarization and spatial-mode degrees of freedom is proposed, which utilizes quantum encryption technology to overcome the information leakage problem. In the proposed QD protocol, during the transmission process, the single photons in both polarization and spatial-mode degrees of freedom used for encoding two communicants' private classical bits are protected by both quantum encryption technology and decoy photon technology. For avoiding the information leakage problem, the initial …
Quantum-mechanical devices have the potential to transform cryptography. Most research in this area has focused either on the information-theoretic advantages of quantum protocols or on the security of classical cryptographic schemes against quantum attacks. In this work, we initiate the study of another relevant topic: the encryption of quantum data in the computational setting. In this direction, we establish quantum versions of several fundamental classical results. First, we develop natural definitions for private-key and public-key encryption schemes for quantum data. We then define notio…
How to solve the information leakage problem has become the research focus of quantum dialogue. In this paper, in order to overcome the information leakage problem in quantum dialogue, a novel approach for sharing the initial quantum state privately between communicators, i.e., quantum encryption sharing, is proposed by utilizing the idea of quantum encryption. The proposed protocol uses EPR pairs as the private quantum key to encrypt and decrypt the traveling photons, which can be repeatedly used after rotation. Due to quantum encryption sharing, the public announcement on the state of the in…
Unconditional Unclonable Encryption
针对单比特消息构建无条件信息理论安全的一次性私钥不可克隆加密方案，有高效加解密及小不可克隆区分优势。
Privacy and correctness trade-offs for information-theoretically secure quantum homomorphic encryption
本文为信息论安全的量子同态加密定义了电路隐私，并将量子不经意传输归约到量子同态加密，从而揭示一大类协议（含仅支持Clifford电路的方案）中电路隐私、数据隐私与正确性之间的根本权衡。
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random string, one of them can transmit a quantum state to the other so that an eavesdropper gets little or no information about the state being transmitted. Perfect encryption schemes leak no information at all about the message. Approximate encryption schemes leak a non-zero (though small) amount of information but require a shorter shared random key. Approximate schemes with short keys have been shown to have a number of …
Quantum delegated and federated learning via quantum homomorphic encryption
本文提出基于量子同态加密的量子委托与联邦学习框架，在保证数据隐私的同时降低通信与客户端计算负担，并证明量子核监督学习的加速可延续至隐私委托场景。
Quantum fully homomorphic encryption (QFHE) allows to evaluate quantum circuits on encrypted data. We present a novel QFHE scheme, which extends Pauli one-time pad encryption by relying on the quaternion representation of SU(2). With the scheme, evaluating 1-qubit gates is more efficient, and evaluating general quantum circuits is polynomially improved in asymptotic complexity. Technically, a new encrypted multi-bit control technique is proposed, which allows to perform any 1-qubit gate whose parameters are given in the encrypted form. With this technique, we establish a conversion between the…
We show that computational problem of testing the behaviour of quantum circuits is hard for the class of problems known as QMA that can be verified efficiently with a quantum computer. This result is a generalization of the techniques previously used to prove the hardness of other problem on quantum circuits. We use this result to show the QMA-hardness of a weak version of the problem of detecting the insecurity of a symmetric-key quantum encryption system, or alternately the problem of determining when a quantum channel is not private. We also give a QMA protocol for the problem of detecting …
In this paper we introduce the concept of quantum private channel within the continuous variables framework (CVPQC) and investigate its properties. In terms of CVPQC we naturally define a "maximally" mixed state in phase space together with its explicit construction and show that for increasing number of encryption operations (which sets the length of a shared key between Alice and Bob) the encrypted state is arbitrarily close to the maximally mixed state in the sense of the Hilbert-Schmidt distance. We bring the exact solution for the distance dependence and give also a rough estimate of the …
Pervasive Vulnerability Analysis and Defense for QKD-based Quantum Private Query
本文提出多加密防御方案，针对基于QKD的QPQ协议中存在严重的安全漏洞问题，通过分析隐信息提取和攻击类型，提供理论和技术支持以增强协议的安全性。
Demonstrating Quantum Homomorphic Encryption Through Simulation
本文基于 Broadbent–Jeffery 的 EPR 方案实现开源 Python 模拟工具包，验证通用量子电路上 QHE 的近期可行性及其较低的同态评估额外成本。
Aiming at a ternary quantum logic circuit, four symmetric ternary quantum homomorphic encryption schemes, based on ternary quantum one-time protocol, were presented. First, for a one-qutrit rotation gate, a homomorphic quantum encryption scheme was constructed. Second, in view of the synthesis of a 3x3 general unitary transformation, another one-qutrit quantum homomorphic encryption scheme was proposed. Third, according to the one-qutrit scheme, the two-qutrit quantum homomorphic encryption scheme about GCX(m') gate was constructed and was further generalized to the n-qutrit unitary matrix cas…
Computational Quantum Anamorphic Encryption and Quantum Anamorphic Secret-Sharing
本文提出量子异形加密与秘密共享方案，基于公钥和对称密钥加密，实现多消息和多密钥场景下的安全共享。
We study private quantum channels on a single qubit, which encrypt given set of plaintext states $P$. Specifically, we determine all achievable states $ρ^{(0)}$ (average output of encryption) and for each particular set $P$ we determine the entropy of the key necessary and sufficient to encrypt this set. It turns out that single bit of key is sufficient when the set $P$ is two dimensional. However, the necessary and sufficient entropy of the key in case of three dimensional $P$ varies continuously between 1 and 2 bits depending on the state $ρ^{(0)}$. Finally, we derive private quantum channel…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。