Phd Projects | IEEE Project | IEEE Projects 2020-19 in Trichy & Chennai

IEEE Projects Trichy, Best IEEE Project Centre Chennai, Final Year Projects in Trichy - We Provide IEEE projects 2018 - 2019 , IEEE 2018 Java Projects for M.E/M.Tech, IEEE 2018 Dot net Projects for B.E/B.Tech, IEEE 2018 Power electronics Projects Engineering & Diploma Students, Matlab, Embedded, NS2 Projects

VERIFIABLE ATTRIBUTE-BASED KEYWORD SEARCH OVER OUTSOURCED ENCRYPTED DATA

by

In this abstract propose a novel cryptographic solution , called verifiable attribute-based keyword search ( VABKS ). The solution allows a data user, whose credentials satisfy a data owner’s access control policy, to (i) search over the data owner’s outsourced encrypted data, (ii) outsource the tedious search operatio ns to the cloud, and (iii) verify […]

SOURCE PRIVACY WITH HOP-BY-HOP MESSAGE AUTHENTICATION IN WIRELESS SENSOR NETWORKS

by

Message authentication plays a key role in thwarting unauthorized and corrupted messages from being forwarded in networks to save the precious sensor energy. For this reason, many authentication schemes have been proposed in literature to provide message authenticity and integrity verification for wireless sensor networks. In this abstract, we propose an unconditionally secure and efficient […]

VABKS OVER OUTSOURCED ENCRYPTED DATA

by

Cloud computing allows data owners to use massive data storage and vast computation capabilities at a very low price. Despite the benefits, data outsourcing deprives data owners of direct control over their outsourced data. It is common nowadays for data owners to outsource their data to the cloud. Since the cloud cannot be fully trusted, […]

DYNAMIC RESOURCE PRICING AND COMPETITION AMONG CLOUD PROVIDERS

by

The competition among providers leads to the dynamics of cloud resource pricing. Modelling this competition involves the description of the user’s choice behaviour and the formulation of the dynamic pricing strategies of providers to adapt to the market state. Cloud providers may cooperate with each other to improve their final revenue. Based on a Service […]

WIRELESS SENSOR NETWORKS WITH HOP-BY-HOP MESSAGE AUTHENTICATION AND SOURCE PRIVACY

by

In this abstract, we propose an unconditionally secure and efficient source anonymous message authentication (SAMA) scheme based on the optimal modified ElGamal signature (MES) scheme on elliptic curves. This MES scheme is secure against adaptive chosen-message attacks in the random oracle model. Our scheme enables the intermediate nodes to authenticate the message so that all […]

COMPETITION AND COOPERATION AMONG CLOUD PROVIDERS USING A NOVEL MODEL

by

A provider naturally wishes to set a higher price to get a higher revenue; however, in doing so, it also bears the risk of discouraging demand in the future. On the other hand, they also look for the means to cooperate with other providers to reduce the operation cost and therefore improve their final revenue. […]

UNTRUSTED CLOUD ENVIRONMENTS USING SECURE KNN QUERY PROCESSING

by

Users send their current location as the query parameter, and wish to receive as result the nearest POIs, i.e., nearest – neighbors (NNs). But typical data owners do not have the technical means to support processing queries on a large scale, so they outsource data storage and querying to a cloud service provider. Many such […]

K-NEAREST NEIGHBOUR QUERY PROCESSING IN UNTRUSTED CLOUD ENVIRONMENTS

by

The emergence of mobile devices with fast Internet connectivity and geo-positioning capabilities has le d to a revolution in customized location – based services (LBS) , where users are enabled to access information about points of interest (POI ) that are relevant to their interests and are also close to their geographical coordinates. Pro b- […]

PRIVATE MATCHING PROTOCOLS BASED ON ASYMMETRIC SOCIAL PROXIMITY FOR ONLINE SOCIAL NETWORKS

by

In OSNs and Mobile Social Networks (MSNs), many distributed solutions to privately finding the social proximity between two users have been proposed in this abstract. The most common way of determining friendship between two people is through profile matching, i.e. finding out if they have common profile attributes, like interests, symptoms, or some other social […]

ONLINE SOCIAL NETWORKS USING ASYMMETRIC SOCIAL PROXIMITY BASED PRIVATE MATCHING PROTOCOLS

by

Online Social Networks have redefined the way people interact with existing friends, and more importantly, make new friends. In particular, people can now explore potential friendships via OSNs, by looking for common interests, friends, and symptoms, close geographic proximity, etc., between each other. In this abstract, we leverage community structures to redefine the OSN model […]