Biblio

Found 19604 results

2021-04-08
Zhang, H., Ma, J., Wang, Y., Pei, Q..  2009.  An Active Defense Model and Framework of Insider Threats Detection and Sense. 2009 Fifth International Conference on Information Assurance and Security. 1:258—261.
Insider attacks is a well-known problem acknowledged as a threat as early as 1980s. The threat is attributed to legitimate users who take advantage of familiarity with the computational environment and abuse their privileges, can easily cause significant damage or losses. In this paper, we present an active defense model and framework of insider threat detection and sense. Firstly, we describe the hierarchical framework which deal with insider threat from several aspects, and subsequently, show a hierarchy-mapping based insider threats model, the kernel of the threats detection, sense and prediction. The experiments show that the model and framework could sense the insider threat in real-time effectively.
2019-12-30
Chen, Jing, Du, Ruiying.  2009.  Fault Tolerance and Security in Forwarding Packets Using Game Theory. 2009 International Conference on Multimedia Information Networking and Security. 2:534–537.
In self-organized wireless network, such as ad hoc network, sensor network or mesh network, nodes are independent individuals which have different benefit; Therefore, selfish nodes refuse to forward packets for other nodes in order to save energy which causes the network fault. At the same time, some nodes may be malicious, whose aim is to damage the network. In this paper, we analyze the cooperation stimulation and security in self-organized wireless networks under a game theoretic framework. We first analyze a four node wireless network in which nodes share the channel by relaying for others during its idle periods in order to help the other nodes, each node has to use a part of its available channel capacity. And then, the fault tolerance and security problem is modeled as a non-cooperative game in which each player maximizes its own utility function. The goal of the game is to maximize the utility function in the giving condition in order to get better network efficiency. At last, for characterizing the efficiency of Nash equilibria, we analyze the so called price of anarchy, as the ratio between the objective function at the worst Nash equilibrium and the optimal objective function. Our results show that the players can get the biggest payoff if they obey cooperation strategy.
2021-04-08
Bloch, M., Laneman, J. N..  2009.  Information-spectrum methods for information-theoretic security. 2009 Information Theory and Applications Workshop. :23–28.
We investigate the potential of an information-spectrum approach to information-theoretic security. We show how this approach provides conceptually simple yet powerful results that can be used to investigate complex communication scenarios. In particular, we illustrate the usefulness of information-spectrum methods by analyzing the effect of channel state information (CSI) on the secure rates achievable over wiretap channels. We establish a formula for secrecy capacity, which we then specialize to compute achievable rates for ergodic fading channels in the presence of imperfect CSI. Our results confirm the importance of having some knowledge about the eavesdropper's channel, but also show that imperfect CSI does not necessarily preclude security.
2020-01-20
Ingols, Kyle, Chu, Matthew, Lippmann, Richard, Webster, Seth, Boyer, Stephen.  2009.  Modeling Modern Network Attacks and Countermeasures Using Attack Graphs. 2009 Annual Computer Security Applications Conference. :117–126.
By accurately measuring risk for enterprise networks, attack graphs allow network defenders to understand the most critical threats and select the most effective countermeasures. This paper describes substantial enhancements to the NetSPA attack graph system required to model additional present-day threats (zero-day exploits and client-side attacks) and countermeasures (intrusion prevention systems, proxy firewalls, personal firewalls, and host-based vulnerability scans). Point-to-point reachability algorithms and structures were extensively redesigned to support "reverse" reachability computations and personal firewalls. Host-based vulnerability scans are imported and analyzed. Analysis of an operational network with 84 hosts demonstrates that client-side attacks pose a serious threat. Experiments on larger simulated networks demonstrated that NetSPA's previous excellent scaling is maintained. Less than two minutes are required to completely analyze a four-enclave simulated network with more than 40,000 hosts protected by personal firewalls.
2018-05-27
Yannick Benezeth, Pierre{-}Marc Jodoin, Venkatesh Saligrama, Christophe Rosenberger.  2009.  Abnormal events detection based on spatio-temporal co-occurences. 2009 {IEEE} Computer Society Conference on Computer Vision and Pattern Recognition {(CVPR} 2009), 20-25 June 2009, Miami, Florida, {USA}. :2458–2465.
Manqi Zhao, Venkatesh Saligrama.  2009.  Anomaly Detection with Score functions based on Nearest Neighbor Graphs. Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, Vancouver, British Columbia, Canada.. :2250–2258.
2018-05-14
2018-06-04
Carrick, Grady, Heaslip, Kevin, Srinivasan, Sivaramakrishnan, Zhu, Xiaoyu.  2009.  A Case Study in Spatial Misclassification of Work Zone Crashes. the Proceedings of the 88th Transportation Research Board Annual Meeting, Washington, DC.
2018-05-27
2018-05-14
2018-06-04
Heaslip, Kevin, Kondyli, Alexandra, Arguea, Diego, Elefteriadou, Lily, Sullivan, Frank.  2009.  Estimation of freeway work zone capacity through simulation and field data. Transportation Research Record: Journal of the Transportation Research Board. :16–24.
2018-05-27
Pierre{-}Marc Jodoin, Venkatesh Saligrama, Janusz Konrad.  2009.  Implicit Active-Contouring with MRF. Image Analysis and Recognition, 6th International Conference, {ICIAR} 2009, Halifax, Canada, July 6-8, 2009. Proceedings. 5627:178–190.
2017-05-18
Halderman, J. Alex, Schoen, Seth D., Heninger, Nadia, Clarkson, William, Paul, William, Calandrino, Joseph A., Feldman, Ariel J., Appelbaum, Jacob, Felten, Edward W..  2009.  Lest We Remember: Cold-boot Attacks on Encryption Keys. Commun. ACM. 52:91–98.

Contrary to widespread assumption, dynamic RAM (DRAM), the main memory in most modern computers, retains its contents for several seconds after power is lost, even at room temperature and even if removed from a motherboard. Although DRAM becomes less reliable when it is not refreshed, it is not immediately erased, and its contents persist sufficiently for malicious (or forensic) acquisition of usable full-system memory images. We show that this phenomenon limits the ability of an operating system to protect cryptographic key material from an attacker with physical access to a machine. It poses a particular threat to laptop users who rely on disk encryption: we demonstrate that it could be used to compromise several popular disk encryption products without the need for any special devices or materials. We experimentally characterize the extent and predictability of memory retention and report that remanence times can be increased dramatically with simple cooling techniques. We offer new algorithms for finding cryptographic keys in memory images and for correcting errors caused by bit decay. Though we discuss several strategies for mitigating these risks, we know of no simple remedy that would eliminate them.

2018-05-14
2018-06-04
2017-05-18
Bianculli, Domenico, Binder, Walter, Drago, Mauro Luigi, Ghezzi, Carlo.  2009.  ReMan: A Pro-active Reputation Management Infrastructure for Composite Web Services. Proceedings of the 31st International Conference on Software Engineering. :623–626.

REMAN is a reputation management infrastructure for composite Web services. It supports the aggregation of client feedback on the perceived QoS of external services, using reputation mechanisms to build service rankings. Changes in rankings are pro-actively notified to composite service clients to enable self-tuning properties in their execution.

2021-10-26
[Anonymous].  2009.  Securely Taking on New Executable Software Of Uncertain Provenance.

STONESOUP develops and demonstrates comprehensive, automated techniques that allow end users to securely execute software without basing risk mitigations on characteristics of provenance that have a dubious relationship to security. Existing techniques to find and remove software vulnerabilities are costly, labor-intensive, and time-consuming. Many risk management decisions are therefore based on qualitative and subjective assessments of the software suppliers' trustworthiness. STONESOUP develops software analysis, confinement, and diversification techniques so that non-experts can transform questionable software into more secure versions without changing the behavior of the programs.

2018-05-27
2018-05-14
2018-05-27
Pierre Clarot, Erhan Baki Ermis, Pierre{-}Marc Jodoin, Venkatesh Saligrama.  2009.  Unsupervised camera network structure estimation based on activity. Third {ACM/IEEE} International Conference on Distributed Smart Cameras, {ICDSC} 2009, Como, Italy, August 30 - September 2, 2009. :1–8.