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.展开更多
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.展开更多
In this paper,we propose an opportunistic decoding method to enhance the reconstruction of unequal erasure protected scalable coded source.This method explores some non-channel-decodable symbols of the received packet...In this paper,we propose an opportunistic decoding method to enhance the reconstruction of unequal erasure protected scalable coded source.This method explores some non-channel-decodable symbols of the received packets by opportunistically utilizing the structure information of joint source-channel coding scheme.As a result,a longer prefix of source coded stream may be obtained to enhance the reconstruction of scalable coded source.Experiment results indicate that opportunistic decoding at the receiver can improve the quality of the reconstructed source when channel decoding fails to recover all the source symbols.展开更多
Based on grow tree composite model, Finite Field Wavelet Grow Tree (FW-GT) was proposed in this paper. FW-GT is a novel framework to be used in data encryption enhancing data security. It is implemented by replacement...Based on grow tree composite model, Finite Field Wavelet Grow Tree (FW-GT) was proposed in this paper. FW-GT is a novel framework to be used in data encryption enhancing data security. It is implemented by replacement operator and wavelet operator. Forward integration and inverse decomposition of FW-GT are performed by replacement, inverse wavelets and its corresponding replacement, wavelet transforms. Replacement operator joined nonlinear factor, wavelet operator completed data transformation between lower dimensional space and higher dimensional space. FW-GT security relies on the difficulty of solving nonlinear equations over finite fields. By using FW-GT, high security of data could be obtained at the cost of low computational complexity. It proved FW-GT algorithm’s correctness in this paper. The experimental result and theory analysis shows the excellent performance of the algorithm.展开更多
Digital watermarking has been proposed for the copyright protections of multimedia products. In this paper, a robust and blind watermarking scheme is presented. The concept of communication with side information is ap...Digital watermarking has been proposed for the copyright protections of multimedia products. In this paper, a robust and blind watermarking scheme is presented. The concept of communication with side information is applied at the encoder to improve the probability of detection within acceptable fidelity, while the template matching technique is employed to estimate the undergone attacks in attacking channel. This scheme is optimized by the optimal design of the encoder to match with the media content and the decoder to adapt to the attack channel state. Experiments show that our method is robust against some common attacks such as filtering, compression, rotation, scaling, cropping and translation. It can be applied to both color and gray images.展开更多
The probabilities of the state transitions of the initial value So in the S table of RC4 are described by a kind of bistochastic matrices, and then a computational formula for such bistochastic matrices is given, by w...The probabilities of the state transitions of the initial value So in the S table of RC4 are described by a kind of bistochastic matrices, and then a computational formula for such bistochastic matrices is given, by which the mathematical expectation of the number of fixed points in the key extending algorithm of RC4 is obtained. As a result, a statistical weakness of the key extending algorithm of RC4 is presented.展开更多
The global avalanche characteristics (the sum- of-squares indicator and the absolute indicator) measure the overall avalanche characteristics of a cryptographic Boolean function. Sung et al. (1999) gave the lower ...The global avalanche characteristics (the sum- of-squares indicator and the absolute indicator) measure the overall avalanche characteristics of a cryptographic Boolean function. Sung et al. (1999) gave the lower bound on the sum- of-squares indicator for a balanced Boolean function satisfy- ing the propagation criterion with respect to some vectors. In this paper, if balanced Boolean functions satisfy the propaga- tion criterion with respect to some vectors, we give three nec- essary and sufficient conditions on the auto-correlation distri- bution of these functions reaching the minimum the bound on the sum-of-squares indicator. And we also find all Boolean functions with 3-variable, 4-variable, and 5-variable reaching the minimum the bound on the sum-of-squares indicator.展开更多
A delegateable signature scheme (DSS) which was first introduced by Barak is mainly based on the non-interactive zero-knowledge proof (NIZK) for preventing the signing verifier from telling which witness (i.e., r...A delegateable signature scheme (DSS) which was first introduced by Barak is mainly based on the non-interactive zero-knowledge proof (NIZK) for preventing the signing verifier from telling which witness (i.e., restricted subset) is being used. However, the scheme is not significantly efficient due to the difficulty of constructing NIZK. We first show that a non-interactive witness indistinguishable (NlWl) proof system and a non-interactive witness hiding (NIWH) proof system are easier and more efficient proof models than NIZK in some cases. Furthermore, the witnesses em- ployed in these two protocols (NlWl and NIWT) cannot also be distinguished by the verifiers. Combined with the E-protocol, we then construct NlWl and NIWH proofs for any NP statement under the existence of one-way functions and show that each proof is different from those under the existence of trapdoor permutations, Finally, based on our NlWl and NIWH proofs, we construct delegateable signature schemes under the existence of one-way functions, which are more efficient than Barak's scheme under the existence of trapdoor permutations.展开更多
Sequences with nice pseudo-randomness play an important role in not only communication system but also cryptography system. Based on the Legendre-Sidelnikov sequence, a modified Legendre-Sidelnikov sequence was introd...Sequences with nice pseudo-randomness play an important role in not only communication system but also cryptography system. Based on the Legendre-Sidelnikov sequence, a modified Legendre-Sidelnikov sequence was introduced. The exact value of the autocorrelation function was derived by strict computation. According to the values of the autocorrelation functions of the two Legendre-Sidelnikov sequences, it is proven that both of them have perfect pseudo-randomness. Furthermore, a detailed comparison between autocorrelation functions of the two Legendre-Sidelnikov sequences was deduced. It indicates that no matter which parameters are chosen, the modified sequence has pseudo-randomness as good as the primitive sequence, which is of great significance for applications.展开更多
Accurate prediction of server load is important to cloud systems for improving the resource utilization, reducing the energy consumption and guaranteeing the quality of service(QoS).This paper analyzes the features of...Accurate prediction of server load is important to cloud systems for improving the resource utilization, reducing the energy consumption and guaranteeing the quality of service(QoS).This paper analyzes the features of cloud server load and the advantages and disadvantages of typical server load prediction algorithms, integrates the cloud model(CM) and the Markov chain(MC) together to realize a new CM-MC algorithm, and then proposes a new server load prediction algorithm based on CM-MC for cloud systems. The algorithm utilizes the historical data sample training method of the cloud model, and utilizes the Markov prediction theory to obtain the membership degree vector, based on which the weighted sum of the predicted values is used for the cloud model. The experiments show that the proposed prediction algorithm has higher prediction accuracy than other typical server load prediction algorithms, especially if the data has significant volatility. The proposed server load prediction algorithm based on CM-MC is suitable for cloud systems, and can help to reduce the energy consumption of cloud data centers.展开更多
The Internet now is a large-scale platform with big data. Finding truth from a huge dataset has attracted extensive attention, which can maintain the quality of data collected by users and provide users with accurate ...The Internet now is a large-scale platform with big data. Finding truth from a huge dataset has attracted extensive attention, which can maintain the quality of data collected by users and provide users with accurate and efficient data. However, current truth finder algorithms are unsatisfying, because of their low accuracy and complication. This paper proposes a truth finder algorithm based on entity attributes (TFAEA). Based on the iterative computation of source reliability and fact accuracy, TFAEA considers the interactive degree among facts and the degree of dependence among sources, to simplify the typical truth finder algorithms. In order to improve the accuracy of them, TFAEA combines the one-way text similarity and the factual conflict to calculate the mutual support degree among facts. Furthermore, TFAEA utilizes the symmetric saturation of data sources to calculate the degree of dependence among sources. The experimental results show that TFAEA is not only more stable, but also more accurate than the typical truth finder algorithms.展开更多
Bent functions in trace forms play an important role in the constructions of generalized binary Bent se-quences.Trace representation of some degree two Bent functions are presented in this paper.A sufficient and nec-e...Bent functions in trace forms play an important role in the constructions of generalized binary Bent se-quences.Trace representation of some degree two Bent functions are presented in this paper.A sufficient and nec-essary condition is derived to determine whether the sum of the combinations of Gold functions,tr1^(n)(x^(2+1)),1≤i≤n−1,over finite fields 2n F(n be even)in addition to another term tr1^(n/2)(x^(2n/2+1))is a Bent function.Similar to the result presented by Khoo et al.,the condition can be verified by polynominal greatest common divisor(GCD)computation.A similar result also holds in the case n pF(n be even,p be odd prime).Using the constructed Bent functions and Niho type Bent functions given by Dobbertin et al.,many new generalized binary Bent sequences are obtained.展开更多
With the development of cloud computing technology, data can be outsourced to the cloud and conveniently shared among users. However, in many circumstances, users may have concerns about the reliability and integrity ...With the development of cloud computing technology, data can be outsourced to the cloud and conveniently shared among users. However, in many circumstances, users may have concerns about the reliability and integrity of their data. It is crucial to provide data sharing services that satisfy these security requirements. We introduce a reliable and secure data sharing scheme, using the threshold secret sharing technique and the ChaumPedersen zero-knowledge proof. The proposed scheme is not only effective and flexible, but also able to achieve the semantic security property. Moreover, our scheme is capable of ensuring accountability of users’ decryption keys as well as cheater identification if some users behave dishonestly. The efficiency analysis shows that the proposed scheme has a better performance in terms of computational cost, compared with the related work. It is particularly suitable for application to protect users’ medical insurance data over the cloud.展开更多
基金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 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.
基金Supported by the National Science Foundation of China (No.60773137,60972067)the National 863 Project (No.2007AA01Z297)
文摘In this paper,we propose an opportunistic decoding method to enhance the reconstruction of unequal erasure protected scalable coded source.This method explores some non-channel-decodable symbols of the received packets by opportunistically utilizing the structure information of joint source-channel coding scheme.As a result,a longer prefix of source coded stream may be obtained to enhance the reconstruction of scalable coded source.Experiment results indicate that opportunistic decoding at the receiver can improve the quality of the reconstructed source when channel decoding fails to recover all the source symbols.
文摘Based on grow tree composite model, Finite Field Wavelet Grow Tree (FW-GT) was proposed in this paper. FW-GT is a novel framework to be used in data encryption enhancing data security. It is implemented by replacement operator and wavelet operator. Forward integration and inverse decomposition of FW-GT are performed by replacement, inverse wavelets and its corresponding replacement, wavelet transforms. Replacement operator joined nonlinear factor, wavelet operator completed data transformation between lower dimensional space and higher dimensional space. FW-GT security relies on the difficulty of solving nonlinear equations over finite fields. By using FW-GT, high security of data could be obtained at the cost of low computational complexity. It proved FW-GT algorithm’s correctness in this paper. The experimental result and theory analysis shows the excellent performance of the algorithm.
文摘Digital watermarking has been proposed for the copyright protections of multimedia products. In this paper, a robust and blind watermarking scheme is presented. The concept of communication with side information is applied at the encoder to improve the probability of detection within acceptable fidelity, while the template matching technique is employed to estimate the undergone attacks in attacking channel. This scheme is optimized by the optimal design of the encoder to match with the media content and the decoder to adapt to the attack channel state. Experiments show that our method is robust against some common attacks such as filtering, compression, rotation, scaling, cropping and translation. It can be applied to both color and gray images.
基金the National Natural Science Foundation of China (Grant No. 10371061)
文摘The probabilities of the state transitions of the initial value So in the S table of RC4 are described by a kind of bistochastic matrices, and then a computational formula for such bistochastic matrices is given, by which the mathematical expectation of the number of fixed points in the key extending algorithm of RC4 is obtained. As a result, a statistical weakness of the key extending algorithm of RC4 is presented.
基金This work was supported by Sichuan Provincial Youth Science Fund, the Science and Technology on Communication Security Laboratory Project (9140C110201110C1102), the National Natural Science Foundations of China (Grant Nos. 61003299, 61202437), the Natural Sci- ence Basic Research Plan in Shaanxi Province of China (2012JM8041), the Fundamental Research Funds for the Central Universities (K5051201036) and the "l 1 l" Project (B08038). Thanks are due to anonymous referees for a series of comment on this paper.
文摘The global avalanche characteristics (the sum- of-squares indicator and the absolute indicator) measure the overall avalanche characteristics of a cryptographic Boolean function. Sung et al. (1999) gave the lower bound on the sum- of-squares indicator for a balanced Boolean function satisfy- ing the propagation criterion with respect to some vectors. In this paper, if balanced Boolean functions satisfy the propaga- tion criterion with respect to some vectors, we give three nec- essary and sufficient conditions on the auto-correlation distri- bution of these functions reaching the minimum the bound on the sum-of-squares indicator. And we also find all Boolean functions with 3-variable, 4-variable, and 5-variable reaching the minimum the bound on the sum-of-squares indicator.
基金Supported partially by the National Natural Science Foundation of China(Grant Nos.90604034,10371127 and 10671114)
文摘A delegateable signature scheme (DSS) which was first introduced by Barak is mainly based on the non-interactive zero-knowledge proof (NIZK) for preventing the signing verifier from telling which witness (i.e., restricted subset) is being used. However, the scheme is not significantly efficient due to the difficulty of constructing NIZK. We first show that a non-interactive witness indistinguishable (NlWl) proof system and a non-interactive witness hiding (NIWH) proof system are easier and more efficient proof models than NIZK in some cases. Furthermore, the witnesses em- ployed in these two protocols (NlWl and NIWT) cannot also be distinguished by the verifiers. Combined with the E-protocol, we then construct NlWl and NIWH proofs for any NP statement under the existence of one-way functions and show that each proof is different from those under the existence of trapdoor permutations, Finally, based on our NlWl and NIWH proofs, we construct delegateable signature schemes under the existence of one-way functions, which are more efficient than Barak's scheme under the existence of trapdoor permutations.
基金supported by the National Natural Science Foundation of China (60833008)the Science and Technology on Communication Security Laboratory (9140C110201110C1102)the Fundamental Research Funds for the Central Universities (K5051270003, K50511010007)
文摘Sequences with nice pseudo-randomness play an important role in not only communication system but also cryptography system. Based on the Legendre-Sidelnikov sequence, a modified Legendre-Sidelnikov sequence was introduced. The exact value of the autocorrelation function was derived by strict computation. According to the values of the autocorrelation functions of the two Legendre-Sidelnikov sequences, it is proven that both of them have perfect pseudo-randomness. Furthermore, a detailed comparison between autocorrelation functions of the two Legendre-Sidelnikov sequences was deduced. It indicates that no matter which parameters are chosen, the modified sequence has pseudo-randomness as good as the primitive sequence, which is of great significance for applications.
基金supported by the National Natural Science Foundation of China(61472192 61772286)+3 种基金the National Key Research and Development Program of China(2018YFB1003700)the Scientific and Technological Support Project(Society)of Jiangsu Province(BE2016776)the "333" Project of Jiangsu Province(BRA2017228 BRA2017401)
文摘Accurate prediction of server load is important to cloud systems for improving the resource utilization, reducing the energy consumption and guaranteeing the quality of service(QoS).This paper analyzes the features of cloud server load and the advantages and disadvantages of typical server load prediction algorithms, integrates the cloud model(CM) and the Markov chain(MC) together to realize a new CM-MC algorithm, and then proposes a new server load prediction algorithm based on CM-MC for cloud systems. The algorithm utilizes the historical data sample training method of the cloud model, and utilizes the Markov prediction theory to obtain the membership degree vector, based on which the weighted sum of the predicted values is used for the cloud model. The experiments show that the proposed prediction algorithm has higher prediction accuracy than other typical server load prediction algorithms, especially if the data has significant volatility. The proposed server load prediction algorithm based on CM-MC is suitable for cloud systems, and can help to reduce the energy consumption of cloud data centers.
基金supported by the National Natural Science Foundation of China(61472192)the Scientific and Technological Support Project(Society)of Jiangsu Province(BE2016776)
文摘The Internet now is a large-scale platform with big data. Finding truth from a huge dataset has attracted extensive attention, which can maintain the quality of data collected by users and provide users with accurate and efficient data. However, current truth finder algorithms are unsatisfying, because of their low accuracy and complication. This paper proposes a truth finder algorithm based on entity attributes (TFAEA). Based on the iterative computation of source reliability and fact accuracy, TFAEA considers the interactive degree among facts and the degree of dependence among sources, to simplify the typical truth finder algorithms. In order to improve the accuracy of them, TFAEA combines the one-way text similarity and the factual conflict to calculate the mutual support degree among facts. Furthermore, TFAEA utilizes the symmetric saturation of data sources to calculate the degree of dependence among sources. The experimental results show that TFAEA is not only more stable, but also more accurate than the typical truth finder algorithms.
基金supported by the National Natural Science Foundation of China(No.60373059)the National Research Foundation for the Doctoral Program of Higher Education of China(No.20040013007)the Research Foundation of the State Key Laboratory of Information Security.
文摘Bent functions in trace forms play an important role in the constructions of generalized binary Bent se-quences.Trace representation of some degree two Bent functions are presented in this paper.A sufficient and nec-essary condition is derived to determine whether the sum of the combinations of Gold functions,tr1^(n)(x^(2+1)),1≤i≤n−1,over finite fields 2n F(n be even)in addition to another term tr1^(n/2)(x^(2n/2+1))is a Bent function.Similar to the result presented by Khoo et al.,the condition can be verified by polynominal greatest common divisor(GCD)computation.A similar result also holds in the case n pF(n be even,p be odd prime).Using the constructed Bent functions and Niho type Bent functions given by Dobbertin et al.,many new generalized binary Bent sequences are obtained.
基金the National Key R&D Program of China (No. 2017YFB0802000)the National Natural Science Foundation of China (Nos. 61772326 and 61572303)+4 种基金the Research Fund for International Young Scientists, China (No. 61750110528)National Cryptography Development FYind for the 13th Five- Year Plan, China (No. MMJJ20170216), the Foundation of State Key Laboratory of Information Security, China (No. 2017-MS- 03)the Fundamental Research Funds for the Central Universities, China (No. GK201702004)the Scientific Research Program Funded by Shaanxi Provincial Education Department, China (No. 16JK1109), the Provincial Natural Science Foundation Research Project of Shaanxi, China (No. 2017JQ6029)the Doctoral Scientific Fund Project of Shaanxi University of Science & Technology, China (No. BJ11-12).
文摘With the development of cloud computing technology, data can be outsourced to the cloud and conveniently shared among users. However, in many circumstances, users may have concerns about the reliability and integrity of their data. It is crucial to provide data sharing services that satisfy these security requirements. We introduce a reliable and secure data sharing scheme, using the threshold secret sharing technique and the ChaumPedersen zero-knowledge proof. The proposed scheme is not only effective and flexible, but also able to achieve the semantic security property. Moreover, our scheme is capable of ensuring accountability of users’ decryption keys as well as cheater identification if some users behave dishonestly. The efficiency analysis shows that the proposed scheme has a better performance in terms of computational cost, compared with the related work. It is particularly suitable for application to protect users’ medical insurance data over the cloud.