A key pre-distribution scheme is a method by which initially an off-line trusted authority T A distributes pieces of information among a set of users. Later, each member of a group of users can compute a common key fo...
详细信息
A key pre-distribution scheme is a method by which initially an off-line trusted authority T A distributes pieces of information among a set of users. Later, each member of a group of users can compute a common key for secure communication. In this paper we present a keying Material Based key Pre-distribution Scheme, i.e., a group of users, using secret information preloaded in their memory and some public information retrieved from a keying material server, can compute a common key. We first formally define the keying material based key pre-distribution scheme in terms of the entropy, and give lower bounds on the amount of information each user has to keep secret. Then, we describe its applications for sensor networks.
According to the weakness of mode of operation, a modified parallelizable message authentication code (MPMAC) is proposed. The mode to process the last block of message is improved to avoid the forgery attack with ran...
详细信息
According to the weakness of mode of operation, a modified parallelizable message authentication code (MPMAC) is proposed. The mode to process the last block of message is improved to avoid the forgery attack with random message by using the fact that the block cipher has same output with the same input using a key. Its security is proved by quantifying the advantage of distinguishing message authentication code from the random function in terms of the quality of the block cipher as a pseudo-random permutation.
In this paper, no-wait flow shop scheduling problem with total flowtime minimization is considered. A hybrid heuristic is proposed, which is based on PH1 (p) (presented by Aldowaisan and Allahverdi, OMEGA, 2004). A co...
详细信息
Routing security is an important issue in secure ad hoc networks, and it appears to be a problem that is not trivial to solve. In this paper, we consider secure routing protocol and applied new cryptographic mechanism...
详细信息
Routing security is an important issue in secure ad hoc networks, and it appears to be a problem that is not trivial to solve. In this paper, we consider secure routing protocol and applied new cryptographic mechanism: multi-signcryption to routing protocol for ad hoc networks. SL multi-signcryption scheme efficiently provides message flexibility, order flexibility, message verifiability, order verifiability, message confidentiality, message unforgeability, non-repudiation and robustness. It is suitable for protecting messages and multi-signers from malicious attacks in networks. For this reason, using SL multi-signcryption, we propose a new secure AODV (Ad hoc on-demand distance vecter) routing protocol: SCRP (Signcryption based routing protocol). SCRP indeed enhances the security of AODV routing protocol and provides confidentiality, integrity, authentication, and non-repudiation to the routing message. Moreover, compared with other secure AODV, SCRP provides some other advantages such as lower computational cost and communicational overhead, flexibility of route message, and partially anonymous route.
In this paper, no-wait flow shop scheduling problem with total flowtime minimization is considered. A hybrid heuristic is proposed, which is based on PHI (p) (presented by Aldowaisan and Allahverdi, OMEGA, 2004). A co...
详细信息
ISBN:
(纸本)1424409624
In this paper, no-wait flow shop scheduling problem with total flowtime minimization is considered. A hybrid heuristic is proposed, which is based on PHI (p) (presented by Aldowaisan and Allahverdi, OMEGA, 2004). A composite algorithm is adopted to generate the initial seed. Job insertion in PHI (p) is replaced with an existing constructive heuristic. Experimental results show that the proposal outperforms PHI (p), especially for large scale instances.
Ideal function is the fundamental component in the universally composable security model. However, the certification ideal function defined in the universally composable security model realizes the identity authentica...
详细信息
Ideal function is the fundamental component in the universally composable security model. However, the certification ideal function defined in the universally composable security model realizes the identity authentication by binding identity to messages and the signature, which fails to characterize the special security requirements of anonymous authentication with other kind of certificate. Therefore, inspired by the work of Marten, an anonymous hash certification ideal function and a more universal certificate CA model are proposed in this paper. We define the security requirements and security notions for this model in the framework of universal composable security and prove in the plain model (not in the random-oracle model) that these security notions can be achieved using combinations of a secure digital signature scheme, a symmetrical encryption mechanism, a family of pseudorandom functions, and a family of one-way collision-free hash functions. Considering the limitation of wireless environment and computation ability of wireless devices, this anonymous Hash certification ideal function is realized by using symmetry primitives.
In this paper, a Web Service based method is presented to conduct parallelized operations in an algorithm on multiple computers. Parallelizable operations in a constructive heuristic for flow shop scheduling problem w...
详细信息
ISBN:
(纸本)1424409624
In this paper, a Web Service based method is presented to conduct parallelized operations in an algorithm on multiple computers. Parallelizable operations in a constructive heuristic for flow shop scheduling problem with total flowtime minimization are analyzed. A parallel heuristic for the problem is described and its parameters are analyzed in theory. The proposed parallel heuristic is compared with the corresponding centralized one. Experimental results show that the proposed method can substantially increase efficiency.
Side-channel attacks are serious practical threat against implementation of cryptographic algorithms. Regarding implementation of elliptic curve cryptosystems, simple side-channel attacks (SSCA) can be used to determi...
详细信息
Side-channel attacks are serious practical threat against implementation of cryptographic algorithms. Regarding implementation of elliptic curve cryptosystems, simple side-channel attacks (SSCA) can be used to determine the private key gradually. This paper discusses a certain class of countermeasures which try to achieve a protection against SSCA by obscuring the relationship between the digits in the digit representation of the secrete key and the sequence of elliptic curve operation. To analyze those algorithms, a new method which models point multiplication algorithms as Markov Chain is proposed in this paper. Theoretical proof shows that this method is more efficient than the normal side channel attacks.
The Eleman Neural network has been widely used in various fields ranging from temporal version of the Exclusive-OR function to the discovery of syntactic categories in natural language date. However, one of the proble...
详细信息
暂无评论