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, an...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.展开更多
The application of χ state are investigated in remote state preparation (RSP). By constructing useful measurement bases with the aid of Hurwitz matrix equation, we propose several RSP schemes of arbitrary two- and ...The application of χ state are investigated in remote state preparation (RSP). By constructing useful measurement bases with the aid of Hurwitz matrix equation, we propose several RSP schemes of arbitrary two- and three-qubit states via the χ state as the entangled resource. It is shown that the original state can be successfully prepared with the probability 100% and 50% for real coefficients and complex coefficients, respectively. For the latter case, the special ensembles with unit success probability are discussed by the permutation group. It is worth mentioning that the novel measurement bases have no restrictions on the coefficients of the prepared state, which means that the proposed schemes are more applicable.展开更多
We present a(t,n)threshold multiparty controlled quantum teleportation protocol of an arbitrary m-qubitquantum state between two remote parties.The unknown m-qubit quantum state can be recovered by the receiver underc...We present a(t,n)threshold multiparty controlled quantum teleportation protocol of an arbitrary m-qubitquantum state between two remote parties.The unknown m-qubit quantum state can be recovered by the receiver undercontrol of a subset of the n controllers if the number of the subset is larger than or equal to a threshold,say,t,but not forany t —1 or fewer controllers.Our scheme seems to be more practical and more flexible than other existing protocols.Thequantum resource required is just m Einstein-Podolsky-Rosen(EPR)pairs plus some single photons.The techniquesrequired are only Bell state measurement,single-qubit unitary operation and von Neumann measurement.So our schemeis also feasible with present-day technique.展开更多
An efficient quantum key distribution (QKD) protocol with orthogonal product states in the 3 3 Hilbert space is presented. The sender, Alice, disorders the orthogonal product state sequence and sends it to Bob. Aft...An efficient quantum key distribution (QKD) protocol with orthogonal product states in the 3 3 Hilbert space is presented. The sender, Alice, disorders the orthogonal product state sequence and sends it to Bob. After Alice has published the matching information of the particle sequence, Bob recovers the correct correspondences and makes an orthogonal measurement on the orthogonal product states to obtain the information sent by Alice. Finally, security analysis is also made.展开更多
Recently, Mao, Zhang, Wu et al. constructed two key exchange(KE) protocols based on tensor ergodic problem(TEP). Although they conjectured that these constructions can potentially resist quantum computing attack, they...Recently, Mao, Zhang, Wu et al. constructed two key exchange(KE) protocols based on tensor ergodic problem(TEP). Although they conjectured that these constructions can potentially resist quantum computing attack, they did not provide a rigorous security proof for their KE protocols. In this paper, applying the properties of ergodic matrix, we first present a polynomial time algorithm to solve the TEP problem using O(n^6) arithmetic operations in the finite field, where n is the security parameter. Then, applying this polynomial time algorithm, we generate a common shared key for two TEP-based KE constructions, respectively. In addition, we also provide a polynomial time algorithm with O(n^6) arithmetic operations that directly recovers the plaintext from a ciphertext for the KE-based encryption scheme. Thus, the TEP-based KE protocols and their corresponding encryption schemes are insecure.展开更多
Quantum steganography that utilizes the quantum mechanical effect to achieve the purpose of information hiding is a popular topic of quantum information. Recently, E1 Allati et al. proposed a new quantum steganography...Quantum steganography that utilizes the quantum mechanical effect to achieve the purpose of information hiding is a popular topic of quantum information. Recently, E1 Allati et al. proposed a new quantum steganography using the GHZ4 state. Since all of the 8 groups of unitary transformations used in the secret message encoding rule change the GHZ4 state into 6 instead of 8 different quantum states when the global phase is not considered, we point out that a 2-bit instead of a 3-bit secret message can be encoded by one group of the given unitary transformations. To encode a 3-bit secret message by performing a group of unitary transformations on the GHZ4 state, we give another 8 groups of unitary transformations that can change the GHZ4 state into 8 different quantum states. Due to the symmetry of the GHZ4 state, all the possible 16 groups of unitary transformations change the GHZ4 state into 8 different quantum states, so the improved protocol achieves a high efficiency.展开更多
An eavesdropper(Eve)can exploit all the imperfections of a practical quantum key distribution(QKD)system to obtain some information about the secret key,no matter whether these imperfections are from the physical laye...An eavesdropper(Eve)can exploit all the imperfections of a practical quantum key distribution(QKD)system to obtain some information about the secret key,no matter whether these imperfections are from the physical layer or from the post-processing layer.We propose a possible attack on a passive detection QKD system based on the imperfection from the software layer.The analysis shows that Eve can obtain all the information about the key without being discovered.展开更多
We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotie...We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime p.If 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.展开更多
The simple continued fraction expansion of a single real number gives the best solution to its rational approximation problem. A multidimensional generalization of the simple continued fraction expanding procedure is ...The simple continued fraction expansion of a single real number gives the best solution to its rational approximation problem. A multidimensional generalization of the simple continued fraction expanding procedure is the Jacobi-Perron algorithm (JPA). This algorithm and展开更多
Orthomorphic permutations have good characteristics in cryptosystems. In this paper, by using of knowledge about relation between orthomorphic permutations and multi-output functions, and conceptions of the generalize...Orthomorphic permutations have good characteristics in cryptosystems. In this paper, by using of knowledge about relation between orthomorphic permutations and multi-output functions, and conceptions of the generalized Walsh spectrum of multi-output functions and the auto-correlation function of multi-output functions to investigate the Walsh spectral characteristics and the auto-correlation function characteristics of orthormophic permutations, several results are obtained.展开更多
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 st...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.展开更多
Unconditionally secure signature is an important part of quantum cryptography.Usually,a signature schemeonly provides an environment for a single signer.Nevertheless,in reai applications,many signers may collaborative...Unconditionally secure signature is an important part of quantum cryptography.Usually,a signature schemeonly provides an environment for a single signer.Nevertheless,in reai applications,many signers may collaborativelysend a message to the verifier and convince the verifier that the message is actually transmitted by them.In this paper,we give a scalable arbitrated signature protocol of classical messages with multi-signers.Its security is analyzed andproved to be secure even with a compromised arbitrator.展开更多
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 pro...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.展开更多
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 ...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.展开更多
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...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.展开更多
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...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.展开更多
In doubly-selective fading wireless channel,the conventional orthogonal frequency division multi-plexing(OFDM)receivers for inter-carrier interference(ICI)compensation require extensive computa-tions.To obtain an effe...In doubly-selective fading wireless channel,the conventional orthogonal frequency division multi-plexing(OFDM)receivers for inter-carrier interference(ICI)compensation require extensive computa-tions.To obtain an effective balance between performance and complexity,the whole channel responsematrix was decomposed into a sequence of submatrix,and then a novel equalizer based on minimum meansquare error(MMSE)criterion was presented to combat the ICI.Furthermore,a simple ordering-baseddecision-feedback equalizer(DFE)was derived to exploit the temperal diversity gain offered by mobilechannels.Numerical studies illustrate that although the MMSE equalizer still suffers from error floor,whereas the DFE equalizer exhibits significant performance improvement.The advantage of the proposedscheme indicates its potential applications in the future broadband wireless systems.展开更多
We propose a (L, n)-threshold quantum secret sharing protocol of secure direct communication following some ideas of Zhang's protocol [Phys. Lett. A 342 (2005) 60] and Tokunaga et al.'s protocol [Phys. Rev. A 71...We propose a (L, n)-threshold quantum secret sharing protocol of secure direct communication following some ideas of Zhang's protocol [Phys. Lett. A 342 (2005) 60] and Tokunaga et al.'s protocol [Phys. Rev. A 71 (2005) 012314]. The sender distributes the classical secret shares to his or her n agents and each agent owns a secret share in advance. The sender's secure direct communication message can be extracted by an agent subset by collaboration in such a way that at least t or more agents can obtain the secret message with the mutual assistances but any t - 1 or fewer agents cannot. In contrast to the previous multiparty quantum secret sharing protocols in which the sender's secret message can be recovered only if all the agents collaborate, our protocol is more practical and more flexible.展开更多
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 mechani...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.展开更多
To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation o...To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation of Boolean functions is proposed. The proposed method is used to construct Boolean functions with an odd number of variables and with maximum algebraic immunity. We also discuss the nonlinearity of the constructed functions. Moreover, a lower bound is determined for the number of Boolean functions with maximum algebraic immunity.展开更多
基金supported by the National Natural Science Foundation of China(Grant Nos.61303199,61272514,61170272,61121061,and 61411146001)the Shandong Provincial Natural Science Foundation of China(Grant Nos.ZR2013FM025,ZR2013FQ001,and ZR2014FM003)+4 种基金the Shandong Provincial Outstanding Research Award Fund for Young Scientists of China(Grant Nos.BS2013DX010 and BS2014DX007)the Program for New Century Excellent Talents in Universities,China(Grant No.NCET-13-0681)the National Development Foundation for Cryptological Research,China(Grant No.MMJJ201401012)the Fok Ying Tong Education Foundation,China(Grant No.131067)the Shandong Academy of Sciences Youth Fund Project,China(Grant No.2013QN007)
文摘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.
基金supported by the National Natural Science Foundation of China(Grant Nos.61201253 and 61303039)the Fundamental Research Funds for the Central Universities of China(Grant No.2682014CX095)
文摘The application of χ state are investigated in remote state preparation (RSP). By constructing useful measurement bases with the aid of Hurwitz matrix equation, we propose several RSP schemes of arbitrary two- and three-qubit states via the χ state as the entangled resource. It is shown that the original state can be successfully prepared with the probability 100% and 50% for real coefficients and complex coefficients, respectively. For the latter case, the special ensembles with unit success probability are discussed by the permutation group. It is worth mentioning that the novel measurement bases have no restrictions on the coefficients of the prepared state, which means that the proposed schemes are more applicable.
基金Supported by the National Basic Research Program of China (973 Program) under Grant No.2007CB311100the National Natural Science Foundation of China under Grant No.60873191+3 种基金the National High Technology Research and Development Program of China under Grant No.2006AA01Z419the Major Research plan of the National Natural Science Foundation of China under Grant No.90604023the Scientific Research Common Program of Beijing Municipal Commission of Education under Grant No.KM200810005004the Scientific Research Foundation for the Youth of Beijing University of Technology under Grant No.97007016200701
文摘We present a(t,n)threshold multiparty controlled quantum teleportation protocol of an arbitrary m-qubitquantum state between two remote parties.The unknown m-qubit quantum state can be recovered by the receiver undercontrol of a subset of the n controllers if the number of the subset is larger than or equal to a threshold,say,t,but not forany t —1 or fewer controllers.Our scheme seems to be more practical and more flexible than other existing protocols.Thequantum resource required is just m Einstein-Podolsky-Rosen(EPR)pairs plus some single photons.The techniquesrequired are only Bell state measurement,single-qubit unitary operation and von Neumann measurement.So our schemeis also feasible with present-day technique.
基金Project supported by the National High Technology Development Program of China (Grant Nos 2006AA01Z419 and 2006AA01Z440), the Major Program of the National Natural Science Foundation of China (Grant No 90604023), the National Research Foundation for the Doctoral Program of Higher Education of China (Grant No 20040013007), National Laboratory for Modern Communications Science Foundation of China (Grant No 9140C110101.0.601).
文摘An efficient quantum key distribution (QKD) protocol with orthogonal product states in the 3 3 Hilbert space is presented. The sender, Alice, disorders the orthogonal product state sequence and sends it to Bob. After Alice has published the matching information of the particle sequence, Bob recovers the correct correspondences and makes an orthogonal measurement on the orthogonal product states to obtain the information sent by Alice. Finally, security analysis is also made.
基金supported by the National Natural Science Foundation of China(No.61672270,61602216,61702236)the Qing Lan Project for Young Researchers of Jiangsu Province of China(No.KYQ14004)+1 种基金the Open Fund of State Key Laboratory of Information Security,Institute of Information Engineering,Chinese Academy of Sciences(No.2015-MSB-10)Jiangsu Overseas Research&Training Program for University Prominent Young&Middle-aged Teachers and Presidents,Changzhou Sci&Tech Program,(Grant No.CJ20179027)
文摘Recently, Mao, Zhang, Wu et al. constructed two key exchange(KE) protocols based on tensor ergodic problem(TEP). Although they conjectured that these constructions can potentially resist quantum computing attack, they did not provide a rigorous security proof for their KE protocols. In this paper, applying the properties of ergodic matrix, we first present a polynomial time algorithm to solve the TEP problem using O(n^6) arithmetic operations in the finite field, where n is the security parameter. Then, applying this polynomial time algorithm, we generate a common shared key for two TEP-based KE constructions, respectively. In addition, we also provide a polynomial time algorithm with O(n^6) arithmetic operations that directly recovers the plaintext from a ciphertext for the KE-based encryption scheme. Thus, the TEP-based KE protocols and their corresponding encryption schemes are insecure.
基金supported by the National Natural Science Foundation of China (Grant Nos. 61170272,61272514,61003287,and 61070163)the Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20100005120002)+3 种基金the Fok Ying Tong Education Foundation (Grant No. 131067)the Natural Science Foundation of Shandong Province,China (Grant No. ZR2011FM023)the Outstanding Research Award Fund for Young Scientists of Shandong Province,China (Grant No. BS2011DX034)the Fundamental Research Funds for Central Universities of China (Grant No. BUPT2012RC0221)
文摘Quantum steganography that utilizes the quantum mechanical effect to achieve the purpose of information hiding is a popular topic of quantum information. Recently, E1 Allati et al. proposed a new quantum steganography using the GHZ4 state. Since all of the 8 groups of unitary transformations used in the secret message encoding rule change the GHZ4 state into 6 instead of 8 different quantum states when the global phase is not considered, we point out that a 2-bit instead of a 3-bit secret message can be encoded by one group of the given unitary transformations. To encode a 3-bit secret message by performing a group of unitary transformations on the GHZ4 state, we give another 8 groups of unitary transformations that can change the GHZ4 state into 8 different quantum states. Due to the symmetry of the GHZ4 state, all the possible 16 groups of unitary transformations change the GHZ4 state into 8 different quantum states, so the improved protocol achieves a high efficiency.
基金by the Natural Science Foundation of China under Grant Nos 60803156 and 61070215the Open Research Fund of State Key Laboratory of Information Security under Grant No 01-07.
文摘An eavesdropper(Eve)can exploit all the imperfections of a practical quantum key distribution(QKD)system to obtain some information about the secret key,no matter whether these imperfections are from the physical layer or from the post-processing layer.We propose a possible attack on a passive detection QKD system based on the imperfection from the software layer.The analysis shows that Eve can obtain all the information about the key without being discovered.
基金the National Natural Science Foundation of China,the Open Funds of State Key Laboratory of Information Security (Chinese Academy of Sciences),the Program for New Century Excellent Talents in Fujian Province University
文摘We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime p.If 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.
基金This work is partly supported by NSFC(No. 60173016)the National 973 Project(No.1999035804)
文摘The simple continued fraction expansion of a single real number gives the best solution to its rational approximation problem. A multidimensional generalization of the simple continued fraction expanding procedure is the Jacobi-Perron algorithm (JPA). This algorithm and
基金Supported by State Key Laboratory of InformationSecurity Opening Foundation(01-02) .
文摘Orthomorphic permutations have good characteristics in cryptosystems. In this paper, by using of knowledge about relation between orthomorphic permutations and multi-output functions, and conceptions of the generalized Walsh spectrum of multi-output functions and the auto-correlation function of multi-output functions to investigate the Walsh spectral characteristics and the auto-correlation function characteristics of orthormophic permutations, several results are obtained.
基金Project supported by the National Natural Science Foundation of China (Grant No. 61173157)the Strategy Pilot Project of Chinese Academy of Sciences (Grant No. XDA06010702)
文摘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.
基金Supported by the National High-Tech Research,Development Plan of China under Grant Nos.2006AA01Z440,2009AA012441,2009AA012437National Basic Research Program of China (973 Program 2007CB311100)+4 种基金the National Natural Science Foundation of China under Grant Nos.60873191 and 60821001Specialized Research Fund for the Doctoral Program of Higher Education under Grant Nos.20091103120014,20090005110010Beijing Natural Science Foundation under Grant Nos.1093015,1102004the Scientific Research Common Program of Beijing Municipal Commission of Education under Grant No.KM200810005004the ISN Open Foundation
文摘Unconditionally secure signature is an important part of quantum cryptography.Usually,a signature schemeonly provides an environment for a single signer.Nevertheless,in reai applications,many signers may collaborativelysend a message to the verifier and convince the verifier that the message is actually transmitted by them.In this paper,we give a scalable arbitrated signature protocol of classical messages with multi-signers.Its security is analyzed andproved to be secure even with a compromised arbitrator.
基金supported by National Science and Technology Major Project under Grant No.2012ZX03002003Funds of Key Lab of Fujian Province University Network Security and Cryptology under Grant No.2011009Open Research Project of State Key Laboratory of Information Security in Institute of Software,Chinese Academy of Sciences
文摘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.
基金supported by the National Natural Science Foundation of China under Grant No.61003278,No.61073150 and No.61202371Innovation Program of Shanghai Municipal Education Commission under Grant No.14ZZ066+5 种基金the open research fund of State Key Laboratory of Information Securitythe Opening Project of Shanghai Key Laboratory of Integrate Administration Technologies for Information Securitythe Fundamental Research Funds for the Central Universities,National Key Basic Research Program of China under Grant No.2013CB338004China Postdoctoral Science Foundation under Grant No.2012M521829Shanghai Postdoctoral Research Funding Program under Grant No.12R21414500the National Social Science Foundation of China under Grant No.13CFX054
文摘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.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61272501,61272514,61170272,61472048,61402058,61121061,and 61411146001)the Program for New Century Excellent Talents in University of China(Grant No.NCET-13-0681)+4 种基金the National Development Foundation for Cryptological Research(Grant No.MMJJ201401012)the Fok Ying Tong Education Foundation(Grant No.131067)the Natural Science Foundation of Beijing(Grant Nos.4132056 and 4152038)the Postdoctoral Science Foundation of China(Grant No.2014M561826)the National Key Basic Research Program,China(Grant No.2012CB315905)
文摘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.
基金supported in part by the Testbed@TWISC, National Science Council under the Grant No. 100-2219-E-006-001in part by National Natural Science Foundation of China under the Grant No. 60903210
文摘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.
基金Supported by the National Natural Science Foundation of China (No. 60573112)
文摘In doubly-selective fading wireless channel,the conventional orthogonal frequency division multi-plexing(OFDM)receivers for inter-carrier interference(ICI)compensation require extensive computa-tions.To obtain an effective balance between performance and complexity,the whole channel responsematrix was decomposed into a sequence of submatrix,and then a novel equalizer based on minimum meansquare error(MMSE)criterion was presented to combat the ICI.Furthermore,a simple ordering-baseddecision-feedback equalizer(DFE)was derived to exploit the temperal diversity gain offered by mobilechannels.Numerical studies illustrate that although the MMSE equalizer still suffers from error floor,whereas the DFE equalizer exhibits significant performance improvement.The advantage of the proposedscheme indicates its potential applications in the future broadband wireless systems.
基金Supported by the National Basic Research Programme of China under Grant No 2007CB311100, the National High Technology Research and Development Programme of China under Grant No 2006AA01Z419, the National Natural Science Foundation of China under Grant No 60873191, the Major Research Plan of the National Natural Science Foundation of China under Grant No 90604023, the Scientific Research Common Programme of Beijing Municipal Commission of Education under Grant No KM200810005004, the Scientific Research Foundation for the Youth of Beijing University of Technology under Grant No 97007016200701, and the ISN Open Foundation.
文摘We propose a (L, n)-threshold quantum secret sharing protocol of secure direct communication following some ideas of Zhang's protocol [Phys. Lett. A 342 (2005) 60] and Tokunaga et al.'s protocol [Phys. Rev. A 71 (2005) 012314]. The sender distributes the classical secret shares to his or her n agents and each agent owns a secret share in advance. The sender's secure direct communication message can be extracted by an agent subset by collaboration in such a way that at least t or more agents can obtain the secret message with the mutual assistances but any t - 1 or fewer agents cannot. In contrast to the previous multiparty quantum secret sharing protocols in which the sender's secret message can be recovered only if all the agents collaborate, our protocol is more practical and more flexible.
基金supported in part by National Natural Science Foundation of China(NSFC)under Grant No.61100228 and 61202479the National High-tech R&D Program of China under Grant No.2012AA013101+1 种基金the Strategic Priority Research Program of the Chinese Academy of Sciences under Grant No.XDA06030601 and XDA06010701Open Found of Key Laboratory of IOT Application Technology of Universities in Yunnan Province Grant No.2015IOT03
文摘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.
基金This work was supported by the National Natural Science Foundation of China under Grants No. 61103191, No. 61070215 the Funds of Key Lab of Fujian Province University Network Security and Cryptology under Crant No. 2011003 and the Open Research Fund of State Key Laboratory of Inforrmtion Security.
文摘To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation of Boolean functions is proposed. The proposed method is used to construct Boolean functions with an odd number of variables and with maximum algebraic immunity. We also discuss the nonlinearity of the constructed functions. Moreover, a lower bound is determined for the number of Boolean functions with maximum algebraic immunity.