We propose a bidirectional quantum secure direct communication(QSDC) network protocol with the hyperentanglment in both the spatial-mode ad the polarization degrees of freedom of photon pairs which can in principle be...We propose a bidirectional quantum secure direct communication(QSDC) network protocol with the hyperentanglment in both the spatial-mode ad the polarization degrees of freedom of photon pairs which can in principle be produced with a beta barium borate crystal.The secret message can be encoded on the photon pairs with unitary operations in these two degrees of freedom independently.Compared with other QSDC network protocols,our QSDC network protocol has a higher capacity as each photon pair can carry 4 bits of information.Also,we discuss the security of our QSDC network protocol and its feasibility with current techniques.展开更多
Existing solutions against wiretapping attacks for network coding either bring significant bandwidth overhead or incur a high computational complexity.In order to reduce the security overhead of the existing solutions...Existing solutions against wiretapping attacks for network coding either bring significant bandwidth overhead or incur a high computational complexity.In order to reduce the security overhead of the existing solutions for securing network coding,a novel securing network coding paradigm is presented relying on two coding models:intra-generation coding and inter-generation coding.The basic idea to secure network coding using intra-generation coding is to limit the encryption operations for each generation,and then subject the scrambled and the remaining original source vectors to a linear transformation.This method is then generalized seamlessly using inter-generation coding by further exploiting the algebraic structure of network coding.We show that the proposed schemes have properties of low-complexity security,little bandwidth consumption,and high efficiency in integrating with the existing security techniques effectively.展开更多
To provide a high-security guaran- tee to network coding and lower the comput- ing complexity induced by signature scheme, we take full advantage of homomorphic prop- erty to build lattice signature schemes and sec- u...To provide a high-security guaran- tee to network coding and lower the comput- ing complexity induced by signature scheme, we take full advantage of homomorphic prop- erty to build lattice signature schemes and sec- ure network coding algorithms. Firstly, by means of the distance between the message and its sig- nature in a lattice, we propose a Distance-bas- ed Secure Network Coding (DSNC) algorithm and stipulate its security to a new hard problem Fixed Length Vector Problem (FLVP), which is harder than Shortest Vector Problem (SVP) on lattices. Secondly, considering the bound- ary on the distance between the message and its signature, we further propose an efficient Bo- undary-based Secure Network Coding (BSNC) algorithm to reduce the computing complexity induced by square calculation in DSNC. Sim- ulation results and security analysis show that the proposed signature schemes have stronger unforgeability due to the natural property of lattices than traditional Rivest-Shamir-Adleman (RSA)-based signature scheme. DSNC algo- rithm is more secure and BSNC algorithm greatly reduces the time cost on computation.展开更多
In a multi-hop wireless mesh network, wireless links are vulnerable due to severe channel fading, interference and physical damage. In this paper, we will provide a coding scheme to protect fi'om multiple failures in...In a multi-hop wireless mesh network, wireless links are vulnerable due to severe channel fading, interference and physical damage. In this paper, we will provide a coding scheme to protect fi'om multiple failures in wireless mesh networks to achieve high throughput where the redundancy is considered for the average number of failures. Our coding scheme is designed to protect fi'om the average number of failures to increase the network throughput. When the number of failures is more than the average case, the destination will have to walt for more coded packets in the following time slots.展开更多
In a multi-hop wireless mesh network, wireless links are vulnerable due to severe channel fading, interference and physical damage. In this paper, we will provide a coding scheme to protect from multiple failures in w...In a multi-hop wireless mesh network, wireless links are vulnerable due to severe channel fading, interference and physical damage. In this paper, we will provide a coding scheme to protect from multiple failures in wireless mesh networks to achieve high throughput where the redundancy is considered for the average number of failures. Our coding scheme is designed to protect from the average number of failures to increase the network throughput. When the number of failures is more than the average case, the destination will have to wait for more coded packets in the following time slots.展开更多
Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every lin...Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every linear code can be used to construct secret sharing schemes. So, we use the parity-check matrix of a linear code to construct secret sharing schemes based on linear codes. We also describe some techniques to recover the secret and determine the access structure of the new scheme. In this paper, we use the Massey's secret sharing scheme.展开更多
This study proposes a new coding function for the symmetric W state. Based on the new coding function, a theoretical protocol of deterministic quanama communication (DQC) is proposed. The sender can use the proposed...This study proposes a new coding function for the symmetric W state. Based on the new coding function, a theoretical protocol of deterministic quanama communication (DQC) is proposed. The sender can use the proposed coding function to encode his/her message, and the receiver can perform the imperfect Bell measurement to obtain the sender's message. In comparison to the existing DQC protocols that also use the W class state, the proposed protocol is more efficient and also more practical within today's technology. Moreover, the security of this protocol is analyzed to show that any eavesdropper will be detected with a very high probability under both the ideal and the noisy quantum channel.展开更多
Plasmonic encoding composed of metallic nanostructures makes a great contribution to the practical application of information encryption.However,most reports have so far shown the preparation of single or binary plasm...Plasmonic encoding composed of metallic nanostructures makes a great contribution to the practical application of information encryption.However,most reports have so far shown the preparation of single or binary plasmonic encoding patterns because of the technical difficulty of assembling multiplex nanostructures on a single platform,which cannot satisfy the requirements of high encoding capacity for increasing information security.Herein,we developed a strategy based on plasma etching combined with in-situ growth to fabricate patterned arrays of quasi-three-dimensional(3-D)plasmonic Au nano-mushrooms with controlled morphologies,and successfully realized ideal high-capacity plasmonic encoding by arranging Au nano-mushrooms on one platform.On this basis,such multiplex encoding patterns have been transferred to the flexible substrate to realize the triple-mode encryption of the Morse code of"FUNSOM",indicating great prospects in the applications of information encryption and data storage.展开更多
基金Supported by the Natural Science Foundation of Jiangsu Provincial Universities under Grant No.10KJB180004the National Natural Science Foundation of China under Grant No.11105075
文摘We propose a bidirectional quantum secure direct communication(QSDC) network protocol with the hyperentanglment in both the spatial-mode ad the polarization degrees of freedom of photon pairs which can in principle be produced with a beta barium borate crystal.The secret message can be encoded on the photon pairs with unitary operations in these two degrees of freedom independently.Compared with other QSDC network protocols,our QSDC network protocol has a higher capacity as each photon pair can carry 4 bits of information.Also,we discuss the security of our QSDC network protocol and its feasibility with current techniques.
基金supported by the National Natural Science Foundation of China(Grant No.11371290,No.61271174,No. 61301178)the Science and Technology Innovation Foundation of Xi'an(Grant No. CXY1352WL28)
文摘Existing solutions against wiretapping attacks for network coding either bring significant bandwidth overhead or incur a high computational complexity.In order to reduce the security overhead of the existing solutions for securing network coding,a novel securing network coding paradigm is presented relying on two coding models:intra-generation coding and inter-generation coding.The basic idea to secure network coding using intra-generation coding is to limit the encryption operations for each generation,and then subject the scrambled and the remaining original source vectors to a linear transformation.This method is then generalized seamlessly using inter-generation coding by further exploiting the algebraic structure of network coding.We show that the proposed schemes have properties of low-complexity security,little bandwidth consumption,and high efficiency in integrating with the existing security techniques effectively.
基金ACKNOWLEDGEMENT This work was partially supported by the National Basic Research Program of China under Grant No. 2012CB315905 the National Natural Sci- ence Foundation of China under Grants No. 61272501, No. 61173154, No. 61370190 and the Beijing Natural Science Foundation under Grant No. 4132056.
文摘To provide a high-security guaran- tee to network coding and lower the comput- ing complexity induced by signature scheme, we take full advantage of homomorphic prop- erty to build lattice signature schemes and sec- ure network coding algorithms. Firstly, by means of the distance between the message and its sig- nature in a lattice, we propose a Distance-bas- ed Secure Network Coding (DSNC) algorithm and stipulate its security to a new hard problem Fixed Length Vector Problem (FLVP), which is harder than Shortest Vector Problem (SVP) on lattices. Secondly, considering the bound- ary on the distance between the message and its signature, we further propose an efficient Bo- undary-based Secure Network Coding (BSNC) algorithm to reduce the computing complexity induced by square calculation in DSNC. Sim- ulation results and security analysis show that the proposed signature schemes have stronger unforgeability due to the natural property of lattices than traditional Rivest-Shamir-Adleman (RSA)-based signature scheme. DSNC algo- rithm is more secure and BSNC algorithm greatly reduces the time cost on computation.
文摘In a multi-hop wireless mesh network, wireless links are vulnerable due to severe channel fading, interference and physical damage. In this paper, we will provide a coding scheme to protect fi'om multiple failures in wireless mesh networks to achieve high throughput where the redundancy is considered for the average number of failures. Our coding scheme is designed to protect fi'om the average number of failures to increase the network throughput. When the number of failures is more than the average case, the destination will have to walt for more coded packets in the following time slots.
文摘In a multi-hop wireless mesh network, wireless links are vulnerable due to severe channel fading, interference and physical damage. In this paper, we will provide a coding scheme to protect from multiple failures in wireless mesh networks to achieve high throughput where the redundancy is considered for the average number of failures. Our coding scheme is designed to protect from the average number of failures to increase the network throughput. When the number of failures is more than the average case, the destination will have to wait for more coded packets in the following time slots.
文摘Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every linear code can be used to construct secret sharing schemes. So, we use the parity-check matrix of a linear code to construct secret sharing schemes based on linear codes. We also describe some techniques to recover the secret and determine the access structure of the new scheme. In this paper, we use the Massey's secret sharing scheme.
基金supported by the National Science Council of the Republic of China(Grant No.NSC 98-2221-E-006-097-MY3)
文摘This study proposes a new coding function for the symmetric W state. Based on the new coding function, a theoretical protocol of deterministic quanama communication (DQC) is proposed. The sender can use the proposed coding function to encode his/her message, and the receiver can perform the imperfect Bell measurement to obtain the sender's message. In comparison to the existing DQC protocols that also use the W class state, the proposed protocol is more efficient and also more practical within today's technology. Moreover, the security of this protocol is analyzed to show that any eavesdropper will be detected with a very high probability under both the ideal and the noisy quantum channel.
基金supported by the National Natural Science Foundation of China(21822202,22072104)the National Key R&D Program of China(International Collaboration program)granted by Chinese Ministry of Science and Technology(2018YFE0200700)+1 种基金project funded by Suzhou Key Laboratory of Functional Nano&Soft Materials,Collaborative Innovation Center of Suzhou Nano Science&Technologythe 111 Project,Joint International Research Laboratory of Carbon-Based Functional Materials and Devices。
文摘Plasmonic encoding composed of metallic nanostructures makes a great contribution to the practical application of information encryption.However,most reports have so far shown the preparation of single or binary plasmonic encoding patterns because of the technical difficulty of assembling multiplex nanostructures on a single platform,which cannot satisfy the requirements of high encoding capacity for increasing information security.Herein,we developed a strategy based on plasma etching combined with in-situ growth to fabricate patterned arrays of quasi-three-dimensional(3-D)plasmonic Au nano-mushrooms with controlled morphologies,and successfully realized ideal high-capacity plasmonic encoding by arranging Au nano-mushrooms on one platform.On this basis,such multiplex encoding patterns have been transferred to the flexible substrate to realize the triple-mode encryption of the Morse code of"FUNSOM",indicating great prospects in the applications of information encryption and data storage.