A novel quantum information hiding protocol based on entanglement swapping of high-level Bell states

Using entanglement swapping of high-level Bell states, we first derive a covert layer between the secret message and the possible output results of the entanglement swapping between any two generalized Bell states, and then propose a novel high-efficiency quantum information hiding protocol based on the covert layer. In the proposed scheme, a covert channel can be built up under the cover of a high-level quantum secure direct communication （QSDC） channel for securely transmitting secret messages without consuming any auxiliary quantum state or any extra communication resource. It is shown that this protocol not only has a high embedding efficiency but also achieves a good imperceptibility as well as a high security.

Trust Model Based on Structured Protection for High Level Security System

In order to ensure the security of information systems, it's essential to make sure that system behaviors are trusted. By analyzing threats that exist in executing procedures, a trust model based on structured protection is proposed. We consider that functional components, system actions and message flows between components are three key factors of information systems. Structured protection requirements on components, connections and action parameters are also provided. Four trusted properties of the model are deducted through formal analysis, and trusted system behavior is defined based on these properties. Furthermore, decision theorem of trusted system behavior is proved. The developed prototype system indicates the model is practical. It is a general theory model built on logic deduction and independent on specific environment and the behaviors of the system designed and implemented following the model are trusted.

A Concurrent Security Monitoring Method for Virtualization Environments

Recently,virtualization technologies have been widely used in industry.In order to monitor the security of target systems in virtualization environments,conventional methods usually put the security monitoring mechanism into the normal functionality of the target systems.However,these methods are either prone to be tempered by attackers or introduce considerable performance overhead for target systems.To address these problems,in this paper,we present a concurrent security monitoring method which decouples traditional serial mechanisms,including security event collector and analyzer,into two concurrent components.On one hand,we utilize the SIM framework to deploy the event collector into the target virtual machine.On the other hand,we combine the virtualization technology and multi-core technology to put the event analyzer into a trusted execution environment.To address the synchronization problem between these two concurrent components,we make use of Lamport's ring buffer algorithm.Based on the Xen hypervisor,we have implemented a prototype system named COMO.The experimental results show that COMO can monitor the security of the target virtual machine concurrently within a little performance overhead.

QBIoT:A Quantum Blockchain Framework for IoT with an Improved Proof-of-Authority Consensus Algorithm and a Public-Key Quantum Signature

The Internet of Things(IoT)is a network system that connects physical devices through the Internet,allowing them to interact.Nowadays,IoT has become an integral part of our lives,offering convenience and smart functionality.However,the growing number of IoT devices has brought about a corresponding increase in cybersecurity threats,such as device vulnerabilities,data privacy concerns,and network susceptibilities.Integrating blockchain technology with IoT has proven to be a promising approach to enhance IoT security.Nevertheless,the emergence of quantum computing poses a significant challenge to the security of traditional classical cryptography used in blockchain,potentially exposing it to quantum cyber-attacks.To support the growth of the IoT industry,mitigate quantum threats,and safeguard IoT data,this study proposes a robust blockchain solution for IoT that incorporates both classical and post-quantum security measures.Firstly,we present the Quantum-Enhanced Blockchain Architecture for IoT(QBIoT)to ensure secure data sharing and integrity protection.Secondly,we propose an improved Proof of Authority consensus algorithm called“Proof of Authority with Random Election”(PoARE),implemented within QBIoT for leader selection and new block creation.Thirdly,we develop a publickey quantum signature protocol for transaction verification in the blockchain.Finally,a comprehensive security analysis of QBIoT demonstrates its resilience against cyber threats from both classical and quantum adversaries.In summary,this research introduces an innovative quantum-enhanced blockchain solution to address quantum security concernswithin the realmof IoT.The proposedQBIoT framework contributes to the ongoing development of quantum blockchain technology and offers valuable insights for future research on IoT security.

Progress and Prospect of Some Fundamental Research on Information Security in China

With the development of network and information technologies, information security is more and more widely researched in China. To know where the work is and where it goes, we focus on comprehensively surveying the twenty years of important fundamental research by Chinese scholars, and giving, from our point of view, the significance as well as the outlook of future work. Some of the reviewed work, including the researches on fundamental theory of cryptography, cryptographic algorithm, security protocol, security infrastructure and information hiding, greatly advances the related sub-fields, and is highly recognized in and outside of China. Nevertheless, the overall work, we think, is still facing the problems of unbalanced development of sub-areas, limited scope of research, lack of systematic work and application, etc., leaving much room for improvement in the near future.

Quantum election scheme based on anonymous quantum key distribution

An unconditionally secure authority-certified anonymous quantum key distribution scheme using conjugate coding is presented, based on which we construct a quantum election scheme without the help of an entanglement state. We show that this election scheme ensures the completeness, soundness, privacy, eligibility, unreusability, fairness, and verifiability of a large-scale election in which the administrator and counter are semi-honest. This election scheme can work even if there exist loss and errors in quantum channels. In addition, any irregularity in this scheme is sensible.

A New Method for Meet-in-the-Middle Attacks on Reduced AES

A new 5-round distinguisher of AES with key whitening is presented by using the properties of its round transformation. Based on this distinguisher,we present new meet-in-the-middle attacks on reduced AES considering the key schedule and the time-memory tradeoff approach. New attacks improve the best known meet-in-the-middle attacks on reduced AES presented at FSE2008.We reduce the time complexity of attacks on 7-round AES-192 and 8-round AES-256 by a factor of at least 28. Moreover,the distinguisher can be exploited to develop the attack on 8-round AES-192.

Quantum Probabilistic Encryption Scheme Based on Conjugate Coding

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 privatekey 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 attack is also investigated by considering the information-theoretic indistinguishability of the encryption scheme. Finally, we make a conjecture regarding Breidbart's attack.

Fault Attacks on Hyperelliptic Curve Discrete Logarithm Problem over Finite Fields

In this paper, we present two explicit invalid-curve attacks on the genus 2 hyperelliptic curve over a finite field. First, we propose two explicit attack models by injecting a one-bit fault in a given divisor. Then, we discuss the construction of an invalid curve based on the faulted divisor. Our attacks are based on the fact that the Hyperelliptic Curve Scalar Multiplication (HECSM) algorithm does not utilize the curve parameters and We consider three hyperelliptic curves as the attack targets. For curve with security level 186 (in bits), our attack method can get the weakest invalid curve with security level 42 (in bits); there are 93 invalid curves with security level less than 50. We also estimate the theoretical probability of getting a weak hyperelliptic curve whose cardinality is a smooth integer. Finally, we show that the complexity of the fault attack is subexponential if the attacker can freely inject a fault in the input divisor. Cryptosystems based on the genus 2 hyperelliptic curves cannot work against our attack algorithm in practice.

Generalized Ptychography with Diverse Probes

Generalized ptychography is established with diverse probes,which not only extend the core spirit of ptychography that is the overlapping of neighboring probes,but also enhance the imaging quality.We find that in one of suggested configurations with visible light,the performances of two types of diversified probes are improved in comparison with the traditional circular probes.This may open up some new possibilities of ptychographic imaging.

Authorized Identity-Based Public Cloud Storage Auditing Scheme with Hierarchical Structure for Large-Scale User Groups

Identity-based public cloud storage auditing schemes can check the integrity of cloud data, and reduce the complicated certificate management. In such a scheme, one Private Key Generator(PKG) is employed to authenticate the identity and generate private keys for all users, and one Third Party Auditor(TPA) is employed to by users to check the integrity of cloud data. This approach is undesirable for large-scale users since the PKG and the TPA might not be able to afford the heavy workload. To solve the problem, we give a hierarchical Private Key Generator structure for large-scale user groups, in which a root PKG delegates lower-level PKGs to generate private keys and authenticate identities. Based on the proposed structure, we propose an authorized identity-based public cloud storage auditing scheme, in which the lowest-level PKGs play the role of TPA, and only the authorized lowest-level PKGs can represent users in their domains to check cloud data's integrity. Furthermore, we give the formal security analysis and experimental results, which show that our proposed scheme is secure and efficient.

A Multivariate Public Key Cryptographic Scheme

This paper presents a multivariate public key cryptographic scheme over a finite field with odd prime characteristic.The idea of embedding and layering is manifested in its construction.The security of the scheme is analyzed in detail,and this paper indicates that the scheme can withstand the up to date differential cryptanalysis.We give heuristic arguments to show that this scheme resists all known attacks.

An Anonymity Scheme Based on Pseudonym in P2P Networks

In this paper, we proposed an anonymity scheme based on pseudonym where peers are motivated not to share their identity. Compared with precious scheme such as RuP （Reputation using Pseudonyms）, our scheme can reduce its overhead and minimize the trusted center＇s involvement.

Ptychographical Imaging Algorithm with a Single Random Phase Encoding

A single random phase encoding is introduced into ptychography for the first time.Since the diffractive wave front is encoded with the random phase modulator,the information of the sample cooperated with each probe can be uniformly distributed onto an entire diffraction pattern.It leads to the much faster convergent speed of the iterative algorithm for ptychographical imaging.It is more important for practice that the robustness to resist the noises and especially the transverse shift errors of probes are considerably improved compared with the conventional ptychographic algorithm.

Binary Image Steganalysis Based on Distortion Level Co-Occurrence Matrix

In recent years,binary image steganography has developed so rapidly that the research of binary image steganalysis becomes more important for information security.In most state-of-the-art binary image steganographic schemes,they always find out the flippable pixels to minimize the embedding distortions.For this reason,the stego images generated by the previous schemes maintain visual quality and it is hard for steganalyzer to capture the embedding trace in spacial domain.However,the distortion maps can be calculated for cover and stego images and the difference between them is significant.In this paper,a novel binary image steganalytic scheme is proposed,which is based on distortion level co-occurrence matrix.The proposed scheme first generates the corresponding distortion maps for cover and stego images.Then the co-occurrence matrix is constructed on the distortion level maps to represent the features of cover and stego images.Finally,support vector machine,based on the gaussian kernel,is used to classify the features.Compared with the prior steganalytic methods,experimental results demonstrate that the proposed scheme can effectively detect stego images.

A Novel S-Box GenerationMethodology Based on the Optimized GANModel

S-boxes can be the core component of block ciphers,and how to efficiently generate S-boxes with strong cryptographic properties appears to be an important task in the design of block ciphers.In this work,an optimized model based on the generative adversarial network(GAN)is proposed to generate 8-bit S-boxes.The central idea of this optimized model is to use loss function constraints for GAN.More specially,the Advanced Encryption Standard(AES)S-box is used to construct the sample dataset via the affine equivalence property.Then,three models are respectively built and cross-trained to generate 8-bit S-boxes based on three extended frameworks of GAN,i.e.,Deep Convolution Generative Adversarial Networks(DCGAN),Wasserstein Generative Adversarial Networks(WGAN),and WassersteinGenerativeAdversarial NetworkwithGradient Penalty(WGANGP).Besides,an optimized model based onWGAN-GP referred to asWGPIM is also proposed,which adds the loss function constraints to the generator network of the WGAN-GP model,including bijection loss,differential uniformity loss,and nonlinearity loss.In this case,8-bit S-boxes can be generated with cross-training.Experimental results illustrate that the WGP-IM model can generate S-boxes with excellent cryptographic properties.In particular,the optimal differential uniformity of the generated S-boxes can be reduced to 8,and the nonlinearity can be up to 104.Compared with previous S-box generation methods,this new method is simpler and it can generate S-boxes with excellent cryptographic properties.

Construction of General (k, n) Probabilistic Visual Cryptography Scheme

Visual cryptography scheme （VCS） is a secure method that encrypts a secret image by subdividing it into shadow images. Due to the nature of encryption VCS is categorized into two types： the deterministic VCS （DVCS） and the probabilistie VCS （PVCS）. For the DVCS, we use m （known as the pixel expansion） subpixels to represent a secret pixel. The PVCS uses only one subpixel to represent a secret pixel, while the quality of reconstructed image is degraded. A well-known construction of （k, n）-PVCS is obtained from the （k, n）-DVCS. In this paper, we show another construction of （k, n）-PVCS by extending the （k, k）-PVCS.

Fault tolerant deterministic secure quantum communication using logical Bell states against collective noise

This study proposes two novel fault tolerant deterministic secure quantum communication （DSQC） schemes resistant to collective noise using logical Bell states. Either DSQC scheme is constructed based on a new coding function, which is designed by exploiting the property of the corresponding logical Bell states immune to collective-dephasing noise and collective-rotation noise, respectively. The secret message can be encoded by two simple unitary operations and decoded by merely performing Bell measurements, which can make the proposed scheme more convenient in practical applications. Moreover, the strategy of one-step quanta transmission, together with the technique of decoy logical qubits checking not only reduces the influence of other noise existing in a quantum channel, but also guarantees the security of the communication between two legitimate users. The final analysis shows that the proposed schemes are feasible and robust against various well-known attacks over the collective noise channel.

Optimized Algorithms for Flexible Length-Based Authenticated Skip List

With the growing trend toward using cloud storage,the problem of efficiently checking and proving data integrity needs more consideration.Many cryptography and security schemes,such as PDP(Provable Data Possession) and POR(Proofs of Retrievability) were proposed for this problem.Although many efficient schemes for static data have been constructed,only a few dynamic schemes exist,such as DPDP(Dynamic Provable Data Possession).But the DPDP scheme falls short when updates are not proportional to a fixed block size.The FlexList-based Dynamic Provable Data Possession(FlexDPDP) was an optimized scheme for DPDP.However,the update operations(insertion,remove,modification)in Flex DPDP scheme only apply to single node at a time,while multiple consecutive nodes operation is more common in practice.To solve this problem,we propose optimized algorithms for multiple consecutive nodes,which including MultiNodes Insert and Verification,MultiNodes Remove and Verification,MultiNodes Modify and Verification.The cost of our optimized algorithms is also analyzed.For m consecutive nodes,an insertion takes O(m) + O(log N) + O(log m),where N is the number of leaf nodes of FlexList,a remove takes O(log/V),and a modification is the same as the original algorithm.Finally,we compare the optimized algorithms with original FlexList through experiences,and the results show that our scheme has the higher efficiency of time and space.

An Effective Differential Fault Analysis on the Serpent Cryptosystem in the Internet of Things

Due to the strong attacking ability, fast speed, simple implementation and other characteristics, differential fault analysis has become an important method to evaluate the security of cryptosystem in the Internet of Things. As one of the AES finalists, the Serpent is a 128-bit Substitution-Permutation Network(SPN) cryptosystem. It has 32 rounds with the variable key length between 0 and 256 bits, which is flexible to provide security in the Internet of Things. On the basis of the byte-oriented model and the differential analysis, we propose an effective differential fault attack on the Serpent cryptosystem. Mathematical analysis and simulating experiment show that the attack could recover its secret key by introducing 48 faulty ciphertexts. The result in this study describes that the Serpent is vulnerable to differential fault analysis in detail. It will be beneficial to the analysis of the same type of other iterated cryptosystems.