JWJun Wang

Jun Wang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Jun Wang has a total of 45 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Deciphering the Secret Script: End-to-End Nüshu Spotting with Geometric Topology and Vertical Prior

    by Yuxin Peng, Xiao Zhang, Zongxiao Zhu, Bo Yang, Jun Wang, Xuyan Huang, Xiaojun Bi, Weizheng Qiao, Jianlin Zhu

  • L2AF: Graph-attention modulated learning automata for efficient multi-agent cooperation

    by Jun Wang, Wenjie Ke, Lu Liu, Que Dong, Jia Liu, Pan Lai, Xiao Zhang

  • Open Access

    A Secure and Policy-Controlled Signature Scheme With Strong Expressiveness and Privacy-Preserving Policy

    by Xurui Zheng, Fuyong Zheng, Xianming Liu, Dejun Wang, Jun Wang, Bo Meng

    The policy-controlled signature (PCS) scheme uses the access policy to control signature verification permission. However public access policy that may contain private information will leak user privacy. At the same time, the expressiveness of access structures in the PCS schemes is weak. Therefore, we propose a policy-controlled signature scheme with strong expressiveness and privacy-preserving policy (PCS-PP), in which linear secret sharing schemes is to design access structure which has strong expression, the three primes composite order bilinear groups is used to hide the attribute value into the attribute name that may expose the privacy data by data distortion concept. The proposed PCS-PP scheme not only has correctness and privacy-preserving policy, but also supports fine-grained signature verification. In addition, the unforgeability is proved in the random oracle model. Compared to the related schemes, the proposed PCS-PP scheme has superiority in features, computation cost and storage.


  • Open Access

    Release Connection Fingerprints in Social Networks Using Personalized Diffierential Privacy

    by Yongkai Li, Shubo Liu, Dan Li, Jun Wang

    In social networks, diffierent users may have diffierent privacy preferences and there are many users with public identities. Most work on diffierentially private social network data publication neglects this fact. We aim to release the number of public users that a private user connects to within n hops, called n-range Connection fingerprints (CFPs), under user-level personalized privacy preferences. We proposed two schemes, Distance-based exponential budget absorption (DEBA) and Distancebased uniformly budget absorption using Ladder function (DUBA-LF), for privacy-preserving publication of the CFPs based on Personalized diffierential privacy (PDP), and we conducted a theoretical analysis of the privacy guarantees provided within the proposed schemes. The implementation showed that the proposed schemes are superior in publication errors on real datasets.


  • Open Access

    CryptoRec: Privacy-preserving Recommendation as a Service

    by Jun Wang, Afonso Arriaga, Qiang Tang, Peter Y. A. Ryan

    Recommender systems rely on large datasets of historical data and entail serious privacy risks. A server offering Recommendation as a Service to a client might leak more information than necessary regarding its recommendation model and dataset. At the same time, the disclosure of the client's preferences to the server is also a matter of concern. Devising privacy-preserving protocols using general cryptographic primitives (e.g., secure multi-party computation or homomorphic encryption), is a typical approach to overcome privacy concerns, but in conjunction with state-of-the-art recommender systems often yields far-from-practical solutions. In this paper, we tackle this problem from the direction of constructing crypto-friendly machine learning algorithms. In particular, we propose CryptoRec, a secure two-party computation protocol for Recommendation as a Service, which encompasses a novel recommender system. This model possesses two interesting properties: (1) It models user-item interactions in an item-only latent feature space in which personalized user representations are automatically captured by an aggregation of pre-learned item features. This means that a server with a pre-trained model can provide recommendations for a client whose data is not in its training set. Nevertheless, re-training the model with the client's data still improves accuracy. (2) It only uses addition and multiplication operations, making the model straightforwardly compatible with homomorphic encryption schemes. We demonstrate the efficiency and accuracy of CryptoRec on three real-world datasets. CryptoRec allows a server with thousands of items to privately answer a prediction query within a few seconds on a single PC, while its prediction accuracy is still competitive with state-of-the-art recommender systems computing over clear data.

  • Open Access

    Node Location Privacy Protection Based on Differentially Private Grids in Industrial Wireless Sensor Networks

    by Jun Wang, Rongbo Zhu, Shubo Liu, Zhaohui Cai

    Wireless sensor networks (WSNs) are widely applied in industrial application with the rapid development of Industry 4.0. Combining with centralized cloud platform, the enormous computational power is provided for data analysis, such as strategy control and policy making. However, the data analysis and mining will bring the issue of privacy leakage since sensors will collect varieties of data including sensitive location information of monitored objects. Differential privacy is a novel technique that can prevent compromising single record benefits. Geospatial data can be indexed by a tree structure; however, existing differentially private release methods pay no attention to the concrete analysis about the partition granularity of data domains. Based on the overall analysis of noise error and non-uniformity error, this paper proposes a data domain partitioning model, which is more accurate to choose the grid size. A uniform grid release method is put forward based on this model. In order to further reduce the errors, similar cells are merged, and then noise is added into the merged cells. Results show that our method significantly improves the query accuracy compared with other existing methods.


  • Open Access

    A Differentially Private Unscented Kalman Filter for Streaming Data in IoT

    by Jun Wang, Rongbo Zhu, Shubo Liu

    With the evolution and development of the 5th generation (5G) technology, Internet of Things (IoT) within 5G provides a foundation and opportunity for smart home and smart healthcare. However, these scenarios will critically rely on the large-scale deployed sensors that constantly transmit streaming data to cloud platform for real-time estimation, which brings the issue of privacy disclosure since smart devices will gather kinds of data including personal sensitive information. Meanwhile, there is not some universal method to solve privacy problem in 5G because of diversified security needs for different applications. In this paper, an unscented Kalman filter based differentially private steaming data share scheme is proposed to protect user privacy for cloud platform in IoT. The proposed method can ensure that released data will not compromise individual privacy, and improve the utility of released data simultaneously. The proposed scheme is evaluated by four real-world datasets and compared with the results of utility optimization scheme based on Kalman filter. Experiments show that the proposed scheme enhances the utility of released streaming data under the premise of effective privacy preserving and achieve better practicability and validity.


  • Open Access

    Release Connection Fingerprints in Social Networks Using Personalized Differential Privacy

    by Yongkai Li, Shubo Liu, Dan Li, Jun Wang

    In social networks, different users may have different privacy preferences and there are many users with public identities. Most work on differentially private social network data publication neglects this fact. We aim to release the number of public users that a private user connects to within n hops, called n-range Connection fingerprints(CFPs), under user-level personalized privacy preferences. We proposed two schemes, Distance-based exponential budget absorption (DEBA) and Distance-based uniformly budget absorption using Ladder function (DUBA-LF), for privacy-preserving publication of the CFPs based on Personalized differential privacy(PDP), and we conducted a theoretical analysis of the privacy guarantees provided within the proposed schemes. The implementation showed that the proposed schemes are superior in publication errors on real datasets.