An Optimization Approach using Soft Constraints for the Cascade Vulnerability Problem

C. Servin, M. Ceberio, E. Freudenthal, Stefano Bistarelli
{"title":"An Optimization Approach using Soft Constraints for the Cascade Vulnerability Problem","authors":"C. Servin, M. Ceberio, E. Freudenthal, Stefano Bistarelli","doi":"10.1109/NAFIPS.2007.383867","DOIUrl":null,"url":null,"abstract":"In the discipline of computer security, the field of trust management design is dedicated to the design of trusted systems, in particular trusted networks. One common trusted mechanism used these days is the multi-level security (MLS) mechanism, that allows simultaneous access to systems by users with different levels of security clearance in an interconnected network. Vulnerability arises when an intruder takes advantage of the network connectivity and creates an inappropriate flow of information across the network, leading to the so-called cascade vulnerability problem (CVP). In this article, we extend an existent approach to this problem proposed by Bistarelli et al. [1] that models, detects and properly eliminates the CVP in a network. This particular approach expresses a solution of the problem using constraint programming. We incorporate real-world criteria to consider into this approach, such as the bandwidth, electricity, cost of connections. Considering such features in CVP results in generating a constraint optimization problem.","PeriodicalId":292853,"journal":{"name":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAFIPS.2007.383867","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

In the discipline of computer security, the field of trust management design is dedicated to the design of trusted systems, in particular trusted networks. One common trusted mechanism used these days is the multi-level security (MLS) mechanism, that allows simultaneous access to systems by users with different levels of security clearance in an interconnected network. Vulnerability arises when an intruder takes advantage of the network connectivity and creates an inappropriate flow of information across the network, leading to the so-called cascade vulnerability problem (CVP). In this article, we extend an existent approach to this problem proposed by Bistarelli et al. [1] that models, detects and properly eliminates the CVP in a network. This particular approach expresses a solution of the problem using constraint programming. We incorporate real-world criteria to consider into this approach, such as the bandwidth, electricity, cost of connections. Considering such features in CVP results in generating a constraint optimization problem.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
级联漏洞问题的软约束优化方法
在计算机安全学科中,信任管理设计领域致力于可信系统,特别是可信网络的设计。目前使用的一种常见可信机制是多级安全(MLS)机制,它允许具有不同级别安全许可的用户在互连网络中同时访问系统。当入侵者利用网络连接并在网络中创建不适当的信息流时,就会出现漏洞,从而导致所谓的级联漏洞问题(CVP)。在本文中,我们扩展了Bistarelli等人提出的解决该问题的现有方法,该方法可以建模,检测并适当消除网络中的CVP。这种特殊的方法表达了使用约束规划的问题的解决方案。我们将现实世界的标准纳入到这种方法中,例如带宽、电力、连接成本。在CVP中考虑这些特征会产生一个约束优化问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Neighbourhood Sets based on Web Usage Mining Design an Intelligent Neural-Fuzzy Controller for Hybrid Motorcycle Fuzzy ROI Based 2-D/3-D Registration for Kinetic Analysis after Anterior Cruciate Ligament Reconstruction About the Division Operator in a Possibilistic Database Framework A Fast Structural Optimization Technique for IDS Modeling
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1