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
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 […]
COMBINING USER INTEREST AND SOCIAL CIRCLE WITH PERSONALIZED RECOMMENDATION
Recommender system (RS) has been successfully exploited to solve information overload. In E-Commerce, like Amazon, it is important to handling mass scale of information, such as recommending user preferred items and products. With the advent and popularity of social network, more and more users like to share their experiences, such as ratings, reviews, and blogs. […]
PRIVACY-PRESERVING ALGORITHMS FOR DETERMINING AN OPTIMAL MEETING LOCATION FOR MOBILE DEVICES
Privacy of a user’s location or location preferences, with respect to other users and the third-party service provider, is a critical concern in such location-sharing-based applications. Equipped with state-of-the-art smart phones and mobile devices, today’s highly interconnected urban population is increasingly dependent on these gadgets to organize and plan their daily lives. These applications often […]
PERSONALIZED RECOMMENDER SYSTEM COMBINING USER INTEREST AND SOCIAL CIRCLE
In this abstract, three social factors, personal interest, inter-personal interest similarity, and interpersonal influence, fuse into a unified personalized recommendation model based on probabilistic matrix factorization. The personality is denoted by user-item relevance of user interest to the topic of item. To embody the effect of user’s personality, we mine the topic of item based […]
ENHANCING THE QOS SUPPORT CAPABILITY OF HYBRID NETWORKS USING QOS-ORIENTED DISTRIBUTED ROUTING PROTOCOL
The emergence and the envisioned future of real time and multimedia applications have stimulated the need of high Quality of Service (QoS) support in wireless and mobile networking environments. The QoS support reduces end-to-end transmission delay and enhances throughput to guarantee the seamless communication between mobile devices and wireless infrastructures. In order to enhance the […]
CLOUD COMPUTING WITH SHARED AUTHORITY BASED PRIVACY-PRESERVING AUTHENTICATION PROTOCOL
In our model, privacy is accomplished by encrypting the data it can prevent the un authorized access. We are going to raise the privacy level of the data owner and the confidentiality of the data by providing access to users. Here we proposed the secured system and data owner can decide whether the user can […]
CLOUD BACKUP SERVICES OF PERSONAL STORAGE USING APPLICATION-AWARE LOCAL-GLOBAL SOURCE DEDUPLICATION
Data deduplication, an effective data compression approach that exploits data redundancy, partitions large data objects into smaller parts, called chunks, represents these chunks by their fingerprints (i.e., generally a crypto-graphic hash of the chunk data), replaces the duplicate chunks with their fingerprints after chunk fingerprint index lookup, and only transfers or stores the unique chunks […]
MRSE SCHEME OVER ENCRYPTED CLOUD DATA FOR PRIVACY PRESERVING
To protect data privacy and combat unsolicited accesses in the cloud and beyond, sensitive data, e.g., emails, personal health records, photo albums, tax documents, financial transactions, etc., may have to be encrypted by data owners before outsourcing to the commercial public cloud; this, however, obsoletes the traditional data utilization service based on plaintext keyword search. […]
AN EFFICIENT MULTI-KEYWORD RANKED SEARCH SCHEME OVER ENCRYPTED CLOUD DATA
In this abstract, for the first time, we define and solve the problem of multi-keyword ranked search over encrypted cloud data (MRSE) while preserving strict system-wise privacy in the cloud computing paradigm. Among various multi-keyword semantics, we choose the efficient similarity measure of “coordinate matching”, i.e., as many matches as possible, to capture the relevance […]