2013 International Conference on Availability, Reliability and Security最新文献_第4页

IT Service Continuity: Achieving Embeddedness through Planning IT服务连续性:通过规划实现嵌入性

2013 International Conference on Availability, Reliability and Security Pub Date : 2013-09-02 DOI: 10.1109/ARES.2013.45

Marko Niemimaa, Jonna Järveläinen

{"title":"IT Service Continuity: Achieving Embeddedness through Planning","authors":"Marko Niemimaa, Jonna Järveläinen","doi":"10.1109/ARES.2013.45","DOIUrl":"https://doi.org/10.1109/ARES.2013.45","url":null,"abstract":"Business customers and regulations as well as different IT service management frameworks expect that IT services are continuously operating. A service interruption might have severe impact on customer relationships, business, sales or image of the company. Therefore, organisations spend enormous amounts of time in continuity and recovery planning for IT services, and several continuity planning methodologies have been introduced. However, the connection between continuity planning and continuity management is somewhat unclear, and embedding the continuity practices into organisations have not been discussed in detail in planning methodologies. This paper will focus on how IT service continuity planning embeds continuity by reviewing continuity planning methods. The continuity planning practices that influence achieving embedded ness are analysed from qualitative and quantitative data from large organisations operating in Finland. The findings suggest that a number of planning practices support the transition from planning to embedded ness, such as creating awareness, increasing commitment, integrating the continuity practices into organisational processes and learning from incidents.","PeriodicalId":302747,"journal":{"name":"2013 International Conference on Availability, Reliability and Security","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130434744","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}

引用次数: 8

On Selecting Critical Security Controls 关于选择关键安全控制

2013 International Conference on Availability, Reliability and Security Pub Date : 2013-09-02 DOI: 10.1109/ARES.2013.77

J. Breier, L. Hudec

引用次数: 17

A Classifier of Malicious Android Applications 恶意Android应用程序分类器

2013 International Conference on Availability, Reliability and Security Pub Date : 2013-09-02 DOI: 10.1109/ARES.2013.80

G. Canfora, F. Mercaldo, C. A. Visaggio

引用次数: 79

Resource Pool Oriented Trust Management for Cloud Infrastructure 面向资源池的云基础设施信任管理

2013 International Conference on Availability, Reliability and Security Pub Date : 2013-09-02 DOI: 10.1109/ARES.2013.35

Gansen Zhao, Haiyu Wang, Chunming Rong, Yong Tang

引用次数: 3

Measuring Anonymity with Plausibilistic Entropy 用似然熵测量匿名性

2013 International Conference on Availability, Reliability and Security Pub Date : 2013-09-02 DOI: 10.1109/ARES.2013.19

I. Goriac

{"title":"Measuring Anonymity with Plausibilistic Entropy","authors":"I. Goriac","doi":"10.1109/ARES.2013.19","DOIUrl":"https://doi.org/10.1109/ARES.2013.19","url":null,"abstract":"To prove that a certain protocol provides a certain security property (e.g. anonymity) one must first formally define that property in the context of a logical framework capable of expressing the relevant aspects of that protocol and then perform the actual inference steps (preferably automatically). After the qualitative aspect of the property is successfully addressed the next issue is the strength of the property - how to express it quantitatively so that it can be compared both to some business requirements and to other implementing protocols. The framework that we build upon is the MAS epistemic logic introduced by Halpern and O'Neill in their approach for defining anonymity both possibilistically and probabilistically. Our contribution employs the highly general plausibilistic approach in order to provide a numeric measure for anonymity that can also be extended to other properties as well. We propose a formula for calculating a particular kind of entropy suited for characterising partially ordered sets used to define plausibility measures and, on top of it, a quantitative definition for anonymity. We believe that the theory presented here is capable of filling the gap between the very general qualitative definition of anonymity and the information intensive probabilistic approach that might not always be applicable.","PeriodicalId":302747,"journal":{"name":"2013 International Conference on Availability, Reliability and Security","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121370184","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}

引用次数: 3

Validating Security Design Patterns Application Using Model Testing 使用模型测试验证安全设计模式应用程序

2013 International Conference on Availability, Reliability and Security Pub Date : 2013-09-02 DOI: 10.1109/ARES.2013.13

Takanori Kobashi, Nobukazu Yoshioka, T. Okubo, H. Kaiya, H. Washizaki, Y. Fukazawa

引用次数: 17

Pretty Understandable Democracy - A Secure and Understandable Internet Voting Scheme 相当可理解的民主-一个安全和可理解的互联网投票计划

2013 International Conference on Availability, Reliability and Security Pub Date : 2013-09-02 DOI: 10.1109/ARES.2013.27

Jurlind Budurushi, Stephan Neumann, M. Olembo, M. Volkamer

引用次数: 24

Probabilistic Contract Compliance for Mobile Applications 移动应用程序的概率合同遵从性

2013 International Conference on Availability, Reliability and Security Pub Date : 2013-09-02 DOI: 10.1109/ARES.2013.79

G. Dini, F. Martinelli, A. Saracino, D. Sgandurra

{"title":"Probabilistic Contract Compliance for Mobile Applications","authors":"G. Dini, F. Martinelli, A. Saracino, D. Sgandurra","doi":"10.1109/ARES.2013.79","DOIUrl":"https://doi.org/10.1109/ARES.2013.79","url":null,"abstract":"We propose PICARD (ProbabIlistic Contract on Android), a framework to generate probabilistic contracts to detect repackaged applications for Android smart phones. A contract describes the sequences of actions that an application is allowed to perform at run-time, i.e. its legal behavior. In PICARD, contracts are generated from the set of traces that represent the usage profile of the application. Both the contract and the application's run-time behavior are represented through clustered probabilistic automata. At run-time, the PICARD monitoring system verifies the compliance of the application trace with the contract. This approach is useful in detecting repackaged applications, whose behavior is strongly similar to the original application but it differs only from small paths in the traces. In this paper, we discuss the framework of PICARD for describing and generating contracts through probabilistic automata and introduce the notion of Action Node, a cluster of related system calls, used to represent high level operations. Then, we present a first set of preliminary experiments on repackaged applications, to evaluate the viability of the proposed approach.","PeriodicalId":302747,"journal":{"name":"2013 International Conference on Availability, Reliability and Security","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116883986","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}

引用次数: 8

An Ontology for Malware Analysis 恶意软件分析本体

2013 International Conference on Availability, Reliability and Security Pub Date : 2013-09-02 DOI: 10.1109/ARES.2013.73

David A. Mundie, David M. McIntire

引用次数: 19

Anonymizing Face Images by Using Similarity-Based Metric 基于相似度度量的人脸图像匿名化

2013 International Conference on Availability, Reliability and Security Pub Date : 2013-09-02 DOI: 10.1109/ARES.2013.68

Tomoya Muraki, Shintaro Oishi, Masatsugu Ichino, I. Echizen, H. Yoshiura

{"title":"Anonymizing Face Images by Using Similarity-Based Metric","authors":"Tomoya Muraki, Shintaro Oishi, Masatsugu Ichino, I. Echizen, H. Yoshiura","doi":"10.1109/ARES.2013.68","DOIUrl":"https://doi.org/10.1109/ARES.2013.68","url":null,"abstract":"Vast numbers of face images are posted and circulated daily on social network and photo-sharing sites. Some face images are linked to the person's name, like those on user profile pages, while others are anonymized due to privacy concerns. If an anonymized face image is linked to a named one, that person's privacy is infringed. One way to overcome this privacy problem is to anonymize face images when they are posted on social networks. However, current face anonymization methods fail to meet two key requirements: being provably secure against de-anonymization and enabling users to control the trade-off between security and usability (similarity to the original face) of the anonymized face images. We are developing a similarity-based method for face anonymization that meets both requirements in those cases where a new face image of a person is to be posted when many face images including those of that person are already posted. The basic idea is to hide the new face image in s face images that are equally similar to the face image of the same person. We theoretically demonstrated that the probability of an attacker correctly linking the anonymized face image to an image of the same person is less than 1/s. We also showed theoretically and confirmed experimentally, with 150 sample face images, that the larger the s, the less usable the anonymized face image. The security of our method holds in spite of future improvements in face recognition tools.","PeriodicalId":302747,"journal":{"name":"2013 International Conference on Availability, Reliability and Security","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116647911","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}

引用次数: 9