Enhancing IoT Security:Quantum-Level Resilience against Threats

The rapid growth of the Internet of Things(IoT)operations has necessitated the incorporation of quantum computing technologies tomeet its expanding needs.This integration ismotivated by the need to solve the specific issues provided by the expansion of IoT and the potential benefits that quantum computing can offer in this scenario.The combination of IoT and quantum computing creates new privacy and security problems.This study examines the critical need to prevent potential security concerns from quantum computing in IoT applications.We investigate the incorporation of quantum computing approaches within IoT security frameworks,with a focus on developing effective security mechanisms.Our research,which uses quantum algorithms and cryptographic protocols,provides a unique solution to protecting sensitive information and assuring the integrity of IoT systems.We rigorously analyze critical quantum computing security properties,building a hierarchical framework for systematic examination.We offer concrete solutions flexible to diverse aswell as ambiguous opinions through using a unified computational model with analytical hierarchy process(AHP)multi-criteria decision-making(MCDM)as the technique for ordering preferences by similarity to ideal solutions(TOPSIS)in a fuzzy environment.This study adds practical benefit by supporting practitioners in recognizing,choosing,and prioritizing essential security factors from the standpoint of quantum computing.Our approach is a critical step towards improving quantum-level security in IoT systems,strengthening their resilience against future threats,and preserving the IoT ecosystem’s long-term prosperity.

Influence of Quantum Information Technology on International Security

Humanity is currently undergoing the fourth industrial revolution,characterized by advancements in artificial intelligence,clean energy,quantum information technology,virtual reality,and biotechnology.This technological revolution is poised to have a profound impact on the world.Quantum information technology encompasses both quantum computing and the transmission of quantum information.This article aims to integrate quantum information technology with international security concerns,exploring its implications for international security and envisioning its groundbreaking significance.

Accelerating Quantum Computing Readiness: Risk Management and Strategies for Sectors

The potential impact of quantum computing on various industries such as finance, healthcare, cryptography, and transportation is significant;therefore, sectors face challenges in understanding where to start because of the complex nature of this technology. Starting early to explore what is supposed to be done is crucial for providing sectors with the necessary knowledge, tools, and processes to keep pace with rapid advancements in quantum computing. This article emphasizes the importance of consultancy and governance solutions that aid sectors in preparing for the quantum computing revolution. The article begins by discussing the reasons why sectors need to be prepared for quantum computing and emphasizes the importance of proactive preparation. It illustrates this point by providing a real-world example of a partnership. Subsequently, the article mentioned the benefits of quantum computing readiness, including increased competitiveness, improved security, and structured data. In addition, this article discusses the steps that various sectors can take to achieve quantum readiness, considering the potential risks and opportunities in industries. The proposed solutions for achieving quantum computing readiness include establishing a quantum computing office, contracting with major quantum computing companies, and learning from quantum computing organizations. This article provides the detailed advantages and disadvantages of each of these steps and emphasizes the need to carefully evaluate their potential drawbacks to ensure that they align with the sector’s unique needs, goals, and available resources. Finally, this article proposes various solutions and recommendations for sectors to achieve quantum-computing readiness.

A Phase Estimation Algorithm for Quantum Speed-Up Multi-Party Computing

Security and privacy issues have attracted the attention of researchers in the field of IoT as the information processing scale grows in sensor networks.Quantum computing,theoretically known as an absolutely secure way to store and transmit information as well as a speed-up way to accelerate local or distributed classical algorithms that are hard to solve with polynomial complexity in computation or communication.In this paper,we focus on the phase estimation method that is crucial to the realization of a general multi-party computing model,which is able to be accelerated by quantum algorithms.A novel multi-party phase estimation algorithm and the related quantum circuit are proposed by using a distributed Oracle operator with iterations.The proved theoretical communication complexity of this algorithm shows it can give the phase estimation before applying multi-party computing efficiently without increasing any additional complexity.Moreover,a practical problem of multi-party dating investigated shows it can make a successful estimation of the number of solution in advance with zero communication complexity by utilizing its special statistic feature.Sufficient simulations present the correctness,validity and efficiency of the proposed estimation method.

A Secure Microgrid Data Storage Strategy with Directed Acyclic Graph Consensus Mechanism

The wide application of intelligent terminals in microgrids has fueled the surge of data amount in recent years.In real-world scenarios,microgrids must store large amounts of data efficiently while also being able to withstand malicious cyberattacks.To meet the high hardware resource requirements,address the vulnerability to network attacks and poor reliability in the tradi-tional centralized data storage schemes,this paper proposes a secure storage management method for microgrid data that considers node trust and directed acyclic graph(DAG)consensus mechanism.Firstly,the microgrid data storage model is designed based on the edge computing technology.The blockchain,deployed on the edge computing server and combined with cloud storage,ensures reliable data storage in the microgrid.Secondly,a blockchain consen-sus algorithm based on directed acyclic graph data structure is then proposed to effectively improve the data storage timeliness and avoid disadvantages in traditional blockchain topology such as long chain construction time and low consensus efficiency.Finally,considering the tolerance differences among the candidate chain-building nodes to network attacks,a hash value update mechanism of blockchain header with node trust identification to ensure data storage security is proposed.Experimental results from the microgrid data storage platform show that the proposed method can achieve a private key update time of less than 5 milliseconds.When the number of blockchain nodes is less than 25,the blockchain construction takes no more than 80 mins,and the data throughput is close to 300 kbps.Compared with the traditional chain-topology-based consensus methods that do not consider node trust,the proposed method has higher efficiency in data storage and better resistance to network attacks.

A Secure Multiparty Quantum Homomorphic Encryption Scheme

The significant advantage of the quantum homomorphic encryption scheme is to ensure the perfect security of quantum private data.In this paper,a novel secure multiparty quantum homomorphic encryption scheme is proposed,which can complete arbitrary quantum computation on the private data of multiple clients without decryption by an almost dishonest server.Firstly,each client obtains a secure encryption key through the measurement device independent quantum key distribution protocol and encrypts the private data by using the encryption operator and key.Secondly,with the help of the almost dishonest server,the non-maximally entangled states are preshared between the client and the server to correct errors in the homomorphic evaluation of T gates,so as to realize universal quantum circuit evaluation on encrypted data.Thirdly,from the perspective of the application scenario of secure multi-party computation,this work is based on the probabilistic quantum homomorphic encryption scheme,allowing multiple parties to delegate the server to perform the secure homomorphic evaluation.The operation and the permission to access the data performed by the client and the server are clearly pointed out.Finally,a concrete security analysis shows that the proposed multiparty quantum homomorphic encryption scheme can securely resist outside and inside attacks.

Quantum Cryptography for Internet of Things Security

Internet of things (IoT) is a developing technology with a lot of scope in the future. It can ease various different tasks for us. On one hand, IoT is useful for us, on the other hand, it has many serious security threats, like data breaches, side-channel attacks, and virus and data authentication. Classical cryptographic algorithms, like the Rivest-Shamir-Adleman (RSA) algorithm, work well under the classical computers. But the technology is slowly shifting towards quantum computing, which has immense processing power and is more than enough to break the current cryptographic algorithms easily. So it is required that we have to design quantum cryptographic algorithms to prevent our systems from security breaches even before quantum computers come in the market for commercial uses. IoT will also be one of the disciplines, which needs to be secured to prevent any malicious activities. In this paper, we review the common security threats in IoT and the presently available solutions with their drawbacks. Then quantum cryptography is introduced with some of its variations. And finally, the analysis has been carried out in terms of the pros and cons of implementing quantum cryptography for IoT security.

A Quantum Mechanical Proof of Insecurity of the Theoretical QKD Protocols

Cryptography is crucial to communication security. In 1984, a well-known QKD (quantum key distribution) protocol, BB84, was published by Bennett and Brassard. The BB84 Protocol was followed by the QKD protocols published by Ekert (1991) (E91) and Bennett (1992) (B92). Some authors proved security of the theoretical QKD protocols in different theoretical frameworks by defining security of QKD protocols differently. My argument is that the previous proofs of security are neither unique nor exhaustive for each theoretical QKD protocol, which means that proof of security of the theoretical QKD protocols has not been completed or achieved. The non-uniqueness and the non-exhaustiveness of the proofs will lead to more proofs. However, a coming “proof” of security of the theoretical QKD protocols is possible to be a disproof. The research by quantum mechanics in this paper disproves security of the theoretical QKD protocols, by establishing the theoretical framework of quantum mechanical proof, defining security of QKD protocols, establishing the quantum state of the final key of the theoretical protocols from their information leakages, and applying Grover’s fast quantum mechanical algorithm for database search to the quantum state of the final key to result in the Insecurity Theorem. This result is opposite to those of the previous proofs where the theoretical QKD protocols were secure. It is impossible for Alice and Bob to protect their communications from information leakage by stopping or canceling the protocols. The theoretical QKD keys are conventional and basically insecure. Disproof of security of the theoretical QKD protocols is logical.

QKD in Cloud-Fog Computing for Personal Health Record

Cloud computing is a rapid growing technology which delivers computing services such as servers,storage,database,networking,software and analytics.It has brought a new way to securely store and share information and data with multiple users.When authorized person access these clouds,the released data should not compromise any individual’s privacy and identity should not be revealed.Fog Computing is the extension of cloud with decentralized structure which stores the data in locations somewhere between the data source and cloud.The goal of fog computing is to provide high security,improve performance and network efficiency.We use quantum key distribution to produce and distribute key which change its quantum state and key,when key is known by mediator and it has ability to detect presence of mediator trying to gain lore of the key.In this paper,we introduced sugar-salt encryption which overcomes brute-force attack in effect delivers phony data in return to every incorrect guess of the password or key.

Robust peer-to-peer learning via secure multi-party computation

To solve the data island problem,federated learning(FL)provides a solution paradigm where each client sends the model parameters but not the data to a server for model aggregation.Peer-to-peer(P2P)federated learning further improves the robustness of the system,in which there is no server and each client communicates directly with the other.For secure aggregation,secure multi-party computing(SMPC)protocols have been utilized in peer-to-peer manner.However,the ideal SMPC protocols could fail when some clients drop out.In this paper,we propose a robust peer-to-peer learning(RP2PL)algorithm via SMPC to resist clients dropping out.We improve the segmentbased SMPC protocol by adding a check and designing the generation method of random segments.In RP2PL,each client aggregates their models by the improved robust secure multi-part computation protocol when finishes the local training.Experimental results demonstrate that the RP2PL paradigm can mitigate clients dropping out with no significant degradation in performance.

量子计算优势对信息安全的影响

经过40多年的发展,量子计算已处在一个从实验室到实际场景的应用阶段,意味着量子技术时代即将来临。量子计算的巨大优势就是其指数级增长的算力,它将为信息技术带来革命性的变化,但也为现有信息安全体系带来挑战。

Nearly universal and efficient quantum secure multi-party computation protocol

Universality is an important property in software and hardware design.This paper concentrates on the universality of quantum secure multi-party computation(SMC)protocol.First of all,an in-depth study of universality has been conducted,and then a nearly universal protocol is proposed by using the Greenberger-Horne-Zeilinger(GHZ)-like state and stabilizer formalism.The protocol can resolve the quantum SMC problem which can be deduced as modulo subtraction,and the steps are simple and effective.Secondly,three quantum SMC protocols based on the proposed universal protocol:Quantum private comparison(QPC)protocol,quantum millionaire(QM)protocol,and quantum multi-party summation(QMS)protocol are presented.These protocols are given as examples to explain universality.Thirdly,analyses of the example protocols are shown.Concretely,the correctness,fairness,and efficiency are confirmed.And the proposed universal protocol meets security from the perspective of preventing inside attacks and outside attacks.Finally,the experimental results of the example protocols on the International Business Machines(IBM)quantum platform are consistent with the theoretical results.Our research indicates that our protocol is universal to a certain degree and easy to perform.

量子安全多方计算协议研究进展

量子安全多方计算是量子信息技术与隐私保护计算技术相结合形成的新兴交叉领域,作为量子密码学的一个重要分支,在安全性、计算效率等方面有着经典安全多方计算所不能及的优点。量子安全多方求和(Quantum Secure Multi-party Summation,QSMS)作为量子安全多方计算的一个最基本运算过程,近年来获得了广泛的关注。本文梳理了近期QSMS协议的研究进展,根据协议所依据的基本原理进行了分类,并介绍了一些代表性协议的基本原理和典型特点。

量子计算在信息安全中的潜在应用与挑战

文中旨在研究量子计算在信息安全中的潜在应用与挑战。通过分析量子计算的潜在应用以及量子计算对传统加密算法的影响,深入探索了量子计算时代的信息安全挑战,具体包括量子计算对云安全的潜在威胁、量子计算对区块链技术的影响以及量子计算对物联网(IoT)设备安全产生的影响,同时提出了应对这些挑战的对策。

工控网络安全新兴理念及发展态势分析

随着数字技术的泛在化和网络攻击的与日俱增,加之AI和量子计算等颠覆性技术开始应用,常规网络安全防护理念及技术已不能满足新形势下关键基础设施工控网络安全的需求。本文描述了九位一体安全深度防护、设计安全、默认安全等新兴安全理念的概念、模型结构、特性及应用,并简要分析了边缘计算、AI、量子计算、分布式账簿、去中心化网络安全管理等新兴技术方面的发展态势。

Preserving Privacy of Software-Defined Networking Policies by Secure Multi-Party Computation

In software-defined networking(SDN),controllers are sinks of information such as network topology collected from switches.Organizations often like to protect their internal network topology and keep their network policies private.We borrow techniques from secure multi-party computation(SMC)to preserve the privacy of policies of SDN controllers about status of routers.On the other hand,the number of controllers is one of the most important concerns in scalability of SMC application in SDNs.To address this issue,we formulate an optimization problem to minimize the number of SDN controllers while considering their reliability in SMC operations.We use Non-Dominated Sorting Genetic Algorithm II(NSGA-II)to determine the optimal number of controllers,and simulate SMC for typical SDNs with this number of controllers.Simulation results show that applying the SMC technique to preserve the privacy of organization policies causes only a little delay in SDNs,which is completely justifiable by the privacy obtained.

Quantum Polynomial-Time Fixed-Point Attack for RSA

Security analysis of public-key cryptosystems is of fundamental significance for both theoretical research and applications in cryptography. In particular, the security of widely used public-key cryptosystems merits deep research to protect against new types of attacks. It is therefore highly meaningful to research cryptanalysis in the quantum computing environment. Shor proposed a wellknown factoring algorithm by finding the prime factors of a number n =pq, which is exponentially faster than the best known classical algorithm. The idea behind Shor's quantum factoring algorithm is a straightforward programming consequence of the following proposition: to factor n, it suffices to find the order r; once such an r is found, one can compute gcd( a^(r/2) ±1, n)=p or q. For odd values of r it is assumed that the factors of n cannot be found(since a^(r/2) is not generally an integer). That is, the order r must be even. This restriction can be removed, however, by working from another angle. Based on the quantum inverse Fourier transform and phase estimation, this paper presents a new polynomial-time quantum algorithm for breaking RSA, without explicitly factoring the modulus n. The probability of success of the new algorithm is greater than 4φ( r)/π~2 r, exceeding that of the existing quantum algorithm forattacking RSA based on factorization. In constrast to the existing quantum algorithm for attacking RSA, the order r of the fixed point C for RSA does not need to be even. It changed the practices that cryptanalysts try to recover the private-key, directly from recovering the plaintext M to start, a ciphertext-only attack attacking RSA is proposed.

Concretely ecient secure multi-party computation protocols:survey and mor

Secure multi-party computation(MPC)allows a set of parties to jointly compute a function on their private inputs,and reveals nothing but the output of the function.In the last decade,MPC has rapidly moved from a purely theoretical study to an object of practical interest,with a growing interest in practical applications such as privacy-preserving machine learning(PPML).In this paper,we comprehensively survey existing work on concretely ecient MPC protocols with both semi-honest and malicious security,in both dishonest-majority and honest-majority settings.We focus on considering the notion of security with abort,meaning that corrupted parties could prevent honest parties from receiving output after they receive output.We present high-level ideas of the basic and key approaches for designing di erent styles of MPC protocols and the crucial building blocks of MPC.For MPC applications,we compare the known PPML protocols built on MPC,and describe the eciency of private inference and training for the state-of-the-art PPML protocols.Further-more,we summarize several challenges and open problems to break though the eciency of MPC protocols as well as some interesting future work that is worth being addressed.This survey aims to provide the recent development and key approaches of MPC to researchers,who are interested in knowing,improving,and applying concretely ecient MPC protocols.

后量子密码的发展趋势研究

密码是保障网络通信安全的堡垒,随着量子计算的出现,经典密码体制在维护信息安全方面面临着巨大的挑战。目前,后量子密码算法是理论上证明可保障量子环境下通信安全的新型密码方案。通过分析现有量子计算技术与后量子密码方案设计的研究进展,强调后量子密码研究的紧迫感,表明后量子密码的研究在信息安全中的重要性,最后指出后量子密码下一步可能的研究方向,为我国后量子密码技术研究提供参考。

基于量子中心的测量型量子保密求和协议

量子保密求和是量子安全计算的基础,目的是在保护参与者私有信息的前提下求出参与者秘密信息的和。提出一个基于GHZ类态的三方量子保密求和协议,其中只有量子中心拥有全量子能力,其余参与者只能对接收的量子态进行反射或测量。理论分析表明,所提出的协议可以确保正确性,即多个参与者最后可以成功计算他们秘密的和;同时,该协议还可以抵抗参与者攻击和外部攻击,即无论是外部攻击者还是内部参与者都不能获得除自己的秘密与结果之外的任何信息。最后,进一步讨论了如何将协议的参与者由三方拓展至多方。