Won Young Hwang, In Gyu Koh, Yeong Deok Han
This paper provides a simple variation of the basic ideas of the BB84 quantum cryptographic scheme leading to a method of key expansion. A secure random sequence (the bases sequence) determines the encoding bases in a proposed scheme. Using the bases sequence repeatedly is proven to be safe by quantum mechanical laws.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We give a Shor-Preskill type security-proof to the quantum key distribution without public announcement of bases [W.Y. Hwang et al., Phys. Lett. A 244, 489 (1998)]. First, we modify the Lo-Chau protocol once more so that it finally reduces to the quantum key distribution without public announcement of bases. Then we show how we can estimate the error rate in the code bits based on that in the checked bits in the proposed protocol, that is the central point of the proof. We discuss the problem of imperfect sources and that of large deviation in the error rate distributions. We discuss when the …
The quantum key distribution protocol without public announcement of bases is equipped with a two-way classical communication symmetric entanglement purification protocol. This modified key distribution protocol is unconditionally secure and has a higher tolerable error rate of 20%, which is higher than previous scheme without public announcement of bases.
It is well known that Shor's quantum algorithm for integer factorization can break down the RSA public-key cryptosystem, which is widely used in many cryptographic applications. Thus, public-key cryptosystems in the quantum computational setting are longed for cryptology. In order to define the security notions of public-key cryptosystems, we have to model the power of the sender, receiver, adversary and channel. While we may consider a setting where quantum computers are available only to adversaries, we generally discuss what are the right security notions for (quantum) public-key cryptosyst…
We discuss cryptographic applications of single-qubit rotations from the perspective of trapdoor one-way functions and public-key encryption. In particular, we present an asymmetric cryptosystem whose security relies on fundamental principles of quantum physics. A quantum public key is used for the encryption of messages while decryption is possible by means of a classical private key only. The trapdoor one-way function underlying the proposed cryptosystem maps integer numbers to quantum states of a qubit and its inversion can be infeasible by virtue of the Holevo's theorem.
Performance of BB84 without decoy states under varying announcement structures
本文研究了不同经典公告结构下BB84、SARG04和NPAB BB84协议在有损和噪声通道中的安全密钥率，分析了它们在不同信道行为下的相对优势。
In August 2015 the cryptographic world was shaken by a sudden and surprising announcement by the US National Security Agency NSA concerning plans to transition to post-quantum algorithms. Since this announcement post-quantum cryptography has become a topic of primary interest for several standardization bodies. The transition from the currently deployed public-key algorithms to post-quantum algorithms has been found to be challenging in many aspects. In particular the problem of evaluating the quantum-bit security of such post-quantum cryptosystems remains vastly open. Of course this question …
We give new arguments in support of \emph{signed quantum key establishment}, where quantum cryptography is used in a public-key infrastructure that provides the required authentication. We also analyze more thoroughly than previous works the benefits that quantum key establishment protocols have over certain classical protocols, motivated in part by the various objections to quantum key establishment that are sometimes raised. Previous knowledge of quantum cryptography on the reader's part is not required for this article, as the definition of "quantum key establishment" that we use is an enti…
We demonstrate that the framework of bounded quantum reference frames has application to building quantum-public-key cryptographic protocols and proving their security. Thus, the framework we introduce can be seen as a public-key analogue of the framework of Bartlett et al. (Phys. Rev. A 70, 032307), where a private shared reference frame is shown to have cryptographic application. The protocol we present in this paper is an identification scheme, which, like a digital signature scheme, is a type of authentication scheme. We prove that our protocol is both reusable and secure under the honest-…
Based on quantum encryption, we present a new idea for quantum public-key cryptography (QPKC) and construct a whole theoretical framework of a QPKC system. We show that the quantum-mechanical nature renders it feasible and reasonable to use symmetric keys in such a scheme, which is quite different from that in conventional public-key cryptography. The security of our scheme is analyzed and some features are discussed. Furthermore, the state-estimation attack to a prior QPKC scheme is demonstrated.
Quantum Covert Communication under Extreme Adversarial Control
本文将 Eurocrypt 2022 提出的强对抗者模型引入量子通信，定义能控制全部经典与量子信道并禁止公钥密码的量子控制器，并给出用户在该极端控制下实现隐蔽通信的方法。
This is a reply to the comment by Yuan et al. [arXiv:1009.6130v1] on our publication [arXiv:1008.4593].
This is a comment on the publication by Yuan et al. [Appl. Phys. Lett. 98, 231104 (2011); arXiv:1106.2675v1 [quant-ph]].
A quantum cryptographic protocol based in public key cryptography combinations and private key cryptography is presented. Unlike the BB84 protocol [1] and its many variants [2,3] two quantum channels are used. The present research does not make reconciliation mechanisms of information to derive the key. A three related system of key distribution are described.
Secret Entanglement, Public Geometry. Quantum Cryptography from a Geometric Perspective
从几何视角提出量子密码学的新方法，利用纠缠分层和几何度量实现信息编码与安全传输。
A large number of quantum location verification protocols have been proposed. All existing protocols in this field are based on symmetric cryptography where verifiers and the prover use the same secret key. The prover obtains secret key from different verifiers, in pieces through public channels, which may result in security compromise. In this paper, we give a formulism to prove information-theoretic position-based quantum cryptography is possible in asymmetric quantum setting. We propose a quantum location verification protocol based on asymmetric quantum cryptographic where two different ke…
Hard Quantum Extrapolations in Quantum Cryptography
本文提出经典→量子外推任务，研究其困难性与量子承诺、量子公钥密码学和量子密钥分发等原语之间的等价或蕴含关系，并进一步提出完全量子类比，为理解量子密码学的最小假设提供新视角。
A new cryptographic tool, anonymous quantum key technique, is introduced that leads to unconditionally secure key distribution and encryption schemes that can be readily implemented experimentally in a realistic environment. If quantum memory is available, the technique would have many features of public-key cryptography; an identification protocol that does not require a shared secret key is provided as an illustration. The possibility is also indicated for obtaining unconditionally secure quantum bit commitment protocols with this technique.
Quantum algorithms can break factoring and discrete logarithm based cryptography and weaken symmetric cryptography and hash functions. In order to estimate the real-world impact of these attacks, apart from tracking the development of fault-tolerant quantum computers it is important to have an estimate of the resources needed to implement these quantum attacks. For attacking symmetric cryptography and hash functions, generic quantum attacks are substantially less powerful than they are for today's public-key cryptography. So security will degrade gradually as quantum computing resources increa…
The communication protocol of Home and Whitaker [Phys. Rev. A 67, 022306 (2003)] is examined in some detail, and found to work equally well using a separable state. The protocol is in fact completely classical, based on simple post-selection of suitable experimental runs. The quantum cryptography protocol proposed in the same publication is also examined, and is found to indeed need quantum properties for the system to be secure. However, the security test proposed in the mentioned paper is found to be insufficient, and a modification is proposed here that will ensure security.
When elementary quantum systems, such as polarized photons, are used to transmit digital information, the uncertainty principle gives rise to novel cryptographic phenomena unachievable with traditional transmission media, e.g. a communications channel on which it is impossible in principle to eavesdrop without a high probability of disturbing the transmission in such a way as to be detected. Such a quantum channel can be used in conjunction with ordinary insecure classical channels to distribute random key information between two users with the assurance that it remains unknown to anyone else,…
In the next years the data transmission connections will constitute one of the principal tools of communication among cities, enterprises and public administration. With their enhanced connectivity, the systems and nets of information are now exposed to an increased vulnerability and new safety problems are emerging. Insofar Quantum Key Distribution (QKD) has matured to real world applications and can enhance the safety of the communication nets. In this paper we present the QKD network designed and implemented by Selex-SI and we give an overview of the obtained results.
Performance of Practical Quantum Oblivious Key Distribution
本研究提出一种基于对称密码学的实用量子盲目传输方案，展示了其在安全性和性能上的优势，相较于现有基于噪声存储模型和公钥密码学的解决方案。
All incoherent as well as 2- and 3-qubit coherent eavesdropping strategies on the 6 state protocol of quantum cryptography are classified. For a disturbance of 1/6, the optimal incoherent eavesdropping strategy reduces to the universal quantum cloning machine. Coherent eavesdropping cannot increase Eve's Shannon information, neither on the entire string of bits, nor on the set of bits received undisturbed by Bob. However, coherent eavesdropping can increase as well Eve's Renyi information as her probability of guessing correctly all bits. The case that Eve delays the measurement of her probe u…
Quantum Arithmetic Circuits in Public-Key Cryptography
介绍公钥密码学中量子算术电路，阐述其面临的设计挑战，强调基于测量的反计算等优化策略，回顾基本算术运算的最新设计及量子密码分析中容错运行时和资源估计技术，为评估量子密码分析能力提供基础。
The field of quantum information is becoming more known to the general public. However, effectively demonstrating the concepts underneath quantum science and technology to the general public can be a challenging job. We investigate, extend, and much expand here "quantum candies" (invented by Jacobs), a pedagogical model for intuitively describing some basic concepts in quantum information, including quantum bits, complementarity, the no-cloning principle, and entanglement. Following Jacob's quantum candies description of the well known quantum key distribution protocol BB84, we explicitly demo…
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments
本文利用检测正交态干涉与交换态等难的结果，构造首个基于非阿贝尔群作用的量子密文公钥加密方案，并提出仅调用一次基础方案即可翻转量子比特承诺隐藏与绑定性质的编译器。
Lectures on classical and quantum cryptography. Contents: Private key cryptosystems. Elements of number theory. Public key cryptography and RSA cryptosystem. Shannon`s entropy and mutual information. Entropic uncertainty relations. The no cloning theorem. The BB84 quantum cryptographic protocol. Security proofs. Bell`s theorem. The EPRBE quantum cryptographic protocol.
Post-quantum cryptography is inevitable. National Institute of Standards and Technology (NIST) starts standardizing quantum-resistant public-key cryptography (aka post-quantum cryptography). The reason is that investment in quantum computing is blooming which poses significant threats to our currently deployed cryptographic algorithms. As a security engineer, to prepare for the apocalypse in advance, I've been watching the development of quantum computers and post-quantum cryptography closely. Never mind, I simply made up an excuse to study these fascinating scientific fields. However, they ar…
Towards post-quantum blockchain: A review on blockchain cryptography resistant to quantum computing attacks
该综述研究后量子密码系统及其在区块链与分布式账本技术中的应用，分析代表性后量子区块链系统的挑战，对比主流后量子公钥加密和数字签名方案的特性与性能，为相关研究者和开发者提供后量子区块链安全的全面视角与指导。
By resorting to basic features of topological knot theory we propose a (classical) cryptographic protocol based on the `difficulty' of decomposing complex knots generated as connected sums of prime knots and their mutants. The scheme combines an asymmetric public key protocol with symmetric private ones and is intrinsecally secure against quantum eavesdropper attacks.
QPP and HPPK: Unifying Non-Commutativity for Quantum-Secure Cryptography with Galois Permutation Group
本文提出统一框架，结合QPP与HPPK，利用伽罗瓦置换群的非交换性，实现量子安全的对称加密、密钥封装与数字签名，具有紧凑尺寸和高效性能。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。