loading...
Matching Policies with Security Claims of Mobile Applications
March 04-March 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARES.2008.962008 Third International Conference o ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Security-by-Contract (SxC) framework has been recently proposed to address the trust relationship problem of the current security model adopted for mobile devices. The key idea of SxC (similar to the one of Model-Carrying Code) is to augment mobile code with a claim on its security behavior (a contract) that could be matched against a mobile platform policy before downloading the code. The rational is that, thanks to SxC, a digital signature does not just certify the origin of the code but also bind together the code with a contract. In this paper we address one of the key issue of the SxC paradigm, namely the contract-policy matching problem, proposing a prototype for matching policies with security claims of mobile applications. This result can be considered a key step towards the achievement of the SxC main goal: provide a semantics for digital signatures on mobile code, thus being a step in the transition from trusted code to trustworthy code.
Index Terms:
security-by-contract, security for mobile code, automata modulo theory, contract-policy matching
Citation:
Nataliia Bielova, Marco Dalla Torre, Nicola Dragoni, Ida Siahaan, "Matching Policies with Security Claims of Mobile Applications," ares, pp.128-135, 2008 Third International Conference on Availability, Reliability and Security, 2008
Usage of this product signifies your acceptance of the Terms of Use.