We present the design of pService system for P2P Web services discovery supporting similarity earch with its locality-preserving feature based on modified Skip Graph. In pService, the most important property (e.g. ser...
详细信息
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...
详细信息
ISBN:
(纸本)9780769537443
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 malicious node and providing a trustworthy protection over whole network. In this paper, we introduce a localized trust management which can primarily remove malicious nodes, and propose an efficient anonymous routing protocol by node that participates in the protocol encrypts entire message with trust key and says Hello to its ancestor within expiration time. It makes malicious node can be detected and isolated from the network. In this way, a anonymous and secure route path can be established in a hostile environment. Meanwhile, it is able to efficiently against the Denial-of-Service (DoS) attack.
Numerous studies have reported that the timeseries terrestrial parameters such as the Normalized Difference Vegetation Index (NDVI), Leaf Area of Index (LAI), Fraction of Absorbed Photosynthetic Active Radiation (FPAR...
详细信息
Support Vector Machine (SVM) is sensitive to noises and outliers. For reducing the effect of noises and outliers, we propose a novel SVM for suppressing error function. The error function is limited to the interval of...
详细信息
ISBN:
(纸本)9780769538877
Support Vector Machine (SVM) is sensitive to noises and outliers. For reducing the effect of noises and outliers, we propose a novel SVM for suppressing error function. The error function is limited to the interval of [0, 1]. The separation hypersurface is simplified and the margin of hypersurface is widened. Experimental results show that our proposed method is able to simultaneously increase the classification efficiency and the generalization ability of the SVM.
security is a big challenge when wireless sensor networks are deployed in a hostile environment. Due to the computational and storage overheads, traditional asymmetric cryptographic protocols are not suitable for the ...
详细信息
security is a big challenge when wireless sensor networks are deployed in a hostile environment. Due to the computational and storage overheads, traditional asymmetric cryptographic protocols are not suitable for the resource-constrained wireless sensor nodes. Several key pre-distribution schemes have been proposed in literature to establish pairwise key between sensor nodes, but most of which only work for small-scale networks due to their linearly increased communication overhead and key storage overhead. Furthermore, some existing key pre-distribution schemes are not secure when the number of compromised sensor nodes exceeds a threshold value. In this paper a novel key pre-distribution scheme was put forward based on one-way hash chain and bivariate polynomial, which can afford sufficient security no matter how many sensor nodes are compromised compared with existing typical key pre-distribution schemes. Better network connectivity, lower key storage overhead and lower communication overhead can also be achieved by the proposed scheme.
Aiming at the mobile short message (SMS) hot topic extraction, the text features and statistical regularity of SMS are analyzed in this study. The formal description of SMS hot topic is given and an algorithm of SMS h...
详细信息
Shamir proposed the first (t, n) threshold secret sharing scheme. Shamir's scheme is ideal and perfect. In this paper, we propose two modifications of Shamir's secret sharing scheme. In our first modification,...
详细信息
ISBN:
(纸本)9780769537443
Shamir proposed the first (t, n) threshold secret sharing scheme. Shamir's scheme is ideal and perfect. In this paper, we propose two modifications of Shamir's secret sharing scheme. In our first modification, each shareholder keeps both x-coordinate and y-coordinate of a polynomial as private share. In our second modification, dealer uses polynomial with degree larger than the threshold value t to generate shares for a (t, n) threshold scheme. We show that these two modified schemes are ideal and perfect. Using these two modifications, we design a multilevel threshold secret sharing schemes (MTSS). We prove that the proposed scheme is secure.
Routing in wireless mesh networks presents a great challenge due to unreliable wireless links and collisions. Recently, a new routing method, opportunistic routing (OR), is proposed to deal with them by exploiting bro...
详细信息
ISBN:
(纸本)9781849191388
Routing in wireless mesh networks presents a great challenge due to unreliable wireless links and collisions. Recently, a new routing method, opportunistic routing (OR), is proposed to deal with them by exploiting broadcast nature of wireless networks. OR relies on the global knowledge of networks to select relays and determine priorities. In this paper, we propose a new routing scheme, OxDSR, which combines OR and dynamic source routing (DSR) and performs opportunistic transmissions with the help of the local information and the traditional route obtained by DSR. By taking the duplicates and additional wireless resource consumed by multiple ACK frames into consideration, we propose a new metric, equivalent data rate, to select and prioritize relays. Extensive simulation study shows that the proposed OxDSR is more resilient and achieves higher throughput than DSR based on the expected transmission count routing metric.
Recently, Das et al. and Tseng et al. proposed a remote user authentication scheme using bilinear pairings, respectively. They can provide a flexible password change option to the users without any help from the remot...
详细信息
Recently, Das et al. and Tseng et al. proposed a remote user authentication scheme using bilinear pairings, respectively. They can provide a flexible password change option to the users without any help from the remote server. However, some weaknesses of the two bilinear pairing based remote password authentication schemes are found in the paper. The schemes suffer from offline password guessing attack and impersonation attacks.
In this paper, by converse using blind signature, we propose a practical electronic payment scheme for electronic commerce. This scheme is different from the existing schemes used widely in the Internet at present and...
详细信息
ISBN:
(纸本)9781424445219
In this paper, by converse using blind signature, we propose a practical electronic payment scheme for electronic commerce. This scheme is different from the existing schemes used widely in the Internet at present and it does not need the strong trust between customer and merchant. In this scheme, a semi-trusted third party (S-TTP) is introduced to provide a fair commerce environment. The S-TTP takes part in the protocol online and is not leaked any secure information about the business. Moreover, the users do not need to register to S-TTP. An advantage of the scheme is that this approach does not require the intervention of the third party in case of dispute, if one user cheats or simply crashes.
暂无评论