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.展开更多
We present a （t, .n） threshold multiparty controlled quantum teleportation protocol of an arbitrary m-qubit quantum state between two remote parties. The unknown m-qubit quantum state can be recovered by the receive...We present a （t, .n） threshold multiparty controlled quantum teleportation protocol of an arbitrary m-qubit quantum state between two remote parties. The unknown m-qubit quantum state can be recovered by the receiver under control 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 for any t - 1 or fewer controllers. Our scheme seems to be more practical and more flexible than other existing protocols. The quantum resource required is just m Einstein-Podolsky-Rosen （EPR） pairs plus some single photons. The techniques required are only Bell state measurement, single-qubit unitary operation and yon Neumann measurement. So our scheme is also feasible with present-day technique.展开更多
In this paper,a model with two mutual learning neural networks named Tree Parity Machine(TPM) is firstly introduced,as well as its cryptographic property of weight synchronization with that of chaos cryptography is co...In this paper,a model with two mutual learning neural networks named Tree Parity Machine(TPM) is firstly introduced,as well as its cryptographic property of weight synchronization with that of chaos cryptography is comparatively discussed. A full empirical study on the stability and security of the TPM weight synchronization is conducted in detail. Then two improvement methods for the weight synchronization are proposed. Experiment results show that the improved TPM synchronization model can be efficiently against the third party attack. At last,a lightweight TPM-based key management scheme is proposed for TinySec on wireless sensor networks,which is full implemented on the Mica2 node and the performance test result is acceptable.展开更多
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.展开更多
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.展开更多
Intelligent penetration testing is of great significance for the improvement of the security of information systems,and the critical issue is the planning of penetration test paths.In view of the difficulty for attack...Intelligent penetration testing is of great significance for the improvement of the security of information systems,and the critical issue is the planning of penetration test paths.In view of the difficulty for attackers to obtain complete network information in realistic network scenarios,Reinforcement Learning(RL)is a promising solution to discover the optimal penetration path under incomplete information about the target network.Existing RL-based methods are challenged by the sizeable discrete action space,which leads to difficulties in the convergence.Moreover,most methods still rely on experts’knowledge.To address these issues,this paper proposes a penetration path planning method based on reinforcement learning with episodic memory.First,the penetration testing problem is formally described in terms of reinforcement learning.To speed up the training process without specific prior knowledge,the proposed algorithm introduces episodic memory to store experienced advantageous strategies for the first time.Furthermore,the method offers an exploration strategy based on episodic memory to guide the agents in learning.The design makes full use of historical experience to achieve the purpose of reducing blind exploration and improving planning efficiency.Ultimately,comparison experiments are carried out with the existing RL-based methods.The results reveal that the proposed method has better convergence performance.The running time is reduced by more than 20%.展开更多
Blockchain has been widely used in finance,the Internet of Things(IoT),supply chains,and other scenarios as a revolutionary technology.Consensus protocol plays a vital role in blockchain,which helps all participants t...Blockchain has been widely used in finance,the Internet of Things(IoT),supply chains,and other scenarios as a revolutionary technology.Consensus protocol plays a vital role in blockchain,which helps all participants to maintain the storage state consistently.However,with the improvement of network environment complexity and system scale,blockchain development is limited by the performance,security,and scalability of the consensus protocol.To address this problem,this paper introduces the collaborative filtering mechanism commonly used in the recommendation system into the Practical Byzantine Fault Tolerance(PBFT)and proposes a Byzantine fault-tolerant(BFT)consensus protocol based on collaborative filtering recommendation(CRBFT).Specifically,an improved collaborative filtering recommendation method is designed to use the similarity between a node’s recommendation opinions and those of the recommender as a basis for determining whether to adopt the recommendation opinions.This can amplify the recommendation voice of good nodes,weaken the impact of cunningmalicious nodes on the trust value calculation,andmake the calculated resultsmore accurate.In addition,the nodes are given voting power according to their trust value,and a weight randomelection algorithm is designed and implemented to reduce the risk of attack.The experimental results show that CRBFT can effectively eliminate various malicious nodes and improve the performance of blockchain systems in complex network environments,and the feasibility of CRBFT is also proven by theoretical analysis.展开更多
Big data resources are characterized by large scale, wide sources, and strong dynamics. Existing access controlmechanisms based on manual policy formulation by security experts suffer from drawbacks such as low policy...Big data resources are characterized by large scale, wide sources, and strong dynamics. Existing access controlmechanisms based on manual policy formulation by security experts suffer from drawbacks such as low policymanagement efficiency and difficulty in accurately describing the access control policy. To overcome theseproblems, this paper proposes a big data access control mechanism based on a two-layer permission decisionstructure. This mechanism extends the attribute-based access control (ABAC) model. Business attributes areintroduced in the ABAC model as business constraints between entities. The proposed mechanism implementsa two-layer permission decision structure composed of the inherent attributes of access control entities and thebusiness attributes, which constitute the general permission decision algorithm based on logical calculation andthe business permission decision algorithm based on a bi-directional long short-term memory (BiLSTM) neuralnetwork, respectively. The general permission decision algorithm is used to implement accurate policy decisions,while the business permission decision algorithm implements fuzzy decisions based on the business constraints.The BiLSTM neural network is used to calculate the similarity of the business attributes to realize intelligent,adaptive, and efficient access control permission decisions. Through the two-layer permission decision structure,the complex and diverse big data access control management requirements can be satisfied by considering thesecurity and availability of resources. Experimental results show that the proposed mechanism is effective andreliable. In summary, it can efficiently support the secure sharing of big data resources.展开更多
To address the challenges of video copyright protection and ensure the perfect recovery of original video,we propose a dual-domain watermarking scheme for digital video,inspired by Robust Reversible Watermarking(RRW)t...To address the challenges of video copyright protection and ensure the perfect recovery of original video,we propose a dual-domain watermarking scheme for digital video,inspired by Robust Reversible Watermarking(RRW)technology used in digital images.Our approach introduces a parameter optimization strategy that incre-mentally adjusts scheme parameters through attack simulation fitting,allowing for adaptive tuning of experimental parameters.In this scheme,the low-frequency Polar Harmonic Transform(PHT)moment is utilized as the embedding domain for robust watermarking,enhancing stability against simulation attacks while implementing the parameter optimization strategy.Through extensive attack simulations across various digital videos,we identify the optimal low-frequency PHT moment using adaptive normalization.Subsequently,the embedding parameters for robust watermarking are adaptively adjusted to maximize robustness.To address computational efficiency and practical requirements,the unnormalized high-frequency PHT moment is selected as the embedding domain for reversible watermarking.We optimize the traditional single-stage extended transform dithering modulation(STDM)to facilitate multi-stage embedding in the dual-domain watermarking process.In practice,the video embedded with a robust watermark serves as the candidate video.This candidate video undergoes simulation according to the parameter optimization strategy to balance robustness and embedding capacity,with adaptive determination of embedding strength.The reversible watermarking is formed by combining errors and other information,utilizing recursive coding technology to ensure reversibility without attacks.Comprehensive analyses of multiple performance indicators demonstrate that our scheme exhibits strong robustness against Common Signal Processing(CSP)and Geometric Deformation(GD)attacks,outperforming other advanced video watermarking algorithms under similar conditions of invisibility,reversibility,and embedding capacity.This underscores the effectiveness and feasibility of our attack simulation fitting strategy.展开更多
The proposed robust reversible watermarking algorithm addresses the compatibility challenges between robustness and reversibility in existing video watermarking techniques by leveraging scene smoothness for frame grou...The proposed robust reversible watermarking algorithm addresses the compatibility challenges between robustness and reversibility in existing video watermarking techniques by leveraging scene smoothness for frame grouping videos.Grounded in the H.264 video coding standard,the algorithm first employs traditional robust watermark stitching technology to embed watermark information in the low-frequency coefficient domain of the U channel.Subsequently,it utilizes histogram migration techniques in the high-frequency coefficient domain of the U channel to embed auxiliary information,enabling successful watermark extraction and lossless recovery of the original video content.Experimental results demonstrate the algorithm’s strong imperceptibility,with each embedded frame in the experimental videos achieving a mean peak signal-to-noise ratio of 49.3830 dB and a mean structural similarity of 0.9996.Compared with the three comparison algorithms,the performance of the two experimental indexes is improved by 7.59%and 0.4%on average.At the same time,the proposed algorithm has strong robustness to both offline and online attacks:In the face of offline attacks,the average normalized correlation coefficient between the extracted watermark and the original watermark is 0.9989,and the average bit error rate is 0.0089.In the face of online attacks,the normalized correlation coefficient between the extracted watermark and the original watermark is 0.8840,and the mean bit error rate is 0.2269.Compared with the three comparison algorithms,the performance of the two experimental indexes is improved by 1.27%and 18.16%on average,highlighting the algorithm’s robustness.Furthermore,the algorithm exhibits low computational complexity,with the mean encoding and the mean decoding time differentials during experimental video processing being 3.934 and 2.273 s,respectively,underscoring its practical utility.展开更多
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.展开更多
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.展开更多
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.展开更多
Unconditionally secure signature is an important part of quantum cryptography. Usually, a signature scheme only provides an environment for a single signer. Nevertheless, in real applications, many signers may collabo...Unconditionally secure signature is an important part of quantum cryptography. Usually, a signature scheme only provides an environment for a single signer. Nevertheless, in real applications, many signers may collaboratively send 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 proved to be secure even with a compromised arbitrator. messages with multi-signers. Its security is analyzed and proved to be secure even with a compromised arbitrator.展开更多
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.展开更多
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.展开更多
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.展开更多
基金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 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-qubit quantum state between two remote parties. The unknown m-qubit quantum state can be recovered by the receiver under control 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 for any t - 1 or fewer controllers. Our scheme seems to be more practical and more flexible than other existing protocols. The quantum resource required is just m Einstein-Podolsky-Rosen （EPR） pairs plus some single photons. The techniques required are only Bell state measurement, single-qubit unitary operation and yon Neumann measurement. So our scheme is also feasible with present-day technique.
基金supported by the following funds:the Open Fund of the State Key Laboratory of Software Development Environment under Grant No.SKLSDE- 2009KF-2-01Beihang University, the National Basic Research Program of China (973 Program) under Grant No. 2005CB321901 and No.2010CB328106-3+1 种基金the Natural Science Foundation of China under Grant No.60773115the Open Fund of the Zhejiang Provincial Key Laboratory of Information Security
文摘In this paper,a model with two mutual learning neural networks named Tree Parity Machine(TPM) is firstly introduced,as well as its cryptographic property of weight synchronization with that of chaos cryptography is comparatively discussed. A full empirical study on the stability and security of the TPM weight synchronization is conducted in detail. Then two improvement methods for the weight synchronization are proposed. Experiment results show that the improved TPM synchronization model can be efficiently against the third party attack. At last,a lightweight TPM-based key management scheme is proposed for TinySec on wireless sensor networks,which is full implemented on the Mica2 node and the performance test result is acceptable.
基金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.
基金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.
文摘Intelligent penetration testing is of great significance for the improvement of the security of information systems,and the critical issue is the planning of penetration test paths.In view of the difficulty for attackers to obtain complete network information in realistic network scenarios,Reinforcement Learning(RL)is a promising solution to discover the optimal penetration path under incomplete information about the target network.Existing RL-based methods are challenged by the sizeable discrete action space,which leads to difficulties in the convergence.Moreover,most methods still rely on experts’knowledge.To address these issues,this paper proposes a penetration path planning method based on reinforcement learning with episodic memory.First,the penetration testing problem is formally described in terms of reinforcement learning.To speed up the training process without specific prior knowledge,the proposed algorithm introduces episodic memory to store experienced advantageous strategies for the first time.Furthermore,the method offers an exploration strategy based on episodic memory to guide the agents in learning.The design makes full use of historical experience to achieve the purpose of reducing blind exploration and improving planning efficiency.Ultimately,comparison experiments are carried out with the existing RL-based methods.The results reveal that the proposed method has better convergence performance.The running time is reduced by more than 20%.
基金supported by the National Natural Science Foundation of China(Grant No.62102449)awarded to W.J.Wang.
文摘Blockchain has been widely used in finance,the Internet of Things(IoT),supply chains,and other scenarios as a revolutionary technology.Consensus protocol plays a vital role in blockchain,which helps all participants to maintain the storage state consistently.However,with the improvement of network environment complexity and system scale,blockchain development is limited by the performance,security,and scalability of the consensus protocol.To address this problem,this paper introduces the collaborative filtering mechanism commonly used in the recommendation system into the Practical Byzantine Fault Tolerance(PBFT)and proposes a Byzantine fault-tolerant(BFT)consensus protocol based on collaborative filtering recommendation(CRBFT).Specifically,an improved collaborative filtering recommendation method is designed to use the similarity between a node’s recommendation opinions and those of the recommender as a basis for determining whether to adopt the recommendation opinions.This can amplify the recommendation voice of good nodes,weaken the impact of cunningmalicious nodes on the trust value calculation,andmake the calculated resultsmore accurate.In addition,the nodes are given voting power according to their trust value,and a weight randomelection algorithm is designed and implemented to reduce the risk of attack.The experimental results show that CRBFT can effectively eliminate various malicious nodes and improve the performance of blockchain systems in complex network environments,and the feasibility of CRBFT is also proven by theoretical analysis.
基金Key Research and Development and Promotion Program of Henan Province(No.222102210069)Zhongyuan Science and Technology Innovation Leading Talent Project(224200510003)National Natural Science Foundation of China(No.62102449).
文摘Big data resources are characterized by large scale, wide sources, and strong dynamics. Existing access controlmechanisms based on manual policy formulation by security experts suffer from drawbacks such as low policymanagement efficiency and difficulty in accurately describing the access control policy. To overcome theseproblems, this paper proposes a big data access control mechanism based on a two-layer permission decisionstructure. This mechanism extends the attribute-based access control (ABAC) model. Business attributes areintroduced in the ABAC model as business constraints between entities. The proposed mechanism implementsa two-layer permission decision structure composed of the inherent attributes of access control entities and thebusiness attributes, which constitute the general permission decision algorithm based on logical calculation andthe business permission decision algorithm based on a bi-directional long short-term memory (BiLSTM) neuralnetwork, respectively. The general permission decision algorithm is used to implement accurate policy decisions,while the business permission decision algorithm implements fuzzy decisions based on the business constraints.The BiLSTM neural network is used to calculate the similarity of the business attributes to realize intelligent,adaptive, and efficient access control permission decisions. Through the two-layer permission decision structure,the complex and diverse big data access control management requirements can be satisfied by considering thesecurity and availability of resources. Experimental results show that the proposed mechanism is effective andreliable. In summary, it can efficiently support the secure sharing of big data resources.
基金supported in part by the National Natural Science Foundation of China under Grant 62202496,62272478the Basic Frontier Innovation Project of Engineering University of People Armed Police under Grant WJY202314,WJY202221.
文摘To address the challenges of video copyright protection and ensure the perfect recovery of original video,we propose a dual-domain watermarking scheme for digital video,inspired by Robust Reversible Watermarking(RRW)technology used in digital images.Our approach introduces a parameter optimization strategy that incre-mentally adjusts scheme parameters through attack simulation fitting,allowing for adaptive tuning of experimental parameters.In this scheme,the low-frequency Polar Harmonic Transform(PHT)moment is utilized as the embedding domain for robust watermarking,enhancing stability against simulation attacks while implementing the parameter optimization strategy.Through extensive attack simulations across various digital videos,we identify the optimal low-frequency PHT moment using adaptive normalization.Subsequently,the embedding parameters for robust watermarking are adaptively adjusted to maximize robustness.To address computational efficiency and practical requirements,the unnormalized high-frequency PHT moment is selected as the embedding domain for reversible watermarking.We optimize the traditional single-stage extended transform dithering modulation(STDM)to facilitate multi-stage embedding in the dual-domain watermarking process.In practice,the video embedded with a robust watermark serves as the candidate video.This candidate video undergoes simulation according to the parameter optimization strategy to balance robustness and embedding capacity,with adaptive determination of embedding strength.The reversible watermarking is formed by combining errors and other information,utilizing recursive coding technology to ensure reversibility without attacks.Comprehensive analyses of multiple performance indicators demonstrate that our scheme exhibits strong robustness against Common Signal Processing(CSP)and Geometric Deformation(GD)attacks,outperforming other advanced video watermarking algorithms under similar conditions of invisibility,reversibility,and embedding capacity.This underscores the effectiveness and feasibility of our attack simulation fitting strategy.
基金supported in part by the National Natural Science Foundation of China under Grants 62202496,62272478the Basic Frontier Innovation Project of Engineering university of People Armed Police under Grants WJY202314,WJY202221.
文摘The proposed robust reversible watermarking algorithm addresses the compatibility challenges between robustness and reversibility in existing video watermarking techniques by leveraging scene smoothness for frame grouping videos.Grounded in the H.264 video coding standard,the algorithm first employs traditional robust watermark stitching technology to embed watermark information in the low-frequency coefficient domain of the U channel.Subsequently,it utilizes histogram migration techniques in the high-frequency coefficient domain of the U channel to embed auxiliary information,enabling successful watermark extraction and lossless recovery of the original video content.Experimental results demonstrate the algorithm’s strong imperceptibility,with each embedded frame in the experimental videos achieving a mean peak signal-to-noise ratio of 49.3830 dB and a mean structural similarity of 0.9996.Compared with the three comparison algorithms,the performance of the two experimental indexes is improved by 7.59%and 0.4%on average.At the same time,the proposed algorithm has strong robustness to both offline and online attacks:In the face of offline attacks,the average normalized correlation coefficient between the extracted watermark and the original watermark is 0.9989,and the average bit error rate is 0.0089.In the face of online attacks,the normalized correlation coefficient between the extracted watermark and the original watermark is 0.8840,and the mean bit error rate is 0.2269.Compared with the three comparison algorithms,the performance of the two experimental indexes is improved by 1.27%and 18.16%on average,highlighting the algorithm’s robustness.Furthermore,the algorithm exhibits low computational complexity,with the mean encoding and the mean decoding time differentials during experimental video processing being 3.934 and 2.273 s,respectively,underscoring its practical utility.
基金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 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.
基金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 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 scheme only provides an environment for a single signer. Nevertheless, in real applications, many signers may collaboratively send 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 proved to be secure even with a compromised arbitrator. messages with multi-signers. Its security is analyzed and proved to be secure even with a compromised arbitrator.
基金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 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.
基金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.
