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 CRYPTO 2004, a short group signature is proposed by Boneh, Boyen and Shacham, which is based on strong Diffie-Hellman (SDH) assumption and Decision Linear assumption. Thereafter it is denoted BBS. Only chosen plain...
详细信息
In CRYPTO 2004, a short group signature is proposed by Boneh, Boyen and Shacham, which is based on strong Diffie-Hellman (SDH) assumption and Decision Linear assumption. Thereafter it is denoted BBS. Only chosen plaintext attack (CPA) full-anonymity is achieved in BBS short group signature for CPA secure in linear encryption. In this case, adversary could not query an open oracle. However, when adversaries try to break the notion of chosen ciphertext attack (IND-CCA2) full-anonymity, they have the ability to query an open oracle in the current and strongest security model for group signatures. Hence adversaries can obtain the signer identity of the queried signature. This paper presents a new zero-knowledge protocol for SDH, which based on Cramer-Shoup encryption from the linear assumption. Using this protocol as a building block, a new short group signature is constructed in this paper, which is provable secure in the Bellare-Micciancio-Warinshi model. The scheme is of IND-CCA2-full-anonymity, which allows adversary querying open oracle when trying to attack the anonymity notion. And the signature is only 1704 bits in size.
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...
详细信息
The DRM technologies and the concept of authorized domain were introduced. The requirements of rights management for DRM in Authorized domain were analyzed from the examples of application scene. A rights management s...
详细信息
The DRM technologies and the concept of authorized domain were introduced. The requirements of rights management for DRM in Authorized domain were analyzed from the examples of application scene. A rights management scheme for DRM in authorized domain based on PMI was proposed. The method can implement efficient management for DRM by the application of RO-AO chain and RBAC mechanism. Finally, a capability analysis of this scheme was presented.
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.
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.
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.
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.
Cost optimization for workflow applications with deadline constraints is fundamental and intractable in grids. In this paper, early tree is introduced to find an early feasible schedule for a workflow application. Acc...
详细信息
ISBN:
(纸本)1424409624
Cost optimization for workflow applications with deadline constraints is fundamental and intractable in grids. In this paper, early tree is introduced to find an early feasible schedule for a workflow application. According to the early tree, a cost optimization algorithm is proposed. Taking into account the workflow total float, the workflow deadline is segmented to activity deadlines while keeping precedence constraints. Costs of all activities are locally optimized, so does the workflow cost. Experimental results show that the proposal that this approach can dramatically decrease workflow cost with different deadlines. Moreover, it outperforms other two leveling algorithms in performance on average.
暂无评论