511,751 Hits in 3.6 sec

Pattern Recognition Systems under Attack [chapter]

Fabio Roli, Battista Biggio, Giorgio Fumera
2013 Lecture Notes in Computer Science  
spam and malware detection, despite their vulnerability to potential attacks has not yet been deeply understood.  ...  We analyze the problem of designing pattern recognition systems in adversarial settings, under an engineering viewpoint, motivated by their increasing exploitation in security-sensitive applications like  ...  We refer the reader to [21, 12] for the computation of the optimal attack. For a specific attacker-victim pair, Fig. 3 shows how the victim's template is updated by a limited knowledge attack.  ... 
doi:10.1007/978-3-642-41822-8_1 fatcat:6wbtsbfdv5dd7ity24yuwnppse

Multiple Classifier Systems under Attack [chapter]

Battista Biggio, Giorgio Fumera, Fabio Roli
2010 Lecture Notes in Computer Science  
To this aim we use a method for performance evaluation of a classifier under attack that we are currently developing, and carry out experiments on a spam filtering task with several linear base classifiers  ...  In adversarial classification tasks like spam filtering, intrusion detection in computer networks and biometric authentication, a pattern recognition system must not only be accurate, but also robust to  ...  more robust under attack.  ... 
doi:10.1007/978-3-642-12127-2_8 fatcat:i4vguoopnzevvclowc3ceuhsgy

Computational Soundness of Coinductive Symbolic Security under Active Attacks [chapter]

Mohammad Hajiabadi, Bruce M. Kapron
2013 Lecture Notes in Computer Science  
forms of CCA2 attack.  ...  We prove that (with assumptions similar to above) security under this game is implied by IND-CCA2 security.  ...  Finally, under fixed R H and R A , the induced computational trace is deterministic and denoted by CT (A, R A , R H , Π Ep ).  ... 
doi:10.1007/978-3-642-36594-2_30 fatcat:pzobdno3tfe6fjwhfysc44cvgu

Locating Facilities Under Deliberate Disruptive Attacks [chapter]

Anton V. Ushakov, Igor Vasilyev
2020 Lecture Notes in Computer Science  
We test our approaches in a series of computational experiments on well-known test problems.  ...  Facility disruptions or failures may occur due to natural disasters or a deliberate man-made attack. Such an attack is known as interdiction.  ...  If the three closest open facilities are not pre-computed and the calculation of distances takes O(1) time, determining the assignment of all customers under each interdiction pattern takes O(pn) time.  ... 
doi:10.1007/978-3-030-49988-4_25 fatcat:u26tqbfsfjfmtbmoic3oece24a

A 3-Codes under Collusion Attacks [chapter]

Yejing Wang, Rei Safavi-Naini
1999 Lecture Notes in Computer Science  
We also study combinatorial structure of optimal A 3 -code against collusion attacks and give a construction of an optimal code.  ...  We derive informationtheoretic lower bounds on success probability of various attacks, and combinatorial lower bounds on the size of key spaces.  ...  -R wins if m is valid under e a . -R looses otherwise. The system is subject to the following attacks.  ... 
doi:10.1007/978-3-540-48000-6_31 fatcat:stdr6cemfncdvazyla47k2uk7m

Efficient Best-Response Computation for Strategic Network Formation under Attack [article]

Tobias Friedrich and Sven Ihde and Christoph Keßler and Pascal Lenzner and Stefan Neubert and David Schumann
2017 arXiv   pre-print
Our algorithm essentially solves the problem of computing a minimal connection to a network which maximizes the reachability while hedging against severe attacks on the network infrastructure and may thus  ...  [WINE'16] which focuses on robust networks in the presence of a strong adversary who attacks (and kills) nodes in the network and lets this attack spread virus-like to neighboring nodes and their neighbors  ...  If a node within T is attacked, then v a is connected to a via p(a) which is equivalent to v a having a direct edge to a, which is the assumption under which RootedMetaTreeSelect has correctly decided  ... 
arXiv:1610.01861v2 fatcat:vvebc2tigbbuxdqa4jloiw6kpa

Analysing Approximate Confinement under Uniform Attacks [chapter]

Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky
2002 Lecture Notes in Computer Science  
doi:10.1007/3-540-45789-5_23 fatcat:cgc4sczvvbbtrbx52dnucvh3s4

Prime: Byzantine Replication under Attack

Y Amir, B Coan, J Kirsch, J Lane
2011 IEEE Transactions on Dependable and Secure Computing  
We present a new Byzantine fault-tolerant replication protocol that meets the new correctness criterion and evaluate its performance in fault-free executions and when under attack.  ...  The slope of the curve corresponding to Prime under attack is less steep than when it is not under attack due to the delay added by the malicious leader.  ...  We present experimental results evaluating the performance of Prime in fault-free and under attack executions.  ... 
doi:10.1109/tdsc.2010.70 fatcat:yjlvjojwafas7pthjml2fhqe4a

Improving Gait Biometrics under Spoofing Attacks [chapter]

Abdenour Hadid, Mohammad Ghahramani, John Bustard, Mark Nixon
2013 Lecture Notes in Computer Science  
and the deliberate selection of a target that has a similar build to the attacker.  ...  We describe then in this paper an initial solution coping with gait spoofing attacks using part-based gait analysis.  ...  This yielded in 4 protocols for studying gait under spoofing attacks: a) Baseline performance in which the original Southampton gait database without spoofing attacks was considered by computing only client  ... 
doi:10.1007/978-3-642-41184-7_1 fatcat:gjs6qtuq4vdsdfmqgd6go6bete

Sensor Network Configuration Under Physical Attacks [chapter]

Xun Wang, Wenjun Gu, Kurt Schosek, Sriram Chellappan, Dong Xuan
2005 Lecture Notes in Computer Science  
In this paper, we define a practical lifetime problem in sensor networks under a representative physical attack model that we define.  ...  We develop an anlytical approach to derive the minimum number and deployment plan of sensors to meet lifetime requirement under physical attacks. We make several observations in this paper.  ...  In order to meet the lifetime requirement under attack, assuming the routing distance d char , we can also derive another minimum network density requirement, denoted as β d power . β d power can be computed  ... 
doi:10.1007/11534310_5 fatcat:xbrgnptqbvaphay7ogi3surbme

DRM Under Attack: Weaknesses in Existing Systems [chapter]

Tobias Hauser, Christian Wenz
2003 Lecture Notes in Computer Science  
II DRM Systems in Player Software The attacks of crackers on DRM-protected content can generally be divided into two areas: Attacks directly targeted at the key of the DRM system and circumvention methods  ...  like sound and video grabbing which attack directly in 517 Hauser Wenz Partnerschaftsgesellschaft. 518 Someone who breaks systems is called a cracker.  ...  All these various forms and formats of eBooks were under attack of some crackers.  ... 
doi:10.1007/10941270_14 fatcat:7vq4zbebm5gx3hdebmt3qw3vau

Algorithmic Tamper-Proof Security under Probing Attacks [chapter]

Feng-Hao Liu, Anna Lysyanskaya
2010 Lecture Notes in Computer Science  
., we show that a cryptographic device with a true source of randomness can withstand tampering and limited probing attacks at the same time.  ...  In this paper, we examine security under a combination of attacks described in these previous papers.  ...  Micali and Reyzin [MR04] defined security for cryptographic primitives under side channel attacks and show how to use these primitives; their side channel attack is much more general than attacks that  ... 
doi:10.1007/978-3-642-15317-4_8 fatcat:um7bph52fvhcpbqj6tnbjj45pu

Asymptotic Information Leakage under One-Try Attacks [chapter]

Michele Boreale, Francesca Pampaloni, Michela Paolini
2011 Lecture Notes in Computer Science  
Next, we extend these results to a more sophisticated eavesdropping scenario, where the attacker can perform a (noisy) observation at each state of the computation and the systems are modelled as hidden  ...  Our results cover both the Bayesian case, where a prior probability distribution on the secrets is assumed known to the attacker, and the maximum-likelihood case, where the attacker does not know such  ...  Basically, the attack is carried out by simulating the device's computations under the different candidate keys, each time using as inputs the same messages processed by the device.  ... 
doi:10.1007/978-3-642-19805-2_27 fatcat:pxzljhahunhv5dqcz2d35fxodu

Randomizing SVM Against Adversarial Attacks Under Uncertainty [chapter]

Yan Chen, Wei Wang, Xiangliang Zhang
2018 Lecture Notes in Computer Science  
In this paper, we propose randomized SVMs against generalized adversarial attacks under uncertainty, through learning a classifier distribution rather than a single classifier in traditional robust SVMs  ...  The experimental results demonstrate the effectiveness of our proposed models on defending against various attacks, including aggressive attacks with uncertainty.  ...  In SVM-DRAU with L ∞ , we vary ν in (5) to see under different separation probability how SVM-DRAU with L ∞ performs in classification against attacks at different level of aggressiveness (controlled  ... 
doi:10.1007/978-3-319-93040-4_44 fatcat:2dmkgtk4rndubjpjmbumhj5dtm

Self-healing workflow systems under attacks

M. Yu, P. Liu, W. Zang
2004 24th International Conference on Distributed Computing Systems, 2004. Proceedings.  
In this paper, we propose a practical solution for on-line attack recovery of workflows.  ...  We analyze the behaviors of our attack recovery system based on the Continuous Time Markov Chain model.  ...  Under such intrusions, tasks and data in a workflow may be forged or corrupted.  ... 
doi:10.1109/icdcs.2004.1281607 dblp:conf/icdcs/YuLZ04 fatcat:cclovuja3nfo7esmefdij5dxsm
« Previous Showing results 1 — 15 out of 511,751 results