Zobrazeno 1 - 10
of 122
pro vyhledávání: '"V. S. Subrahmanian"'
Autor:
Sushil Jajodia, V. S. Subrahmanian, Giridhar Kaushik Ramachandran, Rajesh Ganesan, Yanhai Xiong
Publikováno v:
IEEE Transactions on Dependable and Secure Computing. 19:1434-1445
According to research from Symantec, there is a gap of 312 days on average between the time an enterprise is compromised by a zero-day attack and the time the attack is discovered by the victim. This leaves an adversary with a lot of time to exfiltra
Autor:
Antonio Picariello, Jonathan Katz, Giancarlo Sperlì, Sushil Jajodia, Tanmoy Chakraborty, V. S. Subrahmanian
Publikováno v:
IEEE Transactions on Dependable and Secure Computing. 18:518-533
Today, major corporations and government organizations must face the reality that they will be hacked by malicious actors. In this paper, we consider the case of defending enterprises that have been successfully hacked by imposing additional a poster
Publikováno v:
ACM/IMS Transactions on Data Science. 2:1-36
Timed association rules (TARs) generalize classical association rules (ARs) so that we can express temporal dependencies of the form “If X is true at time t , then Y will likely be true at time ( t +τ).” As with ARs, solving the TAR mining probl
Publikováno v:
ACM Transactions on Intelligent Systems and Technology. 11:1-25
Customers of virtually all online marketplaces rely upon reviews in order to select the product or service they wish to buy. These marketplaces in turn deploy review fraud detection systems so that the integrity of reviews is preserved. A well-known
Publikováno v:
IEEE Transactions on Information Forensics and Security. 15:3511-3525
As the most widely used OS on earth, Android is heavily targeted by malicious hackers. Though much work has been done on detecting Android malware, hackers are becoming increasingly adept at evading ML classifiers. We develop $\textsf {FARM}$ , a Fea
Publikováno v:
ACM Transactions on the Web. 12:1-35
We consider identifying highly ranked vertices in large graph databases such as social networks or the Semantic Web where there are edge labels. There are many applications where users express scoring queries against such databases that involve two e
Publikováno v:
Bai, C, Han, Q, Mezzour, G, Pierazzi, F & Subrahmanian, V S 2019, ' DBank : Predictive Behavioral Analysis of Recent Android Banking Trojans ', IEEE Transactions on Dependable and Secure Computing . https://doi.org/10.1109/TDSC.2019.2909902
Using a novel dataset of Android banking trojans (ABTs), other Android malware, and goodware, we develop the $\sf {DBank}$ DBank system to predict whether a given Android APK is a banking trojan or not. We introduce the novel concept of a Triadic Sus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92bc67abb11534a94440b5b6bfbfd80c
https://hdl.handle.net/11380/1187321
https://hdl.handle.net/11380/1187321
Autor:
Giancarlo Sperlì, Yanhai Xiong, Qian Han, Antonio Picariello, V. S. Subrahmanian, Cristian Molinaro
Past research has shown that over 8 months may elapse between the time a network is compromised and the time the attack is discovered. During this long gap, attackers can steal valuable intellectual property from the victim. The recent FORGE system s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3244fb9b5adfc9ec9e10285c937f7fd2
http://hdl.handle.net/11588/880559
http://hdl.handle.net/11588/880559
Publikováno v:
ACM Transactions on Intelligent Systems and Technology. 8:1-28
Although numerous traditional models predict market share and demand along airline routes, the prediction of existing models is not precise enough, and to the best of our knowledge, there is no use of data mining--based forecasting techniques for imp
Publikováno v:
ACM Transactions on Intelligent Systems and Technology. 8:1-25
Despite growing speculation about the role of human behavior in cyber-security of machines, concrete data-driven analysis and evidence have been lacking. Using Symantec’s WINE platform, we conduct a detailed study of 1.6 million machines over an 8-