Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Jiawei Zhu is active.

Publication


Featured researches published by Jiawei Zhu.


international conference on information and communication security | 2012

Permission-based abnormal application detection for android

Jiawei Zhu; Zhi Guan; Yang Yang; Liangwen Yu; Huiping Sun; Zhong Chen

Android has become one of the most popular mobile operating system because of numerous applications it provides. Android Market is the official application store which allows users to search and install applications to their Android devices. However, with the increasingly number of applications, malware is also beginning to turn up in app stores. To mitigate the security problem brought by malware, we put forward a novel permission-based abnormal application detection framework which identifies potentially dangerous apps by the reliability of their permission lists. To judge the reliability of apps permissions, we make use of the relation between apps description text and its permission list. In detail, we use Naive Bayes with Multinomial Event Model algorithm to build the relation between the description and the permission list of an application. We evaluate this framework with 5,685 applications in Android Market and find it effective in identifying abnormal application in Android Market.


international conference on information and communication security | 2012

Privacy protection in social networks using l -diversity

Liangwen Yu; Jiawei Zhu; Zhengang Wu; Tao Yang; Jianbin Hu; Zhong Chen

With the increasing popularity of online social networks, such as twitter and weibo, privacy preserving publishing of social network data has raised serious concerns. In this paper, we focus on the problem of preserving the sensitive attribute of the node in social network data. We call a graph l-diversity anonymous if all the same degree nodes in the graph form a group in which the frequency of the most frequent sensitive value is at most


web age information management | 2015

Location Semantics Protection Based on Bayesian Inference

Zhengang Wu; Zhong Chen; Jiawei Zhu; Huiping Sun; Zhi Guan

\frac{1}{l}


web age information management | 2013

A Hybrid Approach for Privacy Preservation in Location Based Queries

Zhengang Wu; Liangwen Yu; Jiawei Zhu; Huiping Sun; Zhi Guan; Zhong Chen

. To achieve this objective, we devise an efficient heuristic algorithm via graphic l-diverse partition and also use three anonymous strategies(AdjustGroup, RedirectEdges, AssignResidue)to optimize the heuristic algorithm. Finally, we verify the effectiveness of the algorithm through experiments.


ubiquitous intelligence and computing | 2015

API Sequences Based Malware Detection for Android

Jiawei Zhu; Zhengang Wu; Zhi Guan; Zhong Chen

In mobile Internet, popular Location-Based Services (LBSs) recommend Point-of-Interest (POI) data according to physical positions of smartphone users. However, untrusted LBS providers can violate location privacy by analyzing user requests semantically. Therefore, this paper aims at protecting user privacy in location-based applications by evaluating disclosure risks on sensitive location semantics. First, we introduce a novel method to model location semantics for user privacy using Bayesian inference and demonstrate details of computing the semantic privacy metric. Next, we design a cloaking region construction algorithm against the leakage of sensitive location semantics. Finally, a series of experiments evaluate this solution’s performance to show its availability.


web age information management | 2014

Edges Protection in Multiple Releases of Social Network Data

Liangwen Yu; Yonggang Wang; Zhengang Wu; Jiawei Zhu; Jianbin Hu; Zhong Chen

With rapidly popular location-aware applications, location privacy becomes an emerging issue. This paper studies how to protect the two-fold privacy for both client-side and server-side in location-based queries. This technique is a significant component in privacy-friendly Location Based Services (LBS). Participants protect their own privacy. The LBS server protects against excessive disclose of location records in its Points of Interest (POIs) database while the mobile user protects his exact location by the cloaking technique. The proposed hybrid approach can achieve the challenging goal. Our solution integrates the cloaking technique with a cryptographic protocol, Private Set Intersection (PSI). In addition, this solution is secure in malicious model and also practical.


ubiquitous intelligence and computing | 2014

Privacy Protection against Query Prediction in Location-Based Services

Zhengang Wu; Liangwen Yu; Jiawei Zhu; Huiping Sun; Zhi Guan; Zhong Chen

To mitigate security problem brought by Android malware, various work has been proposed such as behavior based malware detection and data mining based malware detection. In this paper, we put forward a novel Android malware detection model using data mining techniques. We design an algorithm with two steps. The first step is modeling Android application code into graph structure, called API control flow graph by us. Next step is calculating API sequences fulfilling minimum intra-family support in each malware family because malware in malware family usually share similar behavior pattern. Finally, supervised learning method is took advantage in building our malware detecting model with API sequences as input features. We evaluate this model with 1200 applications, half of them are malicious and half are benign, and find it effective in identifying Android malware and even unknown malware.


web age information management | 2013

Sensitive edges protection in social networks

Liangwen Yu; Tao Yang; Zhengang Wu; Jiawei Zhu; Jianbin Hu; Zhong Chen

With the increasing popularity of online social networks, such as twitter and weibo, privacy preserving publishing of social network data has raised serious concerns. Previous works only consider a single static release of social network data, which are not inadequate for analyzing the evolution of social networks. In this paper, we focus on the problem of preserving edges when edges are deleted or added in multiple releases of social network data. To achieve this objective, we propose the Dynamic Safety Condition, which effectively constrains nodes partition to ensure sparsity of edges between any two group. Using this condition, we devise the heuristic algorithm DEP, which anonymizes a sequential graphs to satisfy the privacy objective. Finally, we verify the effectiveness of the algorithm through experiments.


ieee international conference on advanced computational intelligence | 2015

Appearance similarity evaluation for Android applications

Jiawei Zhu; Zhengang Wu; Zhi Guan; Zhong Chen

In mobile Internet, Location-Based Services (LBSs) as a popular kind of context-aware recommendation systems can recommend Point of Interest (POI) data according to current locations of users. However, the inherent feature leads to leak sensitive location information of users into untrusted LBS providers. This paper aims at the location privacy problem on query prediction which forecasts next locations and violates user privacy seriously. To tackle this, we propose a novel location privacy protection solution. The contribution is three-fold. First, we model query prediction on cloaking regions using the Bayesian inference. Next, the proposed location anonymization method can generalize locations into safer cloaking regions against such query prediction attacks. Finally, a series of experiments evaluate the performance of this solution and demonstrate its availability.


Archive | 2012

Method for implementing public key cryptography for resisting cold boot attack

Zhi Guan; Yang Yang; Qiuxiang Dong; Jiawei Zhu; Zhong Chen

With the increasing popularity of online social networks, such as twitter and weibo, privacy preserving publishing of social network data has raised serious concerns. In this paper, we focus on the problem of preserving the sensitive edges in social network data. We call a graph is k-sensitive anonymous if the probability of an attacker can re-identify a sensitive node or a sensitive edge is at most

Collaboration


Dive into the Jiawei Zhu's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge