Theo dõi
Seyedsina Nabavirazavi
Seyedsina Nabavirazavi
Email được xác minh tại fiu.edu - Trang chủ
Tiêu đề
Trích dẫn bởi
Trích dẫn bởi
Năm
Enhancing federated learning robustness through randomization and mixture
S Nabavirazavi, R Taheri, SS Iyengar
Future Generation Computer Systems 158, 28-43, 2024
112024
Impact of aggregation function randomization against model poisoning in federated learning
S Nabavirazavi, R Taheri, M Shojafar, SS Iyengar
22nd IEEE international conference on trust, security and privacy in …, 2024
42024
Model poisoning attack against federated learning with adaptive aggregation
S Nabavirazavi, R Taheri, M Ghahremani, SS Iyengar
Adversarial Multimedia Forensics, 1-27, 2023
42023
Do We Really Need to Design New Byzantine-robust Aggregation Rules?
M Fang, S Nabavirazavi, Z Liu, W Sun, SS Iyengar, H Yang
arXiv preprint arXiv:2501.17381, 2025
32025
Advancing Forensic Science: AI and Knowledge Graphs Unlock New Insights
SS Iyengar, S Nabavirazavi, H Rathore, Y Hariprasad, NK Chaudhary
Journal of Forensic Research 15 (3), 7, 2024
12024
Evaluating the Universality of “Do Anything Now” Jailbreak Prompts on Large Language Models: Content Warning: This paper contains unfiltered and harmful examples.
S Nabavirazavi, S Zad, SS Iyengar
2025 IEEE 15th Annual Computing and Communication Workshop and Conference …, 2025
2025
Privacy and Security Challenges in Large Language Models
V Rathod, S Nabavirazavi, S Zad, SS Iyengar
2025 IEEE 15th Annual Computing and Communication Workshop and Conference …, 2025
2025
Lightweight Malicious Packet Classifier for IoT Networks
S Nabavirazavi, SS Iyengar, NK Chaudhary
International Conference on Information Security, Privacy and Digital …, 2022
2022
LAKEE: A Lightweight Authenticated Key Exchange Protocol for Power Constrained Devices
S Nabavirazavi, SS Iyengar
arXiv preprint arXiv:2210.16367, 2022
2022
FAST: Federated Average with Snapshot Unleashes Arbitrary Client Participation
Z Li, S Nabavirazavi, B Ying, S Iyengar, H Yang
Hệ thống không thể thực hiện thao tác ngay bây giờ. Hãy thử lại sau.
Bài viết 1–10