For stream ciphers which use binary linear feedback shift registers as stream generators, fast correlation attack is one of the most important attacks. Aiming at the shortcomings of serial algorithm, the proposed tech...
详细信息
Based on symmetrical encryption and signature, an efficient authentication key agreement protocol was proposed in this paper. The security analysis of the proposed protocol in the implementation plan with the Canetti-...
详细信息
Certificateless public key encryption can be classified into two types, namely, CLE and CLE dagger, both of which were introduced by Al-Riyami and Paterson in Asiacrypt 2003. Most works about certificateless public ke...
详细信息
ISBN:
(纸本)9783642014390
Certificateless public key encryption can be classified into two types, namely, CLE and CLE dagger, both of which were introduced by Al-Riyami and Paterson in Asiacrypt 2003. Most works about certificateless public key encryption belong to CLE, where the partial secret key is uniquely determined by an entity's identity. In CLE dagger, an entity's partial secret key is riot only determined by the identity information but also by his/her (partial) public key. Such techniques can enhance the resilience of certificateless public key encryption against a cheating KGC. In this paper, we first formalize the security definitions of CLE dagger. After that, we demonstrate the gap between the security model of CLE dagger and CLE, by showing the insecurity of a CLE dagger scheme proposed by Lai and Kou in PKC 2007. We give an attack that can successfully break the indistinguishability of their CLE dagger scheme, although their scheme can be proved secure in the security model of CLE. Therefore, it does riot suffice to consider the security of CLE dagger in the security model of CLE. Finally, we show how to secure Lai-Kou's scheme by providing a new scheme with the security proof in the model of CLE dagger.
To make up the limitation of traditional secret sharing schemes that the length of secret can not be extremely great, we use the theory of Jordan matrix factorization and combine with the formulary of Lagrange putting...
详细信息
In the confidential computing issues of scientific computing, the confidential computing of matrix factorization is still no fruit home and abroad. This paper using Data perturbation assumption and Oblivious Transfer ...
详细信息
Password authenticated key exchange protocols allow two entities who only share a humanmemorable password to authenticate each other and agree on a session key between themselves. This paper surveys the state of resea...
详细信息
To measure the correlation between two arbitrary Boolean functions, we propose the two new criteria called the sum-of-squares indicator and the absolute indicator of the cross-correlation. The two indicators generaliz...
详细信息
ISBN:
(纸本)9781424443376
To measure the correlation between two arbitrary Boolean functions, we propose the two new criteria called the sum-of-squares indicator and the absolute indicator of the cross-correlation. The two indicators generalize the GAC criterion (which was proposed by X.M. Zhang and Y.L. Zheng, in GAC-the criterion for global avalanche characteristics of cryptographic functions, Journal for Universal computer Science, 1(5): 316-333, 1995). Lower and upper bounds on the two indicators are obtained.
In the semi-honest model, Lin and Tzeng proposed an efficient solution to the millionaires' problem based on homomorphic encryption. They reduced the problem to the set intersection problem by encoding the private...
详细信息
In the semi-honest model, Lin and Tzeng proposed an efficient solution to the millionaires' problem based on homomorphic encryption. They reduced the problem to the set intersection problem by encoding the private inputs in a special way (the encoding method allows an efficient protocol for the set intersection problem). This paper modifies Lin and Tzeng's protocol by introducing an Oblivious third party, and the modification is fair and secure in the same model. Compared with some of the previous fair protocols, our protocol relaxes the cryptographic assumption or the trust model. Compared with other previous fair protocols, our protocol are more efficient. We also consider security against malicious adversaries, i.e., malicious participants (the two millionaires) and third party.
Providing anonymous routing in mobile ad hoc networks (MANET) has been a hot issue for the purpose of security and privacy concerns. But there are very few have been done about providing a valid method to detect malic...
详细信息
Based on the analysis to the phenomenon and methods of denial-of-sleep attacking in wireless sensor network, a scheme is proposed employing fake schedule switch with RSSI measurement aid. The sensor nodes can reduce a...
详细信息
暂无评论