Mark Hillery, Mario Ziman, Vladimir Buzek, Martina Bielikova
The privacy of communicating participants is often of paramount importance, but in some situations it is an essential condition. A typical example is a fair (secret) voting. We analyze in detail communication privacy based on quantum resources, and we propose new quantum protocols. Possible generalizations that would lead to voting schemes are discussed.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We present a number of schemes that use quantum mechanics to preserve privacy, in particular, we show that entangled quantum states can be useful in maintaining privacy. We further develop our original proposal [see Phys. Lett. A 349, 75 (2006)] for protecting privacy in voting, and examine its security under certain types of attacks, in particular dishonest voters and external eavesdroppers. A variation of these quantum-based schemes can be used for multi-party function evaluation. We consider functions corresponding to group multiplication of $N$ group elements, with each element chosen by a…
Experimental Quantum Electronic Voting
本研究提出了一种无需选举机构的信息论安全电子投票协议，通过量子态特性实现了高效安全的投票机制，适用于多种选举场景。
Anonymous voting is a voting method of hiding the link between a vote and a voter, the context of which ranges from governmental elections to decision making in small groups like councils or companies. In this paper, we propose a quantum anonymous voting protocol assisted by two kinds of entangled quantum states. Particularly, we provide a mechanism of opening and permuting the ordered votes of all the voters in an anonymous manner; any party, who is interested in the voting results, can acquire a permutation copy, and then obtains the voting result through simple calculation. Unlike all previ…
Quantum voting machine encoded with microwave photons
本文提出了一种基于微波光子量子比特编码的量子投票机，利用多控单靶量子相位门实现单步操作与可验证性，并保障投票者匿名性，数值模拟验证了其在当前量子技术下的可行性。
We propose a quantum voting system, in the spirit of quantum games such as the quantum Prisoner's Dilemma. Our scheme enables a constitution to violate a quantum analog of Arrow's Impossibility Theorem. Arrow's Theorem is a claim proved deductively in economics: Every (classical) constitution endowed with three innocuous-seeming properties is a dictatorship. We construct quantum analogs of constitutions, of the properties, and of Arrow's Theorem. A quantum version of majority rule, we show, violates this Quantum Arrow Conjecture. Our voting system allows for tactical-voting strategies reliant …
A Quantum Walk-Enabled Blockchain with Weighted Quantum Voting Consensus
本工作提出了一种基于量子行的量子区块链框架，并结合加权量子投票协议的共识机制，以减少对纠缠的依赖，提升系统稳定性、连接效率与公平性，电路仿真验证了其正确性与有效性。
We describe quantum protocols for voting and surveying. A key feature of our schemes is the use of entangled states to ensure that the votes are anonymous and to allow the votes to be tallied. The entanglement is distributed over separated sites; the physical inaccessibility of any one site is sufficient to guarantee the anonymity of the votes. The security of these protocols with respect to various kinds of attack is discussed. We also discuss classical schemes and show that our quantum voting protocol represents a N-fold reduction in computational complexity, where N is the number of voters.
We propose a new protocol for quantum anonymous voting having serious advantages over the existing protocols: it protects both the voters from a curious tallyman and all the participants from a dishonest voter in unconditional way. The central idea of the protocol is that the ballots are given back to the voters after the voting process, which gives a possibility for two voters to check the anonymity of the vote counting process by preparing a special entangled state of two ballots. Any attempt of cheating from the side of the tallyman results in destroying the entanglement, which can be detec…
Quantum secret sharing is a way to share secret messages among the clients in a group with complete security. For the first time, Hillery et al. (Phys Rev A 59:1829, 1999) proposed the quantum version of the classical secret sharing protocol using GHZ states. Here, we implement the above quantum secret sharing protocol in 'IBM Q 5 Tenerife' quantum processor and compare the experimentally obtained results with the theoretically predicted ones. Further, a new quantum binary voting protocol is proposed and implemented in the 14-qubit 'IBM Q 14 Melbourne' quantum processor. The results are analyz…
A self-tallying quantum anonymous voting protocol for multiple-selection elections
本文提出一种支持多选投票的自计票量子匿名投票协议，利用纠缠态分组与测量编码实现多选功能，并满足自计票、不可重用、可验证和公平性。
Electronic voting is a very useful but challenging internet-based protocol that despite many theoretical approaches and various implementations with different degrees of success, remains a contentious topic due to issues in reliability and security. Here we present a quantum protocol that exploits an untrusted source of multipartite entanglement to carry out an election without relying on election authorities, simultaneous broadcasting or computational assumptions, and whose result is publicly verifiable. The level of security depends directly on the fidelity of the shared multipartite entangl…
Recently Tian, Zhang and Li (TZL) have proposed a protocol for voting based on controlled quantum teleportation (Int. J. Theor. Phys. DOI 10.1007/s10773-015-2868-8). We have critically analyzed the protocol and have shown that it's neither efficient nor secure. Further, it is shown that in the TZL protocol, the scrutineer Charlie does not have the required control over the voting process. Apart from showing the limitations of TZL protocol, two improved protocols for quantum voting along the line of TZL protocol are proposed here. One of the proposed protocols is designed using a standard schem…
Traditional cryptography is under huge threat along of the evolution of quantum information and computing. In this paper, we propose a new post-quantum voting scheme based on physical laws by using encrypted no-key protocol to transmit message in the channel, which ensures the post-quantum security. Unlike lattice-based and multivariate-based electronic voting schemes, whose security is based on the computational problems assumption that has not been solved by effective quantum algorithms until now, the security of the voting scheme based on the physical laws is depended on inherent limitation…
Voting is a game with a no-go theorem. New proofs of Arrow's impossibility theorem are given based on quantum information theory. We show that the Arrowian dictator is equivalent to the perfect cloning circuit. We present \textit{Gedankenexperiment} of voting and Bell-like inequalities of voting. We provide the thermodynamic interpretation of voting with Landauer's principle.
In an electronic voting protocol, a distributed scheme can be used for forbidding the malicious acts of the voting administrator and the counter during the election, but it cannot prevent them from collaborating to trace the ballots and destroy their privacy after the election. We present a distributed anonymous quantum key distribution scheme and further construct a distributed quantum election scheme with a voting administrator made up of more than one part. This quantum election scheme can resist the malicious acts of the voting administrator and the counter after the election and can work …
This paper proposes a simple voting protocol based on quantum blockchain. Besides being simple, our voting protocol is anonymous, binding, non-reusable, verifiable, eligible, fair and self-tallying. Our protocol is also realizable by the current technology.
Experimental quantum voting using photonic GHZ states
本研究通过光子GHZ态实现了一种量子投票实验，确保选民隐私并验证选举结果的可靠性。
Voting forms the most important tool for arriving at a decision in any institution. The changing needs of the civilization currently demands a practical yet secure electronic voting system, but any flaw related to the applied voting technology can lead to tampering of the results with the malicious outcomes. Currently, blockchain technology due to its transparent structure forms an emerging area of investigation for the development of voting systems with a far greater security. However, various apprehensions are yet to be conclusively resolved before using blockchain in high stakes elections. …
Quantum Voting and Violation of Gibbard-Satterthwaite's Impossibility Theorem
本研究扩展量子孔多塞投票，通过引入量子真实性等概念，在量子环境中违反吉巴德-萨特斯韦特不可能性定理。
Accelerating Voting by Quantum Computation
该研究提出可适用于任意匿名投票规则的量子加速投票算法，在多种常见投票规则下速度较经典有放回采样算法快二次方级，理论结果经多类投票规则实验验证。
Quantum Classification through Tournament Voting for Robust Single-Shot Inference
针对量子机器学习中多类分类存在的问题，提出基于循环锦标赛评分的决策聚合框架，提高单次预测的可分辨性与准确性，在固定测量次数下实现高精度和可解释性，为量子分类器发展提供新方向。
Recent advances indicate that quantum computers will soon be reality. Motivated by this ever more realistic threat for existing classical cryptographic protocols, researchers have developed several schemes to resist "quantum attacks". In particular, for electronic voting, several e-voting schemes relying on properties of quantum mechanics have been proposed. However, each of these proposals comes with a different and often not well-articulated corruption model, has different objectives, and is accompanied by security claims which are never formalized and are at best justified only against spec…
Quantum-Enhanced Secure Approval Voting Protocol
本文提出一种融合量子原理、区块链与数字签名的量子投票协议，仅需$\log_2{n}$个量子比特支持n名候选人的赞成投票，并在IBM量子硬件上实现1.17%的低错误率，具备多项安全特性。
Online Voting using Point to MultiPoint Quantum Key Distribution
本文提出利用时分复用和波分复用的点对多点量子密钥分发技术提升在线投票系统的安全性。
Are Quantum Voting Protocols Practical?
本文探讨量子投票协议的实用性，分析其数学基础、系统模型及实现挑战，提出小规模选举的现实部署方案。
Anonymous Public-Key Quantum Money and Quantum Voting
本文提出首个满足隐私定义的公钥量子货币方案，并利用不可克隆原理构建量子投票方案，同时引入强正确性公开可重随机化加密工具。
A Quantum-Secure Voting Framework Using QKD, Dual-Key Symmetric Encryption, and Verifiable Receipts
本文提出融合 QKD、双密钥对称加密与可验证收据的量子安全投票框架，并通过 MQTT 模拟量子与经典信道，验证其低延迟、低错误率的高效大规模投票处理能力。
A Blockchain-based Quantum Binary Voting for Decentralized IoT Towards Industry 5.0
针对工业5.0中物联网易受攻击的问题，提出基于区块链的量子二元投票算法，利用后量子密码和量子通信实现安全共识，并在IBM Quantum上验证。
Quantum Voting Protocol for Centralized and Distributed Voting Based on Phase-Flip Counting
本文提出一种利用叠加和纠缠实现安全匿名投票的量子投票协议，通过相位翻转操作编码选票，利用量子测量直接统计结果，验证了其在集中式和分布式环境中的效率与安全性。
Due to the immense potential of quantum computers and the significant computing overhead required in machine learning applications, the variational quantum classifier (VQC) has received a lot of interest recently for image classification. The performance of VQC is jeopardized by the noise in Noisy Intermediate-Scale Quantum (NISQ) computers, which is a significant hurdle. It is crucial to remember that large error rates occur in quantum algorithms due to quantum decoherence and imprecision of quantum gates. Previous studies have looked towards using ensemble learning in conventional computing …
Quantum Probabilistic Local Differential Privacy: Structural Properties and Sample Complexity Bounds
研究量子概率局部差分隐私，引入其松弛形式，探讨结构特性、与其他形式关系，展示张量积等下的性质，刻画去极化噪声情况，通过曲棍球棒散度联系隐私与统计推断，获量子假设检验样本复杂度界。
Quantum mechanics ensures that the information stored in a quantum state is secure and the ability to send private information through a quantum channel is at least as great as the coherent information. We derive trade-off relations between quantum privacy, information gain by Eve and the disturbance caused by Eve to the quantum state that is being sent through a noisy channel. For tripartite quantum states, we show that monogamy of privacy exists in the case of a single sender and multiple receivers. When Alice prepares a tripartite entangled state and shares it with Bob and Charlie through t…
We derive a simple relation between a quantum channel's capacity to convey coherent (quantum) information and its usefulness for quantum cryptography.
Private states are those quantum states from which a perfectly secure cryptographic key can be extracted. They represent the basic unit of quantum privacy. In this work we show that all states belonging to this class violate a Bell inequality. This result establishes a connection between perfect privacy and nonlocality in the quantum domain.
Using quantum mechanics, secure direct communication between distant parties can be performed. Over a noisy quantum channel, quantum privacy amplification is a necessary step to ensure the security of the message. In this paper, we present a quantum privacy amplification scheme for quantum secure direct communication using single photons. The quantum privacy amplification procedure contains two control-not gates and a Hadamard gate. After the unitary gate operations, a measurement is performed and one photon is retained. The retained photon carries the state information of the discarded photon…
Optimal Mechanisms for Quantum Local Differential Privacy
本文研究量子本地差分隐私（QLDP）的最优机制，通过优化参数 $ε$ 平衡隐私与效用，证明量子去极化噪声是单式机制中的最优私有化方法，并通过分析与数值实验探讨不同噪声下的隐私-效用权衡。
This paper studies privacy and secure function evaluation in communication complexity. The focus is on quantum versions of the model and on protocols with only approximate privacy against honest players. We show that the privacy loss (the minimum divulged information) in computing a function can be decreased exponentially by using quantum protocols, while the class of privately computable functions (i.e., those with privacy loss 0) is not enlarged by quantum protocols. Quantum communication combined with small information leakage on the other hand makes certain functions computable (almost) pr…
Differential Privacy Preserving Quantum Computing via Projection Operator Measurements
本文提出利用投影算子测量产生的散粒噪声满足量子差分隐私定义，分析隐私预算并结合退极化噪声，通过数值模拟验证其隐私保护效果。
Quantum state privacy amplification (QSPA) is the quantum analogue of classical privacy amplification. If the state information of a series of single particle states has some leakage, QSPA reduces this leakage by condensing the state information of two particles into the state of one particle. Recursive applications of the operations will eliminate the quantum state information leakage to a required minimum level. In this paper, we report the experimental implementation of a quantum state privacy amplification protocol in a nuclear magnetic resonance system. The density matrices of the states …
Efficient Quantum Voting with Information-Theoretic Security
本研究提出一种基于量子网络的投票方案，利用量子态编码选票实现通信复杂度指数级降低，并借助分布式安全求和实现匿名排队，仅需对数级量子存储，具备信息论安全性和噪声鲁棒性。
We prove direct quantum coding theorem for random quantum codes. The problem is separated into two parts: proof of distinguishability of codewords by receiver, and that of indistinguishability of codewords by environment (privacy). For a large class of codes, only privacy has to be checked.
Privacy in networks of quantum sensors
本文研究量子传感器网络中的隐私问题，通过对量子Fisher信息矩阵的操作分析隐私，找到了估计未知参数线性组合时实现最大隐私的最优态，并引入准隐私概念量化状态接近私密的程度。
We describe how to achieve optimal entanglement generation and one-way entanglement distillation rates by coherent implementation of a class of secret key generation and secret key distillation protocols, respectively. This short paper is a high-level descrioption of our detailed papers [8] and [10].
Privacy amplification is the key step to guarantee the security of quantum communication. The existing security proofs require accumulating a large number of raw key bits for privacy amplification. This is similar to block ciphers in classical cryptography that would delay the final key generation since an entire block must be accumulated before privacy amplification. Moreover, any leftover errors after information reconciliation would corrupt the entire block. By modifying the security proof based on quantum error correction, we develop a stream privacy amplification scheme, which resembles t…
Information geometric quantification of effective privacy in quantum metrology
研究量子计量协议中参数隐私性与可访问性，构建信息几何框架，通过测量量子态在参数空间诱导体积来量化，以扩展 GHZ 态为例，给出基于量子关联、精度及不完美测量与纠缠的标度律。
Privacy amplification is an indispensable step in postprocessing of continuous-variable quantum key distribution (CV-QKD), which is used to distill unconditional secure keys from identical corrected keys between two distant legal parties. The processing speed of privacy amplification has a significant effect on the secret key rate of CV-QKD system. We report the high-speed parallel implementation of length-compatible privacy amplification algorithm based on graphic processing unit. Length-compatible algorithm is used to satisfy the security requirement of privacy amplification at different tra…
We present an approach for performing the tallying work in the coercion-resistant JCJ voting protocol, introduced by Juels, Catalano, and Jakobsson, in linear time using fully homomorphic encryption (FHE). The suggested enhancement also paves the path towards making JCJ quantum-resistant, while leaving the underlying structure of JCJ intact. The exhaustive, comparison-based approach of JCJ using plaintext equivalence tests leads to a quadratic blow-up in the number of votes, which makes the tallying process rather impractical in realistic settings with a large number of voters. We show how the…
Privacy lies at the fundament of quantum mechanics. A coherently transmitted quantum state is inherently private. Remarkably, coherent quantum communication is not a prerequisite for privacy: there are quantum channels that are too noisy to transmit any quantum information reliably that can nevertheless send private classical information. Here, we ask how much private classical information a channel can transmit if it has little quantum capacity. We present a class of channels N_d with input dimension d^2, quantum capacity Q(N_d) <= 1, and private capacity P(N_d) = log d. These channels asympt…
By sending systems in specially prepared quantum states, two parties can communicate without an eavesdropper being able to listen. The technique, called quantum cryptography, enables one to verify that the state of the quantum system has not been tampered with, and thus one can obtain privacy regardless of the power of the eavesdropper. All previous protocols relied on the ability to faithfully send quantum states. In fact, until recently, they could all be reduced to a single protocol where security is ensured though sharing maximally entangled states. Here we show this need not be the case -…
Towards A Hybrid Quantum Differential Privacy
针对现有量子差分隐私仅用单一噪声源、不符合量子系统实际的问题，本文提出结合信道与测量噪声的鲁棒混合QDP机制以平衡隐私与效用，还提出提升型量子差分隐私增强随机性，优化隐私审计与算法评估。
Bridging Quantum Computing and Differential Privacy: Insights into Quantum Computing Privacy
该研究聚焦量子计算的隐私保护问题，梳理量子差分隐私（QDP）的各类实现与隐私参数性能，提出基于随机源来源和算法应用阶段的QDP技术分类体系，探讨挑战与未来方向，为领域研究者提供前沿综述。
Tuning Quantum Computing Privacy through Quantum Error Correction
本文提出利用量子纠错技术调节量子差分隐私的隐私预算，通过决定是否应用QEC操作逐步降低噪声错误率，并推导新公式，数值模拟验证其可行性。
Privacy and correctness trade-offs for information-theoretically secure quantum homomorphic encryption
本文为信息论安全的量子同态加密定义了电路隐私，并将量子不经意传输归约到量子同态加密，从而揭示一大类协议（含仅支持Clifford电路的方案）中电路隐私、数据隐私与正确性之间的根本权衡。
Characterizing Privacy Risks of Quantum Machine Learning with Emergent Quantum-Native Access
本文研究量子原生访问下QML的隐私风险，通过成员推断攻击证明增强量子访问和计算能力可带来理论及实证隐私泄露，揭示现有研究低估了此类风险。
In this work we investigate the asymptotic behavior related to the quantum privacy for multipartite systems. In this context, an inequality for quantum privacy was obtained by exploiting of quantum entropy properties. Subsequently, we derive a lower limit for the quantum privacy through the entanglement fidelity. In particular, we show that there is an interval where an increase in entanglement fidelity implies a decrease in quantum privacy.
Differential Privacy Preserving Distributed Quantum Computing
本文针对量子分布式计算中的隐私泄露问题，提出量子 Rényi 差分隐私（QRDP）概念，通过引入参数 α 实现精细隐私保护，并分析噪声机制、推导最低隐私预算及验证量子参数影响。
Schrödinger's Camera: First Steps Towards a Quantum-Based Privacy Preserving Camera
本文提出了一种基于量子态的隐私保护图像存储方法，并利用双深度Q学习算法实现对图像匿名化的控制，展示了在量子基础上平衡隐私与效用的可行性。
Guaranteeing Privacy in Hybrid Quantum Learning through Theoretical Mechanisms
本文提出HYPER-Q机制，结合经典和量子噪声，通过理论分析提升量子学习模型的隐私保护与效用
Federated Quantum Machine Learning with Differential Privacy
本文首次将量子联邦学习与量子差分隐私结合，在量子平台上实现双重隐私保护，并在猫狗数据集上以超过0.98的准确率和小于1.3的epsilon值验证了其可行性。
Privacy in Distributed Quantum Sensing with Gaussian Quantum Networks
该研究针对高斯量子网络中的分布式量子传感隐私问题，分析了定制多模光子数关联态与全对称高斯态的隐私-精度性能，验证了局域零差检测的最优性，还探讨了热噪声的影响，为实用隐私保护分布式量子传感协议研发奠定基础。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。