Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
307
Defending Anonymous Communications Against Passive Logging Attacks
, 2003
"... Using analysis, simulation, and experimentation, we examine the threat against anonymous communications posed by passive logging attacks. Previous work analyzed the success of such attacks under various assumptions. Here, we evaluate the effects of these assumptions more closely. First, we analyze t ..."
Abstract
-
Cited by 97 (8 self)
- Add to MetaCart
Using analysis, simulation, and experimentation, we examine the threat against anonymous communications posed by passive logging attacks. Previous work analyzed the success of such attacks under various assumptions. Here, we evaluate the effects of these assumptions more closely. First, we analyze
RANDOMIZED DETECTION FOR SPREAD-SPECTRUM WATERMARKING: DEFENDING AGAINST SENSITIVITY AND OTHER ATTACKS
"... Spread Spectrum (SS) has been a well-studied technique in signal processing. As a tool for watermarking in an adversarial context, however, this methodology needs caution and new variations. We suggest SS variants where the detection rule is randomized in the sense of having the watermark detector u ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
use secret coin flips to choose subsets of the watermarked data and perform correlation tests. We then form a pool of such estimates and pick the median value. We study the effect of such detection methods on sensitivity and estimation attacks, which suggest that randomization is a necessary tool
Designing Defender Strategies Against Frequent Adversary Interaction
"... Abstract. Recently, there has been an increase in interest in applying game the-oretic approaches to domains involving frequent adversary interactions, such as wildlife and fishery protection. In these domains, the law enforcement agency faces adversaries who repeatedly and frequently carry out ille ..."
Abstract
- Add to MetaCart
in these Frequent Adversary Inter-action (FAI) domains. We provide the following contributions: (i) a novel game model for FAI domains, describing the interaction between the defender and the attackers in a repeated game; (ii) two sets of algorithms that plan for the defender strategies to achieve high average
Provably secure password-authenticated key exchange using Diffie-Hellman
, 2000
"... Abstract. When designing password-authenticated key exchange protocols (as opposed to key exchange protocols authenticated using cryptographically secure keys), one must not allow any information to be leaked that would allow verification of the password (a weak shared key), since an attacker who ob ..."
Abstract
-
Cited by 191 (12 self)
- Add to MetaCart
obtains this information may be able to run an off-line dictionary attack to determine the correct password. We present a new protocol called PAK which is the first Diffie-Hellman-based passwordauthenticated key exchange protocol to provide a formal proof of security (in the random oracle model) against
Defending networks against denial of service attacks
- in: Proc. Conf. on Optics/ Photonics in Security and Defence (SPIE
, 2004
"... Denial of service attacks, viruses and worms are common tools for malicious adversarial behaviour in networks. Experience shows that over the last few years several of these techniques have probably been used by governments to impair the Internet communications of various entities, and we can expect ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
Denial of service attacks, viruses and worms are common tools for malicious adversarial behaviour in networks. Experience shows that over the last few years several of these techniques have probably been used by governments to impair the Internet communications of various entities, and we can
Randomized Instruction Set Emulation To Disrupt Binary . . .
- ACM TRANSACTIONS ON INFORMATION SYSTEM SECURITY
, 2003
"... Many remote attacks against computer systems inject binary code into the execution path of a running program, gaining control of the program's behavior. If each defended system or program could use a machine instruction set that was both unique and private, such binary code injection attacks ..."
Abstract
-
Cited by 155 (3 self)
- Add to MetaCart
Many remote attacks against computer systems inject binary code into the execution path of a running program, gaining control of the program's behavior. If each defended system or program could use a machine instruction set that was both unique and private, such binary code injection
Defending against path-based DoS attacks in wireless sensor networks
- In SASN
, 2005
"... Denial of service (DoS) attacks can cause serious damage in resourceconstrained, wireless sensor networks (WSNs). This paper addresses an especially damaging form of DoS attack, called PDoS (Path-based Denial of Service). In a PDoS attack, an adversary overwhelms sensor nodes a long distance away by ..."
Abstract
-
Cited by 32 (0 self)
- Add to MetaCart
by flooding a multihop end-to-end communication path with either replayed packets or injected spurious packets. This paper proposes a solution using one-way hash chains to protect end-to-end communications in WSNs against PDoS attacks. The proposed solution is lightweight, tolerates bursty packet losses
Defending Anonymous Communications Against Passive Logging Attacks
- In IEEE Symposium on Security and Privacy
, 2003
"... We study the threat that passive logging attacks pose to anonymous communications. Previous work analyzed these attacks under limiting assumptions. We first describe a possible defense that comes from breaking the assumption of uniformly random path selection. Our analysis shows that the defense imp ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We study the threat that passive logging attacks pose to anonymous communications. Previous work analyzed these attacks under limiting assumptions. We first describe a possible defense that comes from breaking the assumption of uniformly random path selection. Our analysis shows that the defense
Sybildefender: Defend against sybil attacks in large social networks
- In IEEE INFOCOM
, 2012
"... Abstract—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of the system. This paper presents SybilDefender, a sybil defense mechanism that leverages the network topologies to de ..."
Abstract
-
Cited by 21 (8 self)
- Add to MetaCart
to defend against sybil attacks in social networks. Based on performing a limited number of random walks within the social graphs, SybilDefender is efficient and scalable to large social networks. Our experiments on two 3,000,000 node real-world social topologies show that SybilDefender outperforms
An Extended Study on Addressing Defender Teamwork while Accounting for Uncertainty in Attacker Defender Games using Iterative Dec-MDPs
, 2015
"... Multi-agent teamwork and defender-attacker security games are two areas that are currently receiving significant attention within multi-agent systems research. Unfortunately, despite the need for effective teamwork among multiple defenders, little has been done to harness the teamwork 1 research in ..."
Abstract
- Add to MetaCart
in security games. The problem that this paper seeks to solve is the coordination of decentralized defender agents in the presence of uncer-tainty while securing targets against an observing adversary. To address this problem, we offer the following novel contributions in this paper: (i) New model of security
Results 1 - 10
of
307
