Privacy security is a key issue for cloud storage. Encryption is a well established technology for protecting sensitive data. But it gives some new problems: how data owner and storage service provider to operate on e...
详细信息
In the security field of computer application systems, how to guarantee legal transmission of information flow among different application programs is a significant problem. In this paper, firstly, non-interference th...
详细信息
Speech signal representation is basic step for speech signal processing. We discuss an overcomplete dictionary learning algorithm to sparsely represent speech signal in short-time Fourier transform (STFT) transformed ...
详细信息
An algorithm of applying Bedford's law to detect credit fraud in e-commerce is proposed in the paper and the feasibility is *** weakness of the algorithm for detecting financial fraud via Benford correlation coeff...
详细信息
An algorithm of applying Bedford's law to detect credit fraud in e-commerce is proposed in the paper and the feasibility is *** weakness of the algorithm for detecting financial fraud via Benford correlation coefficients is analyzed and a new detection method for e-commerce fraud defined as credit algorithm based on Bedford ' s law is established,providing better performance of reliability and precision.
We have reviewed the research of context awareness of recent years in this paper. First of all, we describe the definitions of context and context awareness which are made by different scholars in different fields, an...
详细信息
For the anti-jamming purpose,frequency hopping sequences are required to have a large linear span. In this paper,we firstly give the linear span of a class of optimal frequency hopping sequences. The results show that...
详细信息
For the anti-jamming purpose,frequency hopping sequences are required to have a large linear span. In this paper,we firstly give the linear span of a class of optimal frequency hopping sequences. The results show that the linear span is very small compared with their periods. To improve the linear span,we transform these optimal frequency hopping sequences into new optimal frequency hopping sequences with large linear span by using a general type of permutation polynomials over a finite field. Furthermore,we give the exact values of the linear span of the transformed optimal frequency hopping sequences.
Elliptic curve cryptography is one of the most important public-key *** Koblitz Curve is a special kind of elliptic curve in ECC and its security mainly depends on the base *** on Evolutionary Cryptography theory,whic...
详细信息
Elliptic curve cryptography is one of the most important public-key *** Koblitz Curve is a special kind of elliptic curve in ECC and its security mainly depends on the base *** on Evolutionary Cryptography theory,which becomes a principal concept for cryptography design and cryptanalysis,we propose a new algorithm for secure EC generation based on Ant Colony Optimization(ACO)to accelerate the search process of safe base *** preliminarily deal with secure Koblitz curve selecting over the field F(2800).Experiments show that the base field and base point of secure curves generated by ant colony algorithm have gone beyond the parameter range of Koblitz curves recommended by *** can present many new secure Koblitz curves,including base field and base point,which are not recommended by *** maximum size of our secure Koblitz curve has gone beyond *** algorithm in this paper follows the same cryptography criteria recommended by the ***,it can resist current *** analysis and experimental results prove that the new algorithm is effective and successful,and it is the first successful practice of Evolutionary Cryptography theory in public cryptography research.
Proxy Mobile IPv6 (PMIPv6) is an emerging network-based localized mobility management scheme. Recently, Zhou, Zhang and Qin proposed an authentication method for PMIPv6. However, this paper shows that their scheme fai...
详细信息
Recently Vadim Lyubashevsky etc. built LWE problem on ring and proposed a public cryptosystem based on RLWE, which, to a certain extent, solved the defect of large public key of this kind, but it didn't offer p...
详细信息
Recently Vadim Lyubashevsky etc. built LWE problem on ring and proposed a public cryptosystem based on RLWE, which, to a certain extent, solved the defect of large public key of this kind, but it didn't offer parameter selections and performance analysis in detail. In this paper an improved scheme is proposed by sharing a ring' polynomial vector that makes public key as small as 1/m of the original scheme in multi-user environments. In additions, we introduce a parameter r to control both the private key space size and decryption errors probability, which greatly enhances the flexibly and practicality. The correctness, security and efficiency are analyzed in detail and choice of parameters is studied, at last concrete parameters are recommended for the new scheme.
1 Introduction With the development of QSDC, the bidirectional QSDC protocol[8] was proposed in 2004, in which the two communicators can exchange their secret messages simultaneously, it is also called quantum ***, th...
1 Introduction With the development of QSDC, the bidirectional QSDC protocol[8] was proposed in 2004, in which the two communicators can exchange their secret messages simultaneously, it is also called quantum ***, there is a serious problem called "information leakage" or "classical correlation" in some of these quantum dialogue protocols[8-10], which is pointed out by Gao et al.[16]and Tan [17]independently.
暂无评论