Marta Irene GarcĂa Cid, Dileepsai Bodanapu, Alberto Gatto, Paolo Martelli · 6 authors
A new interactive quantum zero-knowledge protocol for identity authentication implementable in currently available quantum cryptographic devices is proposed and demonstrated. The protocol design involves a verifier and a prover knowing a pre-shared secret, and the acceptance or rejection of the proof is determined by the quantum bit error rate. It has been implemented in modified Quantum Key Distribution devices executing two fundamental cases. In the first case, all players are honest, while in the second case, one of the users is a malicious player. We demonstrate an increase of the quantum bit error rate around 25% in the latter case compared to the case of honesty. The protocol has also been validated for distances from a back-to-back setup to more than 60 km between verifier and prover. The security and robustness of the protocol has been analysed, demonstrating its completeness, soundness and zero-knowledge properties.
Blockchain technology has emerged as a cornerstone of se- cure online activities, leveraging an extensive array of cryp- tographic tools. This paper delves into an extensive survey of the current literature on post-quantum secure digital sig- natures, focusing on those with advanced, exotic features that play pivotal roles in the blockchain ecosystem. These signatures serve essential functions, including account man- agement,enhancing consensus efficiency,enabling scriptless blockchains, and fortifying user privacy. The term "exotic" in this context signifies signatures that transcend conven- tional properties such as unforgeability, introducing novel functionalities that redefine the blockchain landscape. Our exploration centers on several such exotic signatures, in- cluding multi-/aggregate, threshold, adaptor, blind, and ring signatures. These cryptographic innovations not only bolster security but also empower blockchain systems in unprece- dented ways.Within this comprehensive treatment of exotic signatures, we engage in discussions surrounding the pre- vailing challenges and chart promising avenues for future research within the post-quantum realm. As quantum threats loom ever closer, our aim is to catalyze further inquiry, facil- itating the broader accessibility of post-quantum cryptogra- phy. This, in turn, will fortify blockchain systems, preparing them to withstand the impending quantum era while fos- tering innovation and excellence in the field of blockchain security.
Cryptocurrency mining processes always lead to a high energy consumption at considerably high production cost, which is nearly one-third of cryptocurrency (e.g. Bitcoin) price itself. As the core of mining process is based on SHA-256 cryptographic hashing function, by using the alternative quantum computers, hybrid quantum computers or more larger quantum computing devices like quantum annealers, it would be possible to reduce the mining energy consumption with a quantum hardware's low-energy-operation characteristics. Within this work we demonstrated the use of optimized quantum mining facilities which would replace the classical SHA-256 and high energy consuming classical hardware in near future.
This paper delves into the crucial challenge of safeguarding data sensitivity and preventing security breaches, which can result in substantial losses, including significant financial costs and potential loss of lives. Notably, the United States faces the highest financial burden, with data breaches costing approximately USD 5.09 million. With the proliferation of Internet of Things (IoT) devices, enormous volumes of data are collected from diverse sources. However, the inherent limitations in computational power and memory of IoT devices render them susceptible targets for malicious attacks. This study focuses on fortifying the security of multimedia data, encompassing audio, video, and images, obtained from IoT devices. Cutting-edge technologies such as blockchain and quantum cryptography are explored as promising avenues to bolster multimedia security and preserve privacy. Quantum Key Distribution (QKD) emerges as an alternative to classical encryption and key distribution methods, offering heightened data security. Simultaneously, blockchain leverages hash functions to augment the overall security posture. By harnessing the principles of quantum mechanics, QKD facilitates secure key exchange between involved parties for data encryption and decryption. Additionally, the paper introduces innovative methodologies to enhance the security, privacy, and anonymity of IoT devices.
We show the following unconditional results on quantum commitments in two related yet different models: 1. We revisit the notion of quantum auxiliary-input commitments introduced by Chailloux, Kerenidis, and Rosgen (Comput. Complex. 2016) where both the committer and receiver take the same quantum state, which is determined by the security parameter, as quantum auxiliary inputs. We show that computationally-hiding and statistically-binding quantum auxiliary-input commitments exist unconditionally, i.e., without relying on any unproven assumption, while Chailloux et al. assumed a complexity-theoretic assumption, ${\bf QIP}\not\subseteq{\bf QMA}$. On the other hand, we observe that achieving both statistical hiding and statistical binding at the same time is impossible even in the quantum auxiliary-input setting. To the best of our knowledge, this is the first example of unconditionally proving computational security of any form of (classical or quantum) commitments for which statistical security is impossible. As intermediate steps toward our construction, we introduce and unconditionally construct post-quantum sparse pseudorandom distributions and quantum auxiliary-input EFI pairs which may be of independent interest. 2. We introduce a new model which we call the common reference quantum state (CRQS) model where both the committer and receiver take the same quantum state that is randomly sampled by an efficient setup algorithm. We unconditionally prove that there exist statistically hiding and statistically binding commitments in the CRQS model, circumventing the impossibility in the plain model. We also discuss their applications to zero-knowledge proofs, oblivious transfers, and multi-party computations.
Blockchain technology finds widespread application across various fields due to its key features such as immutability, reduced costs, decentralization, and transparency. The security of blockchain relies on elements like hashing, digital signatures, and cryptography. However, the emergence of quantum computers and supporting algorithms poses a threat to blockchain security. These quantum algorithms pose a significant threat to both public-key cryptography and hash functions, compelling the redesign of blockchain architectures. This paper investigates the status quo of the post-quantum, quantum-safe, or quantum-resistant cryptosystems within the framework of blockchain. This study starts with a fundamental overview of both blockchain and quantum computing, examining their reciprocal influence and evolution. Subsequently, a comprehensive literature review is conducted focusing on Post-Quantum Distributed Ledger Technology (PQDLT). This research emphasizes the practical implementation of these protocols and algorithms providing extensive comparisons of characteristics and performance. This work will help to foster further research at the intersection of post-quantum cryptography and blockchain systems and give prospective directions for future PQDLT researchers and developers.
Rakesh Saini, Abhiprada Bera, Bikash K. Behera, Emad A. Ahmed · 6 authors
The sixth-generation (6G) network utilizes state-of-the-art machine learning technology and obtains high attention, while the fifth-generation (5G) industry is still developing globally. Unfortunately, 6G encounters challenges to achieve performance superiority, such as scalability, massive connection, integrity, and trust. As a result, future network technologies are migrating away from centralized management entities and toward decentralized and distributed ledger technology, such as blockchain. However, the security of the blockchain is based on the computational complexity of solving specific mathematical problems that are impossible to solve on existing computers in real-time. On the other hand, quantum computers can effortlessly translate such problems with easy decryption. As a result, this study presents an architecture demonstrating the integration of quantum blockchain (QBC) with 6G networks. To show the quantum advantage, highly entangled/secured QBC of 5-, 6-, and 7-qubits are used to create the above systemâs quantum circuits. After circuit optimization, mitigation is executed with the efficiency analysis to show the advantage of the error mitigation approach in recreating the state of the QBC circuit and executing on quantum hardware. Furthermore, quantum algorithms of blockchain smart provenience contracts for the cloud-centric Internet of Things (IoT) are proposed, and corresponding quantum circuits are designed. The possible outcomes from these circuits based on the input transaction information are verified.
John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen
We prove a tight parallel repetition theorem for $3$-message computationally-secure quantum interactive protocols between an efficient challenger and an efficient adversary. We also prove under plausible assumptions that the security of $4$-message computationally secure protocols does not generally decrease under parallel repetition. These mirror the classical results of Bellare, Impagliazzo, and Naor [BIN97]. Finally, we prove that all quantum argument systems can be generically compiled to an equivalent $3$-message argument system, mirroring the transformation for quantum proof systems [KW00, KKMV07]. As immediate applications, we show how to derive hardness amplification theorems for quantum bit commitment schemes (answering a question of Yan [Yan22]), EFI pairs (answering a question of Brakerski, Canetti, and Qian [BCQ23]), public-key quantum money schemes (answering a question of Aaronson and Christiano [AC13]), and quantum zero-knowledge argument systems. We also derive an XOR lemma [Yao82] for quantum predicates as a corollary.
Blockchains have gained substantial attention from academia and industry for their ability to facilitate decentralized trust and communications. However, the rapid progress of quantum computing poses a significant threat to the security of existing blockchain technologies. Notably, the emergence of Shor's and Grover's algorithms raises concerns regarding the compromise of the cryptographic systems underlying blockchains. Consequently, it is essential to develop methods that reinforce blockchain technology against quantum attacks. In response to this challenge, two distinct approaches have been proposed. The first approach involves post-quantum blockchains, which aim to utilize classical cryptographic algorithms resilient to quantum attacks. The second approach explores quantum blockchains, which leverage the power of quantum computers and networks to rebuild the foundations of blockchains. This paper aims to provide a comprehensive overview and comparison of post-quantum and quantum blockchains while exploring open questions and remaining challenges in these domains. It offers an in-depth introduction, examines differences in blockchain structure, security, privacy, and other key factors, and concludes by discussing current research trends.
Summary Secure twoâparty computation allows a pair of parties to compute a function together while keeping their inputs private. Ultimately, each party receives only its own correct output. In this paper, a postâquantum secure twoâparty computation protocol is proposed that can be used to effectively block malicious parties. The protocol solves the problems of traditional protocols based on garbled circuits, which are vulnerable to quantum attacks, high communication costs and low computational efficiency. The input garbled keys of the circuit constructor is structured as a Learning with Error (LWE) equation, enabling the circuit constructor to employ a zeroâknowledge proof that demonstrates the uniformity of inputs across all circuits.In the key transfer phase, an LWEâbased batch singleâchoice cutâandâchoose oblivious transfer is proposed to avoid selective failure attacks. In addition, the protocol employs a penalty mechanism to detect if the circuit constructor has generated an incorrect circuit. We have compared the communication overhead of this protocol with three other secure twoâparty computation protocols based on CutâandâChoose technology. The analytical results show that this protocol has the best error probability and is resilient to quantum attacks under the malicious adversary model. In addition, with appropriate parameters, the protocol is able to reduce its communication bandwidth by an average of 40.41%.
P. Thanalakshmi, A. Rishikhesh, Joel Marion Marceline, Gyanendra Prasad Joshi · 5 authors
Blockchain transactions are decentralized, secure, and transparent, and they have altered industries. However, the emergence of quantum computing presents a severe security risk to the traditional encryption algorithms used in blockchain. Post-quantum signatures are required to preserve integrity and reliability. Furthermore, combining the InterPlanetary File System (IPFS) with blockchain provides a long-term strategy for data storage and sharing. This study investigates the integration of post-quantum signatures with the IPFS in a blockchain system, which can considerably enhance blockchain system efficiency. We increase security and efficiency by recording hash values of signatures and public keys within the blockchain and storing their actual content using the IPFS. The study compares NIST-recommended post-quantum signatures with the ECDSA in a Bitcoin exchange scheme to show how effective the system is in countering quantum threats while maintaining optimal performance. This research makes an important addition to the long-term viability and dependability of blockchain technology in the face of the growing landscape of quantum computing breakthroughs.
Quantum computers pose a significant threat to blockchain technology's security, which heavily relies on public-key cryptography and hash functions. The cryptographic algorithms used in blockchains, based on large odd prime numbers and discrete logarithms, can be easily compromised by quantum computing algorithms like Shor's algorithm and its future qubit variations. This survey paper comprehensively examines the impact of quantum computers on blockchain security and explores potential mitigation strategies. We begin by surveying the existing literature on blockchains and quantum computing, providing insights into the current state of research. We then present an overview of blockchain, highlighting its key components and functionalities. We delve into the preliminaries and key definitions of quantum computing, establishing a foundation for understanding the implications on blockchain security. The application of blockchains in cybersecurity is explored, considering their strengths and vulnerabilities in light of evolving quantum computing capabilities. The survey focuses on the quantum security of blockchain's fundamental building blocks, including digital signatures, hash functions, consensus algorithms, and smart contracts. We analyze the vulnerabilities introduced by quantum computers and discuss potential countermeasures and enhancements to ensure the integrity and confidentiality of blockchain systems. Furthermore, we investigate the quantum attack surface of blockchains, identifying potential avenues for exploiting quantum computing to strengthen existing attacks. We emphasize the need for developing quantum-resistant defenses and explore solutions for mitigating the threat of quantum computers to blockchains, including the adoption of quantum and post-quantum blockchain architectures. By examining vulnerabilities and discussing mitigation strategies, we aim to guide researchers, practitioners, and policymakers in developing robust and secure blockchain systems capable of withstanding advancements in quantum computing technology.
Rabimba Karanjai, Sangwon Shin, Xiong, and Wujie, Xinxin Fan · 11 authors
Cryptographic schemes like Fully Homomorphic Encryption (FHE) and Zero-Knowledge Proofs (ZKPs), while offering powerful privacy-preserving capabilities, are often hindered by their computational complexity. Polynomial multiplication, a core operation in these schemes, is a major performance bottleneck. While algorithmic advancements and specialized hardware like GPUs and FPGAs have shown promise in accelerating these computations, the recent surge in AI accelerators (TPUs/NPUs) presents a new opportunity. This paper explores the potential of leveraging TPUs/NPUs to accelerate polynomial multiplication, thereby enhancing the performance of FHE and ZKP schemes. We present techniques to adapt polynomial multiplication to these AI-centric architectures and provide a preliminary evaluation of their effectiveness. We also discuss current limitations and outline future directions for further performance improvements, paving the way for wider adoption of advanced cryptographic tools.
John Bostanci, Yuval Efron, Tony Metger, Alexander Poremba · 6 authors
State transformation problems such as compressing quantum information or breaking quantum commitments are fundamental quantum tasks. However, their computational difficulty cannot easily be characterized using traditional complexity theory, which focuses on tasks with classical inputs and outputs. To study the complexity of such state transformation tasks, we introduce a framework for unitary synthesis problems, including notions of reductions and unitary complexity classes. We use this framework to study the complexity of transforming one entangled state into another via local operations. We formalize this as the Uhlmann Transformation Problem, an algorithmic version of Uhlmann's theorem. Then, we prove structural results relating the complexity of the Uhlmann Transformation Problem, polynomial space quantum computation, and zero knowledge protocols. The Uhlmann Transformation Problem allows us to characterize the complexity of a variety of tasks in quantum information processing, including decoding noisy quantum channels, breaking falsifiable quantum cryptographic assumptions, implementing optimal prover strategies in quantum interactive proofs, and decoding the Hawking radiation of black holes. Our framework for unitary complexity thus provides new avenues for studying the computational complexity of many natural quantum information processing tasks.
We present a simple quantum interactive proof (QIP) protocol using the quantum state teleportation (QST) and quantum energy teleportation (QET) protocols. QET is a technique that allows a receiver at a distance to extract the local energy by local operations and classical communication (LOCC), using the energy injected by the supplier as collateral. QET works for any local Hamiltonian with entanglement and, for our study, it is important that getting the ground state of a generic local Hamiltonian is quantum Merlin Arthur (QMA)-hard. The key motivations behind employing QET for these purposes are clarified. Firstly, in cases where a prover possesses the correct state and executes the appropriate operations, the verifier can effectively validate the presence of negative energy with a high probability (Completeness). Failure to select the appropriate operators or an incorrect state renders the verifier incapable of observing negative energy (Soundness). Importantly, the verifier solely observes a single qubit from the prover's transmitted state, while remaining oblivious to the prover's Hamiltonian and state (Zero-knowledge). Furthermore, the analysis is extended to distributed quantum interactive proofs, where we propose multiple solutions for the verification of each player's measurement. The complexity class of our protocol in the most general case belongs to QIP(3)=PSPACE, hence it provides a secure quantum authentication scheme that can be implemented in small quantum communication devices. It is straightforward to extend our protocol to Quantum Multi-Prover Interactive Proof (QMIP) systems, where the complexity is expected to be more powerful (PSPACE$\subset$QMIP=NEXPTIME). In our case, all provers share the ground state entanglement, hence it should belong to a more powerful complexity class QMIP$^*$.
Abstract The rapid advancement of quantum computing has sparked a considerable increase in research attention to quantum technologies. These advances span fundamental theoretical inquiries into quantum information and the exploration of diverse applications arising from this evolving quantum computing paradigm. The scope of the related research is notably diverse. This paper consolidates and presents quantum computing research related to the financial sector. The finance applications considered in this study include portfolio optimization, fraud detection, and Monte Carlo methods for derivative pricing and risk calculation. In addition, we provide a comprehensive analysis of quantum computingâs applications and effects on blockchain technologies, particularly in relation to cryptocurrencies, which are central to financial technology research. As discussed in this study, quantum computing applications in finance are based on fundamental quantum physics principles and key quantum algorithms. This review aims to bridge the research gap between quantum computing and finance. We adopt a two-fold methodology, involving an analysis of quantum algorithms , followed by a discussion of their applications in specific financial contexts. Our study is based on an extensive review of online academic databases, search tools, online journal repositories, and whitepapers from 1952 to 2023, including CiteSeerX, DBLP, ResearchGate, Semantic Scholar, and scientific conference publications. We present state-of-the-art findings at the intersection of finance and quantum technology and highlight open research questions that will be valuable for industry practitioners and academicians as they shape future research agendas.
Blockchain is becoming increasingly popular in the business and academic communities because it can provide security for a wide range of applications. Therefore, researchers have been motivated to exploit blockchain characteristics, such as data immutability, transparency, and resistance to single-point failures in the Internet of Things (IoT), to increase the security of the IoT ecosystem. However, many existing blockchains rely on classical cryptosystems such as the Elliptic Curve Digital Signature Algorithm (ECDSA) and SHA-256 to validate transactions, which will be compromised by Shor and Groverâs algorithms running on quantum computers in the foreseeable future. Post-Quantum Cryptosystems (PQC) are an innovative solution for resisting quantum attacks that can be applied to blockchains, resulting in the creation of a new type of blockchain known as Post-Quantum Blockchains (PQB). In this survey, we will look at the different types of PQC and their recent standard primitives to determine whether they can enable security for blockchain-based IoT applications. It also briefly introduces blockchain and outlines recent blockchain-IoT application proposals. To the best of our knowledge, this is the first study to examine how post-quantum blockchains are being developed and how they can be used to create security mechanisms for different IoT applications. Finally, this study explores the main challenges and potential research directions that arise from integrating quantum-resistance blockchains into IoT ecosystems.
Ang Liu, XiuâBo Chen, Shengwei Xu, Zhuo Wang · 8 authors
Blockchain technology affords data integrity protection and building trust mechanisms in transactions for distributed networks, and, therefore, is seen as a promising revolutionary information technology. At the same time, the ongoing breakthrough in quantum computation technology contributes toward large-scale quantum computers, which might attack classic cryptography, seriously threatening the classic cryptography security currently employed in the blockchain. As a better alternative, a quantum blockchain has high expectations of being immune to quantum computing attacks perpetrated by quantum adversaries. Although several works have been presented, the problems of impracticality and inefficiency in quantum blockchain systems remain prominent and need to be addressed. First, this paper develops a quantum-secure blockchain (QSB) scheme by introducing a consensus mechanism-quantum proof of authority (QPoA) and an identity-based quantum signature (IQS)-wherein QPoA is used for new block generation and IQS is used for transaction signing and verification. Second, QPoA is developed by adopting a quantum voting protocol to achieve secure and efficient decentralization for the blockchain system, and a quantum random number generator (QRNG) is deployed for randomized leader node election to protect the blockchain system from centralized attacks like distributed denial of service (DDoS). Compared to previous work, our scheme is more practical and efficient without sacrificing security, greatly contributing to better addressing the challenges in the quantum era. Extensive security analysis demonstrates that our scheme provides better protection against quantum computing attacks than classic blockchains. Overall, our scheme presents a feasible solution for blockchain systems against quantum computing attacks through a quantum strategy, contributing toward quantum-secured blockchain in the quantum era.
Blockchain systems are cryptographically composed of blocks that hold the information of successive important transactions. The basic security of this information must be provided by the blockchain system used. Blockchains use existing cryptographic systems with proven security. But with quantum computing, many of these encryption systems are rendered ineffective. Cryptographic methods are being developed to provide post-quantum basic security. To compensate for this handicap, in the literature, schemes are designed to ensure the security of the blockchain even after quantum. In this paper, a systematic survey of recently proposed quantum-resistant blockchain structures designed for different platforms and scenarios is presented. The studies examined are given in comparison with the table and analyzed according to the handled problem, used method, and obtained results. Besides, open problems noticed are listed for future directions.
Abstract In recent years, blockchain technology has emerged as a powerful solution to address various concerns related to data transfer over distributed networks, such as privacy, transparency, redundancy, and accountability. Its ability to offer decentralized trust, secure data usage, and efficient functioning has led to its successful implementation in critical areas like finance, e-governance, defense, academia, research, reputation systems, and smart manufacturing. Blockchain is a unique type of distributed ledger that relies on hash functions and public-key cryptography to store information in blocks protected by hash signatures, which are resistant to security breaches. However, the emergence of quantum computing and its ability to solve knapsack problems in real-time through Groverâs and Shorâs algorithms has raised concerns about the future of classical key cryptography. It is feared that post-quantum computers may be able to modify the hash signature and compromise the blockchain security. To address this issue, there is an urgent need to develop a blockchain cryptosystem that is resilient towards potential eavesdropping in the post-quantum age. This paper aims to explore the possibilities of developing such a futuristic post-quantum information security system while examining the promises and perils of blockchain technology. The study includes a comparative analysis of public-key post-quantum cryptosystems and signing algorithms to formulate future research directions in this field.
Most currently used cryptographic tools for protecting data are based on certain computational assumptions, which makes them vulnerable with respect to technological and algorithmic developments, such as quantum computing. One existing option to counter this potential threat is quantum key distribution, whose security is based on the laws of quantum physics. Quantum key distribution is secure against unforeseen technological developments. A second approach is post-quantum cryptography, which is a set of cryptographic primitives that are believed to be secure even against attacks with both classical and quantum computing technologies. From this perspective, this study reviews recent progress in the deployment of the quantum-secured infrastructure based on quantum key distribution, post-quantum cryptography, and their combinations. Various directions in the further development of the full-stack quantum-secured infrastructure are also indicated. Distributed applications, such as blockchains and distributed ledgers, are also discussed.
Given that reliable cloud quantum computers are becoming closer to reality, the concept of delegation of quantum computations and its verifiability is of central interest. Many models have been proposed, each with specific strengths and weaknesses. Here, we put forth a new model where the client trusts only its classical processing, makes no computational assumptions, and interacts with a quantum server in a single round. In addition, during a set-up phase, the client specifies the size $n$ of the computation and receives an untrusted, off-the-shelf (OTS) quantum device that is used to report the outcome of a single measurement. We show how to delegate polynomial-time quantum computations in the OTS model. This also yields an interactive proof system for all of QMA, which, furthermore, we show can be accomplished in statistical zero-knowledge. This provides the first relativistic (one-round), two-prover zero-knowledge proof system for QMA. As a proof approach, we provide a new self-test for n EPR pairs using only constant-sized Pauli measurements, and show how it provides a new avenue for the use of simulatable codes for local Hamiltonian verification. Along the way, we also provide an enhanced version of a well-known stability result due to Gowers and Hatami and show how it completes a common argument used in self-testing.