Quantum Communication Networks and Trust Management: A Survey

This paper summarizes the state of art in quantum communication networks and trust management in recent years.As in the classical networks,trust management is the premise and foundation of quantum secure communication and cannot simply be attributed to security issues,therefore the basic and importance of trust management in quantum communication networks should be taken more seriously.Compared with other theories and techniques in quantum communication,the trust of quantum communication and trust management model in quantum communication network environment is still in its initial stage.In this paper,the core technologies of establishing secure and reliable quantum communication networks are categorized and summarized,and the trends of each direction in trust management of quantum communication network are discussed in depth.

Investigations on ion implantation-induced strain in rotated Y-cut LiNbO_(3) and LiTaO_(3)

The monocrystalline LiNbO_(3)(LN)and LiTaO_(3)(LT)plates have been qualified as a kind of material platform for high performance RF filter that is considerable for the 5G communication.LN and LT thin films are usually transferred on handle wafers by combining ion-slicing and wafer bonding technique to form a piezoelectric on insulator(POI)substrate.The ion implantation is a key process and the implantation-induced strain is essential for the layer transfer.Here,we reported the strain profile of ion implanted rotated Y-cut LN and LT.The ion implantation generates the out-of-plane tensile strain of the sample surface and(006)plane,while both the tensile and compressive strain are observed on the(030)plane.The implanted ions redistributed due to the anisotropy of LN and LT,and induce the main tensile normal to the(006)plane.Meanwhile,the(030)planes are contracted due to the Poisson effect with the interstitial ions disturbing and mainly show a compressive strain profile.

Quantum Generative Adversarial Network: A Survey

Generative adversarial network(GAN)is one of the most promising methods for unsupervised learning in recent years.GAN works via adversarial training concept and has shown excellent performance in the fields image synthesis,image super-resolution,video generation,image translation,etc.Compared with classical algorithms,quantum algorithms have their unique advantages in dealing with complex tasks,quantum machine learning(QML)is one of the most promising quantum algorithms with the rapid development of quantum technology.Specifically,Quantum generative adversarial network(QGAN)has shown the potential exponential quantum speedups in terms of performance.Meanwhile,QGAN also exhibits some problems,such as barren plateaus,unstable gradient,model collapse,absent complete scientific evaluation system,etc.How to improve the theory of QGAN and apply it that have attracted some researcher.In this paper,we comprehensively and deeply review recently proposed GAN and QAGN models and their applications,and we discuss the existing problems and future research trends of QGAN.

A Secure Signcryption Scheme for Electronic Health Records Sharing in Blockchain

In the existing Electronic Health Records(EHRs),the medical information of patients is completely controlled by various medical institutions.As such,patients have no dominant power over their own EHRs.These personal data are not only inconvenient to access and share,but are also prone to cause privacy disclosure.The blockchain technology provides a new development direction in the medical field.Blockchain-based EHRs are characterized by decentralization,openness and non-tampering of records,which enable patients to better manage their own EHRs.In order to better protect the privacy of patients,only designated receivers can access EHRs,and receivers can authenticate the sharer to ensure that the EHRs are real and effective.In this study,we propose an identity-based signcryption scheme with multiple authorities for multiple receivers,which can resist N-1 collusion attacks among N authorities.In addition,the identity information of receivers is anonymous,so the relationship between them and the sharer is not disclosed.Under the random oracle model,it was proved that our scheme was secure and met the unforgeability and confidentiality requirements of signcryption.Moreover,we evaluated the performance of the scheme and found that it had the moderate signcryption efficiency and excellent signcryption attributes.

Task-Attribute-Based Access Control Scheme for IoT via Blockchain

As a new form of network,the Internet of things(IoT)is becoming more widely used in people’s lives.In this paper,related theoretical research and practical applications of the IoT are explored.The security of the IoT has become a hot research topic.Access controls are methods that control reasonable allocations of data and resources and ensure the security of the IoT.However,most access control systems do not dynamically assign users’rights.Additionally,with some access control systems,there is a risk of overstepping other user’s authority,and there may exist a central authority that is a single point of failure.Therefore,to solve these problems,this paper proposes a Task-Attribute-Based Access Control scheme for the IoT via blockchain that combines the access control technologies of both the IoT and blockchain.This model,which merges the advantages of task-based access controls and attribute-based access controls,is perfectly integrated with blockchain technology.This model uses hash functions and digital signature algorithms to ensure the authenticity and integrity of the data,and it can dynamically allocate users’minimum privileges and thus perfectly solves the single point of failure problem.The model is implemented using a Geth client and solidity code,and the simulation results demonstrate the effectiveness of the model.

Measure-Resend Semi-Quantum Private Comparison Scheme Using GHZ Class States

Quantum private comparison is an important topic in quantum cryptography.Recently,the idea of semi-quantumness has been often used in designing private comparison protocol,which allows some of the participants to remain classical.In this paper,we propose a semi quantum private comparison scheme based on Greenberge-Horne-Zeilinger(GHZ)class states,which allows two classical participants to compare the equality of their private secret with the help of a quantum third party(server).In the proposed protocol,server is semi-honest who will follow the protocol honestly,but he may try to learn additional information from the protocol execution.The classical participants’activities are restricted to either measuring a quantum state or reflecting it in the classical basis{0,1}.In addition,security and efficiency of the proposed schemes have been discussed.

A Scalable Double-Chain Storage Module for Blockchain

With the growing maturity of blockchain technology,its peer-topeer model and fully duplicated data storage pattern enable blockchain to act as a distributed ledger in untrustworthy environments.Blockchain storage has also become a research hotspot in industry,finance,and academia due to its security,and its unique data storage management model is gradually becoming a key technology to play its value in various fields’applications.However,with the increasing amount of data written into the blockchain,the blockchain system faces many problems in its actual implementation of the application,such as high storage space occupation,low data flexibility and availability,low retrieval efficiency,poor scalability,etc.To improve the above problems,this paper combines off-chain storage technology and deduplication technology to optimize the blockchain storage model.Firstly,this paper adopts the double-chain model to reduce the data storage of the major chain system,which stores a small amount of primary data and supervises the vice chain through an Application Programming Interface(API).The vice chain stores a large number of copies of data as well as non-transactional data.Our model divides the vice chain storage system into two layers,including a storage layer and a processing layer.In the processing layer,deduplication technology is applied to reduce the redundancy of vice chain data.Our doublechain storage model with high scalability enhances data flexibility,is more suitable as a distributed storage system,and performs well in data retrieval.

A Dynamic Reputation–based Consensus Mechanism for Blockchain

In recent years,Blockchain is gaining prominence as a hot topic in academic research.However,the consensus mechanism of blockchain has been criticized in terms of energy consumption and performance.Although Proof-of-Authority(PoA)consensus mechanism,as a lightweight consensus mechanism,is more efficient than traditional Proof-of-Work(PoW)and Proof-of-Stake(PoS),it suffers from the problem of centralization.To this end,on account of analyzing the shortcomings of existing consensus mechanisms,this paper proposes a dynamic reputation-based consensus mechanism for blockchain.This scheme allows nodes with reputation value higher than a threshold apply to become a monitoring node,which can monitor the behavior of validators in case that validators with excessive power cause harm to the blockchain network.At the same time,the reputation evaluation algorithm is also introduced to select nodes with high reputation to become validators in the network,thus increasing the cost of malicious behavior.In each consensus cycle,validators and monitoring nodes are dynamically updated according to the reputation value.Through security analysis,it is demonstrated that the scheme can resist the attacks of malicious nodes in the blockchain network.By simulation experiments and analysis of the scheme,the result verifies that the mechanism can effectively improve the fault tolerance of the consensus mechanism,reduce the time of consensus to guarantee the security of the system.

Clustering Collision Power Attack on RSA-CRT

In this paper,we propose two new attack algorithms on RSA implementations with CRT(Chinese remainder theorem).To improve the attack efficiency considerably,a clustering collision power attack on RSA with CRT is introduced via chosen-message pairs.This attack method is that the key parameters dp and dq are segmented by byte,and the modular multiplication collisions are identified by k-means clustering.The exponents dp and dq were recovered by 12 power traces of six groups of the specific message pairs,and the exponent d was obtained.We also propose a second order clustering collision power analysis attack against RSA implementation with CRT,which applies double blinding exponentiation.To reduce noise and artificial participation,we analyze the power points of interest by preprocessing and k-means clustering with horizontal correlation collisions.Thus,we recovered approximately 91%of the secret exponents manipulated with a single power curve on RSA-CRT with countermeasures of double blinding methods.

Research on Architecture of Risk Assessment System Based on Block Chain

The risk assessment system has been applied to the information security,energy,medical and other industries.Through the risk assessment system,it is possible to quantify the possibility of the impact or loss caused by an event before or after an event,thereby avoiding the risk or reducing the loss.However,the existing risk assessment system architecture is mostly a centralized architecture,which could lead to problems such as data leakage,tampering,and central cheating.Combined with the technology of block chain,which has the characteristics of decentralization,security and credibility,collective maintenance,and untamperability.This paper proposes a new block chainbased risk assessment system architecture and a consensus mechanism algorithm based on DPOS improvement.This architecture uses an improved consensus mechanism to achieve a safe and efficient risk assessment solving the problem of data tampering in the risk assessment process,avoiding data leakage caused by improper data storage.A convenient,safe and fast risk assessment is achieved in conjunction with the improved consensus mechanism.In addition,by comparing existing risk assessment architecture,the advantages and impacts of the new block chain-based risk assessment system architecture are analyzed.

A Quantum Authorization Management Protocol Based on EPRPairs

Quantum authorization management(QAM)is the quantum scheme for privilege management infrastructure(PMI)problem.Privilege management(authorization management)includes authentication and authorization.Authentication is to verify a user’s identity.Authorization is the process of verifying that a authenticated user has the authority to perform a operation,which is more fine-grained.In most classical schemes,the authority management center(AMC)manages the resources permissions for all network nodes within the jurisdiction.However,the existence of AMC may be the weakest link of the whole scheme.In this paper,a protocol for QAM without AMC is proposed based on entanglement swapping.In this protocol,Bob(the owner of resources)authenticates the legality of Alice(the user)and then shares the right key for the resources with Alice.Compared with the other existed QAM protocols,this protocol not only implements authentication,but also authorizes the user permissions to access certain resources or carry out certain actions.The authority division is extended to fin-grained rights division.The security is analyzed from the four aspects:the outsider’s attack,the user’s attack,authentication and comparison with the other two QAM protocols.

A Novel Semi-Quantum Private Comparison Scheme Using Bell Entangle States

Private comparison is the basis of many encryption technologies,and several related Quantum Private Comparison(QPC)protocols have been published in recent years.In these existing protocols,secret information is encoded by using conjugate coding or orthogonal states,and all users are quantum participants.In this paper,a novel semi-quantum private comparison scheme is proposed,which employs Bell entangled states as quantum resources.Two semi-quantum participants compare the equivalence of their private information with the help of a semi-honest third party(TP).Compared with the previous classical protocols,these two semi-quantum users can only make some particular action,such as to measure,prepare and reflect quantum qubits only in the classical basis fj0i;j1ig,and TP needs to perform Bell basis measurement on reflecting qubits to obtain the results of the comparison.Further,analysis results show that this scheme can avoid outside and participant attacks and its’qubit efficiency is better than the other two protocols mentioned in the paper.

Quantum Risk Assessment Model Based on Two Three-Qubit GHZ States

With the acceleration of the construction of quantum communication networks,scholars have proposed different quantum communication protocols for different application scenarios.However,few scholars pay attention to the risk assessment process before communication.In this paper,we propose a novel quantum risk assessment model based on quantum teleportation technology with two three-qubit GHZ states.Only by using Bell states measurements(BSMs)and two-qubit projective measurements(PJMs),the communicators can recovery any arbitrary two-qubit state.This protocol can transmit two-dimension risk assessment factors with better security performance.On the one hand,more sufficient evaluation factors allow the two communicating parties to more objectively evaluate the risk level of communication with the other party,and on the other hand,it also improves the qubit efficiency of the protocol.Moreover,we introduce the third party in this scheme can be semi-trusted,which must be full-trusted in our previous work.This change can reduce the dependence of the communication parties on the third-party organization and improve the privacy of communication.The security analysis shows that this scheme can resist internal and external attacks,and the quantum circuit diagrams also prove that our protocol is physically easier to implement.

RRCNN: Request Response-Based Convolutional Neural Network for ICS Network Traffic Anomaly Detection

Nowadays,industrial control system(ICS)has begun to integrate with the Internet.While the Internet has brought convenience to ICS,it has also brought severe security concerns.Traditional ICS network traffic anomaly detection methods rely on statistical features manually extracted using the experience of network security experts.They are not aimed at the original network data,nor can they capture the potential characteristics of network packets.Therefore,the following improvements were made in this study:(1)A dataset that can be used to evaluate anomaly detection algorithms is produced,which provides raw network data.(2)A request response-based convolutional neural network named RRCNN is proposed,which can be used for anomaly detection of ICS network traffic.Instead of using statistical features manually extracted by security experts,this method uses the byte sequences of the original network packets directly,which can extract potential features of the network packets in greater depth.It regards the request packet and response packet in a session as a Request-Response Pair(RRP).The feature of RRP is extracted using a one-dimensional convolutional neural network,and then the RRP is judged to be normal or abnormal based on the extracted feature.Experimental results demonstrate that this model is better than several other machine learning and neural network models,with F1,accuracy,precision,and recall above 99%.

Quantum Secure Direct Communication Protocol with Mutual Authentication Based on Single Photons and Bell States

Quantum secure direct communication(QSDC)can transmit secret messages directly from one user to another without first establishing a shared secret key,which is different from quantum key distribution.In this paper,we propose a novel quantum secure direct communication protocol based on signal photons and Bell states.Before the execution of the proposed protocol,two participants Alice and Bob exchange their corresponding identity IDA and IDB through quantum key distribution and keep them secret,respectively.Then the message sender,Alice,encodes each secret message bit into two single photons(|01>or|10>)or a Bell state(1|φ^(+)>=1/√2(|0>|-|1>1>)),and composes an ordered secret message sequence.To insure the security of communication,Alice also prepares the decoy photons and inserts them into secret message sequence on the basis of the values of IDA and IDB.By the secret identity IDA and IDB,both sides of the communication can check eavesdropping and identify each other.The proposed protocol not only completes secure direct communication,but also realizes the mutual authentication.The security analysis of the proposed protocol is presented in the paper.The analysis results show that this protocol is secure against some common attacks,and no secret message leaks even if the messages are broken.Compared with the two-way QSDC protocols,the presented protocol is a one-way quantum communication protocol which has the immunity to Trojan horse attack.Furthermore,our proposed protocol can be realized without quantum memory.

Quantum Electronic Contract Scheme Based on Single Photon

An electronic contract is a contract signed by electronic means,which is widely used in electronic commerce activities.In recent years,with the rapid development of quantum cryptography technology,the quantum electronic contract has been widely studied by researchers.Supported by the basic principles of quantum mechanics,a quantum electronic contract scheme based on the single photon is proposed in this paper.In this scheme,two copies of the same contract are signed by both parties involved,and then a copy of each contract is sent to a trusted third party.The trusted third party verifies the signatures of both parties and compares the signed copies to determine whether the contract is valid.Compared with the previous scheme,this scheme is based on the quantum electronic contract signed by the single photon.Because the single photon is easy to prepare and operate,this scheme is simple and easy to implement.At the same time,the scheme does not need to exchange signatures between the two parties,which reduces the complexity of communication.Nevertheless,it requires both parties and the third party to be honest and trustworthy.

Device-Independent Quantum Key Distribution Protocol Based on Hyper-Entanglement

The secure key rate of quantum key distribution(QKD)is greatly reduced because of the untrusted devices.In this paper,to raise the secure key rate of QKD,a device-independent quantum key distribution(DIQKD)protocol is proposed based on hyper-entangled states and Bell inequalities.The security of the protocol is analyzed against the individual attack by an adversary only limited by the no-signaling condition.Based on the formalization of Clauser-Horne Shimony-Holt(CHSH)violation measurement on local correlation,the probability of a secure secret bit is obtained,which is produced by a pair of hyper-entangled particles.By analyzing the secure secret bit,it is proven that,when both the polarization mode and the path mode contains entangled-states,the DIQKD protocol gets a better secure key rate than common Bell states.

A Controlled Quantum Dialogue Protocol Based on Quantum Walks

In order to enable two parties to exchange their secret information equally,we propose a controlled quantum dialogue protocol based on quantum walks,which implements the equal exchange of secret information between the two parties with the help of the controller TP.The secret information is transmitted via quantum walks,by using this method,the previously required entangled particles do not need to be prepared in the initial phase,and the entangled particles can be produced spontaneously via quantum walks.Furthermore,to resist TP’s dishonest behavior,we use a hash function to verify the correctness of the secret information.The protocol analysis shows that it is safe and reliable facing some attacks,including intercept-measure-resend attack,entanglement attack,dishonest controller’s attack and participant attack.And has a slightly increasing efficiency comparing with the previous protocols.Note that the proposed protocol may be feasible because quantum walks prove to be implemented in different physical systems and experiments.

A Trust Value Sharing Scheme in Heterogeneous Identity Federation Topologies

Recent developments in heterogeneous identity federation systems have heightened the need for the related trust management system.The trust management system evaluates,manages,and shares users’trust values.The service provider(SP)members of the federation system rely on users’trust values to determine which type and quality of service will be provided to the users.While identity federation systems have the potential to help federated users save time and energy and improve service experience,the benefits also come with significant privacy risks.So far,there has been little discussion about the privacy protection of users in heterogeneous identity federation systems.In this paper,we propose a trust value sharing scheme based on a proxy ring signature for the trust management system in heterogeneous identity federation topologies.The ring signature schemes can ensure the validity of the data and hide the original signer,thereby protecting privacy.Moreover,no group manager participating in the ring signature,which naturally matches with our decentralized heterogeneous identity federation topologies.The proxy signature can reduce the workload of the private key owner.The proposed scheme shortens the calculation time for verifying the signature and then reduces the overall time consumption in the process of trust sharing.Our studies prove that the proposed scheme is privacy-preserving,efficient,and effective.

Quantum Fuzzy Support Vector Machine for Binary Classification

In the objective world,how to deal with the complexity and uncertainty of big data efficiently and accurately has become the premise and key to machine learning.Fuzzy support vector machine(FSVM)not only deals with the classifi-cation problems for training samples with fuzzy information,but also assigns a fuzzy membership degree to each training sample,allowing different training samples to contribute differently in predicting an optimal hyperplane to separate two classes with maximum margin,reducing the effect of outliers and noise,Quantum computing has super parallel computing capabilities and holds the pro-mise of faster algorithmic processing of data.However,FSVM and quantum com-puting are incapable of dealing with the complexity and uncertainty of big data in an efficient and accurate manner.This paper research and propose an efficient and accurate quantum fuzzy support vector machine(QFSVM)algorithm based on the fact that quantum computing can efficiently process large amounts of data and FSVM is easy to deal with the complexity and uncertainty problems.The central idea of the proposed algorithm is to use the quantum algorithm for solving linear systems of equations(HHL algorithm)and the least-squares method to solve the quadratic programming problem in the FSVM.The proposed algorithm can deter-mine whether a sample belongs to the positive or negative class while also achiev-ing a good generalization performance.Furthermore,this paper applies QFSVM to handwritten character recognition and demonstrates that QFSVM can be run on quantum computers,and achieve accurate classification of handwritten characters.When compared to FSVM,QFSVM’s computational complexity decreases expo-nentially with the number of training samples.