Binghui Wang

ORCID: 0000-0001-5616-060X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Adversarial Robustness in Machine Learning
  • Advanced Graph Neural Networks
  • Privacy-Preserving Technologies in Data
  • Network Security and Intrusion Detection
  • Face and Expression Recognition
  • Internet Traffic Analysis and Secure E-voting
  • Spam and Phishing Detection
  • Face recognition and analysis
  • Complex Network Analysis Techniques
  • Explainable Artificial Intelligence (XAI)
  • Biometric Identification and Security
  • Privacy, Security, and Data Protection
  • Advanced Neural Network Applications
  • Anomaly Detection Techniques and Applications
  • Stochastic Gradient Optimization Techniques
  • Machine Learning in Materials Science
  • Topic Modeling
  • Advanced Malware Detection Techniques
  • Cryptography and Data Security
  • Ethics and Social Impacts of AI
  • Domain Adaptation and Few-Shot Learning
  • Generative Adversarial Networks and Image Synthesis
  • Recommender Systems and Techniques
  • Hate Speech and Cyberbullying Detection
  • Bayesian Modeling and Causal Inference

Illinois Institute of Technology
2021-2025

Qingdao University of Science and Technology
2025

PLA Information Engineering University
2023

IIT Research Institute
2023

Duke University
2019-2021

Iowa State University
2016-2019

Dalian University of Technology
2013-2015

Shenyang Medical College
2012

Hohai University
2006

Hyperparameters are critical in machine learning, as different hyperparameters often result models with significantly performance. may be deemed confidential because of their commercial value and the confidentiality proprietary algorithms that learner uses to learn them. In this work, we propose attacks on stealing learned by a learner. We call our hyperparameter attacks. Our applicable variety popular learning such ridge regression, logistic support vector machine, neural network. evaluate...

10.1109/sp.2018.00038 article EN 2022 IEEE Symposium on Security and Privacy (SP) 2018-05-01

In this work, we propose the first backdoor attack to graph neural networks (GNN). Specifically, a subgraph based GNN for classification. our attack, classifier predicts an attacker-chosen target label testing once predefined is injected graph. Our empirical results on three real-world datasets show that attacks are effective with small impact GNN's prediction accuracy clean graphs. Moreover, generalize randomized smoothing certified defense defend against attacks. in some cases but...

10.1145/3450569.3463560 article EN 2021-06-11

Federated learning (FL) is a popular distributed framework that can reduce privacy risks by not explicitly sharing private data. However, recent works have demonstrated model updates makes FL vulnerable to inference attack. In this work, we show our key observation the data representation leakage from gradients essential cause of in FL. We also provide an analysis explain how presentation leaked. Based on observation, propose defense called Soteria against inversion attack The idea perturb...

10.1109/cvpr46437.2021.00919 article EN 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) 2021-06-01

Online social networks are known to be vulnerable the so-called Sybil attack, in which an attacker maintains massive fake accounts (also called Sybils) and uses them perform various malicious activities. Therefore, detection is a fundamental security research problem online networks. Random walk based methods, leverage structure of network distribute reputation scores for users, have been demonstrated promising certain real-world In particular, random methods three desired features: they can...

10.1109/dsn.2017.55 article EN 2017-06-01

Graph-based classification methods are widely used for security analytics. Roughly speaking, graph-based include collective and graph neural network. Attacking a method enables an attacker to evade detection in However, existing adversarial machine learning studies mainly focused on non-graph data. Only few recent touched methods. they network, leaving largely unexplored. We aim bridge this gap work. consider attacker's goal is via manipulating the structure. formulate our attack as...

10.1145/3319535.3354206 article EN Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security 2019-11-06

Graph-based semi-supervised node classification (GraphSSC) has wide applications, ranging from networking and security to data mining machine learning, etc. However, existing centralized GraphSSC methods are impractical solve many real-world graph-based problems, as collecting the entire graph labeling a reasonable number of labels is time-consuming costly, privacy may be also violated. Federated learning (FL) an emerging paradigm that enables collaborative among multiple clients, which can...

10.1109/icdm54844.2022.00060 article EN 2021 IEEE International Conference on Data Mining (ICDM) 2022-11-01

Detecting Sybils in online social networks (OSNs) is a fundamental security research problem as adversaries can leverage to perform various malicious activities. Structure-based methods have been shown be promising at detecting Sybils. Existing structure-based classified into two categories: Random Walk (RW)-based and Loop Belief Propagation (LBP)-based methods. RW-based cannot labeled benign users simultaneously, which limits their detection accuracy, they are not robust noisy labels....

10.1109/infocom.2017.8057066 article EN IEEE INFOCOM 2022 - IEEE Conference on Computer Communications 2017-05-01

Detecting fraudulent users in online social networks is a fundamental and urgent research problem as adversaries can use them to perform various malicious activities. Global structure based methods, which are known guilt-by-association, have been shown be promising at detecting users. However, existing guilt-by-association methods either assume symmetric (i.e., undirected) links, oversimplifies the asymmetric directed) of real-world networks, or only leverage labeled normal (but not both)...

10.1109/icdm.2017.56 article EN 2021 IEEE International Conference on Data Mining (ICDM) 2017-11-01

In the attribute inference problem, we aim to infer users' private attributes (e.g., locations, sexual orientation, and interests) using their public data in online social networks. State-of-the-art methods leverage a user's both friends behaviors page likes on Facebook, apps that user reviewed Google Play) attributes. However, these suffer from two key limitations: 1) suppose certain for target training dataset, they only labeled users who have attribute, while ignoring label information of...

10.1145/3038912.3052695 article EN 2017-04-03

Federated learning is a popular distributed machine paradigm with enhanced privacy. Its primary goal global model that offers good performance for the participants as many possible. The technology rapidly advancing unsolved challenges, among which statistical heterogeneity (i.e., non-IID) and communication efficiency are two critical ones hinder development of federated learning. In this work, we propose LotteryFL -- personalized communication-efficient framework via exploiting Lottery...

10.48550/arxiv.2008.03371 preprint EN other-oa arXiv (Cornell University) 2020-01-01

This paper proposes a novel simultaneous and proportional multiple degree of freedom (DOF) myoelectric control method for active prostheses.The approach is based on non-negative matrix factorization (NMF) surface EMG signals with the inclusion sparseness constraints. By applying constraint to signal matrix, it possible extract basis information from arbitrary movements (quasi-unsupervised approach) DOFs concurrently.In online testing target hitting, able-bodied subjects reached greater...

10.1088/1741-2552/aa9666 article EN cc-by Journal of Neural Engineering 2017-10-27

Community detection plays a key role in understanding graph structure. However, several recent studies showed that community is vulnerable to adversarial structural perturbation. In particular, via adding or removing small number of carefully selected edges graph, an attacker can manipulate the detected communities. best our knowledge, there are no on certifying robustness against such this work, we aim bridge gap. Specifically, develop first certified guarantee Given arbitrary method, build...

10.1145/3366423.3380029 article EN 2020-04-20

Social networks are known to be vulnerable the so-called Sybil attack, in which an attacker maintains massive Sybils and uses them perform various malicious activities. Therefore, detection social is a basic security research problem. Structure-based methods have been shown promising at detecting Sybils. Existing structure-based can classified into two categories: Random Walk (RW)-based Loop Belief Propagation (LBP)-based methods. RW-based cannot leverage labeled benign users simultaneously,...

10.1109/tnse.2018.2813672 article EN IEEE Transactions on Network Science and Engineering 2018-03-08

Backdoor attack is a severe security threat to deep neural networks (DNNs). We envision that, like adversarial examples, there will be cat-and-mouse game for backdoor attacks, i.e., new empirical defenses are developed defend against attacks but they soon broken by strong adaptive attacks. To prevent such game, we take the first step towards certified Specifically, in this work, study feasibility and effectiveness of certifying robustness using recent technique called randomized smoothing....

10.48550/arxiv.2002.11750 preprint EN other-oa arXiv (Cornell University) 2020-01-01

Many security and privacy problems can be modeled as a graph classification problem, where nodes in the are classified by collective simultaneously.Stateof-the-art methods for such graph-based analytics follow following paradigm: assign weights to edges of graph, iteratively propagate reputation scores among weighted use final classify graph.The key challenge is edge that an has large weight if two corresponding have same label, small otherwise.Although been studied applied more than decade,...

10.14722/ndss.2019.23226 preprint EN 2019-01-01

Channel reassignment is to assign again on the assigned channel resources in order use more efficiently. Software-Defined Networking (SDN) based Internet of Things (SDN-IoT) a promising paradigm improve communication performance network, since it allows software-defined routers (SDRs) with help SDN controller appropriately schedule traffic loads meet better transaction corresponding channels one link. However, existing works have many limitations. In this paper, we develop joint...

10.1109/tnse.2020.3036456 article EN IEEE Transactions on Network Science and Engineering 2020-11-06

Graph neural networks (GNNs) have recently gained much attention for node and graph classification tasks on graph-structured data. However, multiple recent works showed that an attacker can easily make GNNs predict incorrectly via perturbing the structure, i.e., adding or deleting edges in graph. We aim to defend against such attacks developing certifiably robust GNNs. Specifically, we prove first certified robustness guarantee of any GNN both classifications structural perturbation....

10.1145/3447548.3467295 article EN 2021-08-13

Sybil attacks are becoming increasingly widespread and pose a significant threat to online social systems; single adversary can inject multiple colluding identities in the system compromise security privacy. Recent works have leveraged network-based trust relationships defend against attacks. However, existing defenses based on oversimplified assumptions about network structure, which do not necessarily hold real-world networks. Recognizing these limitations, we propose SYBILFUSE,...

10.1109/cns.2018.8433147 article EN 2018-05-01

Large language models (LLMs) have achieved remarkable success due to their exceptional generative capabilities. Despite success, they also inherent limitations such as a lack of up-to-date knowledge and hallucination. Retrieval-Augmented Generation (RAG) is state-of-the-art technique mitigate those limitations. In particular, given question, RAG retrieves relevant from database augment the input LLM. For instance, retrieved could be set top-k texts that are most semantically similar question...

10.48550/arxiv.2402.07867 preprint EN arXiv (Cornell University) 2024-02-12

This article studies an emerging practical problem called heterogeneous prototype learning (HPL). Unlike the conventional face synthesis (HFS) that focuses on precisely translating a image from source domain to another target one without removing facial variations, HPL aims at variation-free of in while preserving identity characteristics. is compounded involving two cross-coupled subproblems, is, transfer and (PL), thus making most existing HFS methods simply style images unsuitable for...

10.1109/tnnls.2024.3393072 article EN IEEE Transactions on Neural Networks and Learning Systems 2024-01-01

Graph neural network (GNN), the mainstream method to learn on graph data, is vulnerable evasion attacks, where an attacker slightly perturbing structure can fool trained GNN models. Existing work has at least one of following drawbacks: 1) limited directly attack two-layer GNNs; 2) inefficient; and 3) impractical, as they need know full or part model parameters.

10.1145/3616855.3635826 article EN 2024-03-04

Hyperparameters are critical in machine learning, as different hyperparameters often result models with significantly performance. may be deemed confidential because of their commercial value and the confidentiality proprietary algorithms that learner uses to learn them. In this work, we propose attacks on stealing learned by a learner. We call our hyperparameter attacks. Our applicable variety popular learning such ridge regression, logistic support vector machine, neural network. evaluate...

10.48550/arxiv.1802.05351 preprint EN other-oa arXiv (Cornell University) 2018-01-01

Graph-based semi-supervised node classification (GraphSSC) has wide applications, ranging from networking and security to data mining machine learning, etc. However, existing centralized GraphSSC methods are impractical solve many real-world graph-based problems, as collecting the entire graph labeling a reasonable number of labels is time-consuming costly, privacy may be also violated. Federated learning (FL) an emerging paradigm that enables collaborative among multiple clients, which can...

10.48550/arxiv.2012.04187 preprint EN other-oa arXiv (Cornell University) 2020-01-01
Coming Soon ...