Security Analysis in Probabilistic Distributed Protocols via Bounded Reachability

TitleSecurity Analysis in Probabilistic Distributed Protocols via Bounded Reachability
Publication TypeConference Paper
Year of Publication2013
AuthorsPelozo, SS, D'Argenio, PR
EditorPalamidessi, C, Ryan, MDermot
Conference NameTrustworthy Global Computing - 7th International Symposium, TGC 2012, Newcastle upon Tyne, UK, September 7-8, 2012, Revised Selected Papers
PublisherSpringer
ISBN Number978-3-642-41156-4
AbstractWe present a framework to analyze security properties in distributed protocols. The framework is constructed on top of the so called (strongly) distributed schedulers where secrecy is also considered. Secrecy is presented as an equivalence class on actions to those components that do not have access to such secrets; however these actions can be distinguished by those with appropriate clearance. We also present an algorithm to solve bounded reachability analysis on this kind of models. The algorithm appropriately encodes the nondeterministic model by interpreting the decisions of the schedulers as parameters. The problem is then reduced to a polynomial optimization problem.
DOI10.1007/978-3-642-41157-1_12
PDF (Full text): 
Powered by Drupal