RECENT emergence of data enabled mobile devices and wireless-enabled data applications have fostered new content dissemination models in today’s mobile ecosystem. A list of such devices includes Apple’s iPhone, Google’s Android, Amazon’s Kindle, and electronic book readers from other vendors. The array of data applications includes electronic book and magazine readers and mobile phone Apps. […]
Context-Dependent Logo Matching and Recognition CDS Logo Detection and Recognition
This paper presents a new method for logo detection and recognition based on “Context- Dependent Similarity” (CDS). It directly has as a feature the spatial context of local features. The CDS function is defined as the fixed-point of three terms: (i) an energy function which balances a fidelity term; (ii) a context criterion; (iii) an […]
Privacy Preserving Data Mining in Horizontally Distributed Databases
The problem of secure mining of association rules in horizontally partitioned databases. One of the main ingredients in our proposed protocol is a novel secure multi-party protocol for computing the union (or intersection) of private subsets that each of the interacting players hold. Another ingredient is a protocol that tests the inclusion of an element […]
TPA Public audit-ability for secure Cloud Computing
CLOUD computing has been envisioned as the next generation information technology (IT) architecture for enterprises, due to its long list of unprecedented advantages in the IT history: on-demand self-service, ubiquitous network access, location independent resource pooling, rapid resource elasticity, usage-based pricing and transference of risk storing data remotely to the cloud in a flexible on-demand […]
Skewness Minimization: Improving utilization of Cloud servers
In this paper, we present the design and implementation of an automated resource management system that achieves a good balance between the two goals i.e. Overload avoidance and Green computing. We develop a resource allocation system that can avoid overload in the system effectively while minimizing the number of servers used. . We introduce the […]
Secure data sharing for dynamic groups in the cloud
This paper proposes a secure multi-owner data sharing scheme. It implies that any user in the group can securely share data with others by the untrusted cloud. The proposed scheme is able to support dynamic groups efficiently. Specifically, new granted users can directly decrypt data files uploaded before their participation without contacting with data owners. […]
Anonymous Location-based efficient routing protocol
In order to provide high anonymity protection (for sources, destination, and route) with low cost, this paper proposes an Anonymous Location-based and Efficient Routing proTocol (ALERT). ALERT dynamically partitions a network field into zones and randomly chooses nodes in zones as intermediate relay nodes, which form a non traceable anonymous route. Specifically, in each routing […]
Reserving room before encryption using Reversible Data Hiding
Reversible data hiding (RDH) in images is a technique, by which the original cover can be losslessly recovered after the embedded message is extracted. In the proposed method, we first empty out room by embedding LSBs of some pixels into other pixels with a traditional RDH method and then encrypt the image, so the positions […]
Decentralized, Key-Based Caching And Checking System To Catch Cloned Nodes
In this paper, we propose two novel node clone detection protocols with different tradeoffs on network conditions and performance. The first one is based on a distributed hash table (DHT), by which a fully decentralized, key-based caching and checking system is constructed to catch cloned nodes effectively. The protocol performance on efficient storage consumption and […]
Multi-path Wireless Routing Protocols with Minimum Cost Blocking Problem
We present a class of Minimum Cost Blocking (MCB) problems in Wireless Mesh Networks (WMNs) with multi-path wireless routing protocols. We establish the provable superiority of multi-path routing protocols over conventional protocols against blocking, node-isolation and network-partitioning type attacks. In our attack model, an adversary is considered successful if he is able to capture/isolate a […]
- « Previous Page
- 1
- …
- 6
- 7
- 8
- 9
- 10
- …
- 14
- Next Page »