Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Filters








303 Hits in 4.2 sec

Anonymous networking amidst active adversaries

Parv Venkitasubramaniam, Lang Tong
2009 MILCOM 2009 - 2009 IEEE Military Communications Conference  
Using numerical examples, the tradeoff between the achievable anonymity and the power of the adversary is demonstrated as a function of the throughput for passive and active adversaries.  ...  The problem of anonymous wireless networking is considered when adversaries who monitor the transmissions in the network are also capable of compromising a fraction of nodes to extract network information  ...  In that setup, the uncertainty in the choice of nodes to monitor gives rise to a game-theoretic formulation.  ... 
doi:10.1109/milcom.2009.5379947 fatcat:v6eznu3x3ndovizd52mtknkg6a

Anonymous networking with localized eavesdroppers: A game-theoretic approach

Parv Venkitasubramaniam, Lang Tong
2009 2009 43rd Annual Conference on Information Sciences and Systems  
Using numerical examples, the tradeoff between the achievable anonymity and the power of the adversary is demonstrated as a function of the throughput for passive and active adversaries.  ...  The problem of anonymous wireless networking is considered when adversaries who monitor the transmissions in the network are also capable of compromising a fraction of nodes to extract network information  ...  In that setup, the uncertainty in the choice of nodes to monitor gives rise to a game-theoretic formulation.  ... 
doi:10.1109/ciss.2009.5054731 dblp:conf/ciss/VenkitasubramaniamT09 fatcat:wy6cecmi6bhefjjgi5zypamjpm

A Game-Theoretic Approach to Anonymous Networking

Parv Venkitasubramaniam, Lang Tong
2012 IEEE/ACM Transactions on Networking  
At the saddle point, the strategy of the network designer is to ensure that any subset of nodes monitored by the adversary reveals identical amount of information about the routes.  ...  Quantifying anonymity using conditional entropy of the routes given the adversary's observation, the problem of optimizing anonymity is posed as a two player zero-sum game between the network designer  ...  The adversary's goal is to identify which of these sessions is currently active in the network by monitoring the transmission timing of the monitored nodes. s 1 = {(A 1 , B 1 , C 1 ), (A 2 , B 2 , C 2  ... 
doi:10.1109/tnet.2011.2176511 fatcat:drln6aqn7zdpfaenkxwe2kieji

Optimal Scanning Bandwidth Strategy Incorporating Uncertainty about Adversary's Characteristics

Andrey Garnaev, Wade Trappe
2014 EAI Endorsed Transactions on Mobile Communications and Applications  
Similarly, the Scanner faces a dilemma: the wider the bandwidth scanned, the higher the probability of detecting the Invader, but at the expense of increasing the cost of building the scanning system.  ...  In particular, we have found a discontinuous dependence of the equilibrium strategies on the network parameters, fine and the type of the Invader's award.  ...  The game has a saddle point in mixed strategies, and let P (x, y) be the value of the game. Then P (x, y) is the maximal detection probability of the Invader under worst conditions. B.  ... 
doi:10.4108/mca.2.5.e6 fatcat:qnyh5gumfffqvfbulcfuw5h4zm

ICARUS: Attacking low Earth orbit satellite networks

Giacomo Giuliari, Tommaso Ciussani, Adrian Perrig, Ankit Singla
2021 USENIX Annual Technical Conference  
We find that a small amount of attack bandwidth can hamper communications between large terrestrial areas.  ...  In this context, we present ICARUS, a new class of denial of service attacks on LEO networks.  ...  We gratefully acknowledge financial support from ETH Zurich and from the Zurich Information Security and Privacy Center (ZISC).  ... 
dblp:conf/usenix/GiuliariCPS21 fatcat:3adiedtkvnegbf26ajwggytyyy

Adversarial Machine Learning and Defense Game for NextG Signal Classification with Deep Learning [article]

Yalin E. Sagduyu
2022 arXiv   pre-print
A defense mechanism can increase the adversary's uncertainty by introducing controlled errors in the victim model's decisions (i.e., poisoning the adversary's training data).  ...  The interactions between the defender and the adversary are formulated as a non-cooperative game, where the defender selects the probability of defending or the defense level itself (i.e., the ratio of  ...  The average utility of the defender in response to the adversary's strategy p A is given by and the average utility of the adversary in response to the defender's strategy d is given by u (D) (d, p A )  ... 
arXiv:2212.11778v1 fatcat:e2umbuoygjhkxkkm7r2ync627e

Randomized Moving Target Approach for MAC-Layer Spoofing Detection and Prevention in IoT Systems

Pooria Madani, Natalija Vlajic, Ivo Maljevic
2022 Digital Threats: Research and Practice  
Unfortunately, the previous research works on signal-level device fingerprinting have been based on rather simplistic assumptions about both - the adversary's behavior as well as the operation of the defense  ...  The goal of our work was to examine the effectiveness of a novel system that combines signal-level device fingerprinting with the principles of Randomized Moving Target Defense (RMTD) when dealing with  ...  In order to introduce more uncertainties into the adversary's evading activities we have opt-in to introduce a novel instance space randomization defense.  ... 
doi:10.1145/3477403 fatcat:2qumdu76vnet3oetwflixwkiiu

Privacy Preservation for Context Sensing on Smartphone

Wei Wang, Qian Zhang
2016 IEEE/ACM Transactions on Networking  
In this paper, we identify the context privacy problem with consideration of the context dynamics and malicious adversaries with capabilities of adjusting their attacking strategies.  ...  However, most of these applications aggressively collect users' sensing data without providing clear statements on the usage and disclosure strategies of such sensitive information, which raises severe  ...  Fig. 8-10 compare the performance of different strategies under offline attacks.  ... 
doi:10.1109/tnet.2015.2512301 fatcat:fmyzslsdoncdbjfmjext2xqaj4

Poisoning Behavioral Malware Clustering [article]

Battista Biggio, Konrad Rieck, Davide Ariu, Christian Wressnegger, Igino Corona, Giorgio Giacinto, Fabio Roli
2018 arXiv   pre-print
Clustering algorithms have become a popular tool in computer security to analyze the behavior of malware variants, identify novel malware families, and generate signatures for antivirus systems.  ...  Our experiments not only demonstrate that this tool is vulnerable to poisoning attacks, but also that it can be significantly compromised even if the attacker can only inject a very small percentage of  ...  Attack Strategy Based on the presented threat model, consisting of assumptions on the adversary's goal, knowledge and capabilities, we can finally define the optimal strategy for attacking a clustering  ... 
arXiv:1811.09985v1 fatcat:23aq4s7xpzfuhky7i6n4724cse

Poisoning behavioral malware clustering

Battista Biggio, Konrad Rieck, Davide Ariu, Christian Wressnegger, Igino Corona, Giorgio Giacinto, Fabio Roli
2014 Proceedings of the 2014 Workshop on Artificial Intelligent and Security Workshop - AISec '14  
Clustering algorithms have become a popular tool in computer security to analyze the behavior of malware variants, identify novel malware families, and generate signatures for antivirus systems.  ...  Our experiments not only demonstrate that this tool is vulnerable to poisoning attacks, but also that it can be significantly compromised even if the attacker can only inject a very small percentage of  ...  Attack Strategy Based on the presented threat model, consisting of assumptions on the adversary's goal, knowledge and capabilities, we can finally define the optimal strategy for attacking a clustering  ... 
doi:10.1145/2666652.2666666 dblp:conf/ccs/BiggioRAWCGR14 fatcat:erebdiayvfdyjncqcgx73twsxq

Privacy Preserving Detection of Path Bias Attacks in Tor

Lauren Watson, Anupam Mediratta, Tariq Elahi, Rik Sarkar
2020 Proceedings on Privacy Enhancing Technologies  
In this paper, we consider the path bias attack– where the attacker induces a client to use compromised nodes and thus links the client to their destination.  ...  We show provable bounds for the sample complexity of the scheme and describe methods to make it resilient to introduction of false data by the attacker to subvert the detection process.  ...  Acknowledgements This work was funded in part by the UK National Centre for Cyber Security. We thank Katharina Kohls and the anonymous reviewers for many helpful suggestions that improved the paper.  ... 
doi:10.2478/popets-2020-0065 fatcat:fbxpdohvhvdureprhnsv7izq6y

Your Choice MATor(s)

Michael Backes, Sebastian Meiser, Marcin Slowik
2016 Proceedings on Privacy Enhancing Technologies  
As part of our analysis, we quantify the anonymity impact of a path selection transition phase, i.e., a small number of users decides to run an alternative algorithm while the vast majority still uses  ...  In this paper, we present a rigorous methodology for quantifying the anonymity provided by Tor against a variety of structural attacks, i.e., adversaries that corrupt Tor nodes and thereby perform eavesdropping  ...  We say that Tor exhibits a reduction of anonymity of at most δ under γ challenges (formally: Tor is (δ, γ)-IND-ANO) for these parameters α, S 0 , S 1 , R 0 , R 1 and a class A of adversaries if the adversary's  ... 
doi:10.1515/popets-2016-0004 dblp:journals/popets/BackesMS16 fatcat:jb7c7uxs7nbcdex5gfw7hn6phy

Changing of the guards

Tariq Elahi, Kevin Bauer, Mashael AlSabah, Roger Dingledine, Ian Goldberg
2012 Proceedings of the 2012 ACM workshop on Privacy in the electronic society - WPES '12  
We design and implement Changing of the Guards (COGS), a simulation-based research framework to study Tor's entry guard design.  ...  To ensure a high level of security against certain attacks, Tor currently utilizes special nodes called entry guards as each client's long-term entry point into the anonymity network.  ...  We thank the anonymous reviewers for their helpful comments and suggestions. We also thank NSERC, ORF, Qatar University, NSF, and The Tor Project, Inc. for funding this research.  ... 
doi:10.1145/2381966.2381973 dblp:conf/wpes/ElahiBADG12 fatcat:yr43agwixraurim2qq4s6bmiqu

The Loopix Anonymity System [article]

Ania Piotrowska and Jamie Hayes and Tariq Elahi and Sebastian Meiser and George Danezis
2017 arXiv   pre-print
Mixes and clients self-monitor the network via loops of traffic to provide protection against active attacks, and inject cover traffic to provide stronger anonymity and a measure of sender and receiver  ...  We provide a theoretical analysis of the Poisson mixing strategy as well as an empirical evaluation of the anonymity provided by the protocol and a functional implementation that we analyze in terms of  ...  The Poisson Mix, under the assumption that it approximates an M/M/∞ queue is a stochastic variant of a pool mixing strategy [39] .  ... 
arXiv:1703.00536v1 fatcat:hvr75jd2wvcalht4zl23mv7m4e

Dreaming of clean nukes

Michael A. Levi
2004 Nature  
Under this program the missiles are monitored, and any of the four stages of the missile could be reused for another project within the government.  ...  Remote sensors or autonomous sensors emplaced by hand or by air delivery could continue to monitor activity or even actively probe to determine the characteristics of the target complex.  ...  The Tactical Tomahawk cruise missile now under development will employ such a system.  ... 
doi:10.1038/428892a pmid:15118700 fatcat:4l7opgcfbzdm7merk5sw35a3ry
« Previous Showing results 1 — 15 out of 303 results