2012 International Conference on Cyber Security最新文献_第2页

Cyber Crisis Management: A Decision-Support Framework for Disclosing Security Incident Information 网络危机管理:安全事件信息披露的决策支持框架

2012 International Conference on Cyber Security Pub Date : 2012-12-14 DOI: 10.1109/CyberSecurity.2012.20

O. Kulikova, Ronald Heil, J. Berg, W. Pieters

引用次数: 20

A Contextual Anomaly Detection Approach to Discover Zero-Day Attacks 一种发现零日攻击的上下文异常检测方法

2012 International Conference on Cyber Security Pub Date : 2012-12-14 DOI: 10.1109/CyberSecurity.2012.12

Ahmed Aleroud, George Karabatis

引用次数: 41

Is IPv6 Ready for the Smart Grid? IPv6为智能电网做好准备了吗?

2012 International Conference on Cyber Security Pub Date : 2012-12-14 DOI: 10.1109/CyberSecurity.2012.27

T. Zseby

引用次数: 6

Cyber -- Transparencies, Assurance and Deterrence 网络——透明度、保证和威慑

2012 International Conference on Cyber Security Pub Date : 2012-12-14 DOI: 10.1109/CyberSecurity.2012.22

S. Atkinson, David Walker, Kevin Beaulne, L. Hossain

{"title":"Cyber -- Transparencies, Assurance and Deterrence","authors":"S. Atkinson, David Walker, Kevin Beaulne, L. Hossain","doi":"10.1109/CyberSecurity.2012.22","DOIUrl":"https://doi.org/10.1109/CyberSecurity.2012.22","url":null,"abstract":"Cyber-has often been considered as a coordination and control, as opposed to collaborative influence, media. This conceptual-design paper, uniquely, builds upon a number of entangled, cross disciplinary research strands -- integrating engineering and conflict studies -- and a detailed literature review to propose a new paradigm of assurance and deterrence models. We consider an ontology for Cyber-sûréte, which combines both the social trusts necessary for [knowledge &amp, information] assurance such as collaboration by social influence (CSI) and the technological controls and rules for secure information management referred as coordination by rule and control (CRC). We posit Cyber-sûréte as enabling both a 'safe-to-fail' ecology (in which learning, testing and adaptation can take place) within a fail-safe supervisory control and data acquisition (SCADA type) system, e.g. in a nuclear power plant. Building upon traditional state-based threat analysis, we consider Warning Time and the Threat equation with relation to policies for managing Cyber-Deterrence. We examine how the goods of Cyber-might be galvanised so as to encourage virtuous behaviour and deter and / or dissuade ne'er-do-wells through multiple transparencies. We consider how the Deterrence-escalator may be managed by identifying both weak influence and strong control signals so as to create a more benign and responsive cyber-ecology, in which strengths can be exploited and weaknesses identified. Finally, we consider declaratory / mutual transparencies as opposed to legalistic / controlled transparency.","PeriodicalId":162858,"journal":{"name":"2012 International Conference on Cyber Security","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125599621","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Extending Case-Based Reasoning to Network Alert Reporting 将基于案例的推理扩展到网络警报报告

2012 International Conference on Cyber Security Pub Date : 2012-12-14 DOI: 10.1109/CyberSecurity.2012.31

R. Erbacher, Steve E. Hutchinson

引用次数: 15

Cyber-Security for the Controller Area Network (CAN) Communication Protocol 控制器局域网(CAN)通信协议的网络安全

2012 International Conference on Cyber Security Pub Date : 2012-12-14 DOI: 10.1109/CYBERSECURITY.2012.7

Chung-Wei Lin, A. Sangiovanni-Vincentelli

引用次数: 179

A Cyber-Security Storm MAP 网络安全风暴地图

2012 International Conference on Cyber Security Pub Date : 2012-12-14 DOI: 10.1109/CyberSecurity.2012.19

Denise Ferebee, D. Dasgupta, C. Wu

引用次数: 2

A Routing Table Insertion (RTI) Attack on Freenet 针对Freenet的RTI攻击

2012 International Conference on Cyber Security Pub Date : 2012-12-14 DOI: 10.1109/CyberSecurity.2012.8

Todd Baumeister, Yingfei Dong, Z. Duan, Guanyu Tian

{"title":"A Routing Table Insertion (RTI) Attack on Freenet","authors":"Todd Baumeister, Yingfei Dong, Z. Duan, Guanyu Tian","doi":"10.1109/CyberSecurity.2012.8","DOIUrl":"https://doi.org/10.1109/CyberSecurity.2012.8","url":null,"abstract":"Very little work has been conducted on quantitatively evaluating the basic design and implementation choices in common p2p anonymous systems. In this paper, we focus on this issue and use Freenet as an example to investigate quantitative measures for anonymous systems. We have conducted extensive analysis of Freenet, and identified several practical attacks that seriously damage the anonymity strength of Freenet. These attacks exploit several fundamental performance improvement schemes in p2p systems, and can be easily extended to other popular DHT-like p2p anonymous systems using similar mechanisms. In particular, we are able to find the network topology, perform a routing table insertion (RTI) attack, and trace back queries. In this paper, we focus on the RTI attack to make a malicious node a direct peer of a victim node. As a result, many other attacks can be launched to break the anonymity promise. To facilitate the RTI attack, we have also developed a route prediction model based on Freenet routing mechanisms. Our experimental results show the effectiveness of the proposed attack. Our goal is not to attack Freenet. Instead, we hope that the lessons learned here help us improve Freenet, develop new design guidelines for p2p anonymous systems, and generalize quantitative measures to evaluate their strength.","PeriodicalId":162858,"journal":{"name":"2012 International Conference on Cyber Security","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121138213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 16

A Compose Language-Based Framework for Secure Service Composition 基于组合语言的安全服务组合框架

2012 International Conference on Cyber Security Pub Date : 2012-12-14 DOI: 10.1109/CyberSecurity.2012.32

Bo Zhou, D. Llewellyn-Jones, Q. Shi, M. Asim, M. Merabti, D. Lamb

引用次数: 2

Permanent Revocation in Attribute Based Broadcast Encryption 基于属性的广播加密中的永久撤销

2012 International Conference on Cyber Security Pub Date : 2012-12-14 DOI: 10.1109/CyberSecurity.2012.33

S. Dolev, N. Gilboa, M. Kopeetsky

{"title":"Permanent Revocation in Attribute Based Broadcast Encryption","authors":"S. Dolev, N. Gilboa, M. Kopeetsky","doi":"10.1109/CyberSecurity.2012.33","DOIUrl":"https://doi.org/10.1109/CyberSecurity.2012.33","url":null,"abstract":"We propose a new and efficient scheme for broadcast encryption. A broadcast encryption system allows a broadcaster to send an encrypted message to a dynamically chosen subset RS, |RS|=n, of a given set of users, such that only users in this subset can decrypt the message. An important component of broadcast encryption schemes is revocation of users by the broadcaster, thereby updating the subset RS. Revocation may be either temporary, for a specific cipher text, or permanent. In the existing public key schemes which support temporary revocation of the users, the broadcaster is required to keep track of the revoked users. We present the first public key broadcast encryption scheme that supports permanent revocation of users. Unlike previous schemes, the broadcaster in our scheme should not keep track of the revoked users (saving memory and computation power). Our scheme is fully collusion-resistant. In other words, even if all the revoked users collude, the revoked user cannot encrypt messages without receiving new keys from the broadcaster. The procedure is based on Cipher-text Policy Attribute-Based Encryption (CP-ABE). The overhead of revocation in our system is constant in all major performance measures including length of private and public keys, computational complexity, user's storage space, and computational complexity of encryption and decryption. The scheme we construct improves on our original scheme in a poster presentation [7] by a factor of O(log n) in all major performance measures.","PeriodicalId":162858,"journal":{"name":"2012 International Conference on Cyber Security","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133926338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2