Hoda Maleki

dblp:139/6506 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
5since 2021 · last 2024
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 3 · 3 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1
YearPublicationVenuePosition
2024 Evaluating and Extending Techniques for Fine-Grained Text-Topic Prediction for Digital Forensic Data
Khan Mohammad Al Farabi, Gagan Agrawal, Gokila Dorai, Rajon Bardhan, Hoda Maleki, Thomas E. Kadri
ICDF2C (2)5
2024 Organizing Records for Retrieval in Multi-Dimensional Range Searchable Encryption
Mahdieh Heidaripour, Ladan Kian, Maryam Rezapour, Mark Holcomb, Benjamin Fuller 0001, Gagan Agrawal, Hoda Maleki
SECRYPT7
2023 Classify Me Correctly if You Can: Evaluating Adversarial Machine Learning Threats in NIDS
Neea Rusch, Asma Jodeiri Akbarfam, Hoda Maleki, Gagan Agrawal, Gokila Dorai
SecureComm (1)3
2022 Securing Pseudonym Schemes for Vehicular Privacy
abstract
This poster reports on a project to improve privacy in the presence of vehicle-to-everything (V2X) communication. Cooperative Intelligent Transport Systems (C-ITS) enable communication and information sharing between a vehicle and other entities using V2X. While there are many (emerging) applications for such messages, they also compromise privacy. Though pseudonym change strategies have been developed, privacy attacks have been demonstrated. This paper reports on a study that shows that by adding a small random noise to the length and widths of cars in V2X messages, these attacks can be defeated without negatively impacting the applications of these messages.
Md Hasan, Hoda Maleki, Gagan Agrawal
IEEE Big Data2
2021 Privacy-Preserving Framework to Facilitate Shared Data Access for Wearable Devices
abstract
Wearable devices are emerging as effective modalities for the collection of individuals’ data. While this data can be leveraged for use in several areas ranging from health-care to crime investigation, storing and securely accessing such information while preserving privacy and detecting any tampering attempts are significant challenges. This paper describes a decentralized system that ensures an individual’s privacy, maintains an immutable log of any data access, and provides decentralized access control management. Our proposed framework uses a custom permissioned blockchain protocol to securely log data transactions from wearable devices in the blockchain ledger. We have implemented a proof-of-concept for our framework, and our preliminary evaluation is summarized to demonstrate our proposed framework’s capabilities. We have also discussed various application scenarios of our privacy-preserving model using blockchain and proof-of-authority. Our research aims to detect data tampering attempts in data sharing scenarios using a thorough transaction log model.
Dane Troyer, Justin Henry, Hoda Maleki, Gokila Dorai, Bethany Sumner, Gagan Agrawal, Jon Ingram
IEEE BigData3
2020 Using Universal Composition to Design and Analyze Secure Complex Hardware Systems
abstract
Modern hardware typically is characterized by a multitude of interacting physical components and software mechanisms. To address this complexity, security analysis should be modular: We would like to formulate and prove security properties of individual components, and then deduce the security of the overall design (encompassing hardware and software) from the security of the components. While this seems like an elusive goal, we argue that this is essentially the only feasible way to provide rigorous security analysis of modern hardware.This paper investigates the possibility of using the Universally Composable (UC) security framework towards this aim. The UC framework has been devised and successfully used in the theoretical cryptography community to study and formally prove security of arbitrarily interleaving cryptographic protocols. In particular, a sophisticated analytical toolbox has been developed using this framework. We provide an introduction to this frame-work, and investigate, via a number of examples, ways by which this framework can be used to facilitate a novel type of modular security analysis. This analysis applies to combined hardware and software systems, and investigates their security against attacks that combine both physical and digital steps.
Ran Canetti, Marten van Dijk, Hoda Maleki, Ulrich Rührmair, Patrick Schaumont
DATE3