Sciweavers

526 search results - page 61 / 106
» A Z Based Approach to Verifying Security Protocols
Sort
View
ESORICS
2000
Springer
13 years 11 months ago
Using Reflection as a Mechanism for Enforcing Security Policies in Mobile Code
Several authors have proposed using code modification as a technique for enforcing security policies such as resource limits, access controls, and network information flows. Howeve...
Ian Welch, Robert J. Stroud
FM
2006
Springer
148views Formal Methods» more  FM 2006»
13 years 11 months ago
Automatic Translation from Circus to Java
Abstract. Circus is a combination of Z and CSP that supports the development of state-rich reactive systems based on refinement. In this paper we present JCircus, a tool that autom...
Angela Freitas, Ana Cavalcanti
CMS
2011
229views Communications» more  CMS 2011»
12 years 7 months ago
Twin Clouds: Secure Cloud Computing with Low Latency - (Full Version)
Abstract. Cloud computing promises a cost effective enabling technology to outsource storage and massively parallel computations. However, existing approaches for provably secure ...
Sven Bugiel, Stefan Nürnberger, Ahmad-Reza Sa...
CCS
2009
ACM
14 years 8 months ago
Quantifying maximal loss of anonymity in protocols
There is a natural intuitive match between anonymity and information theory. In particular, the maximal anonymity loss in anonymity protocols can be matched to the information the...
Han Chen, Pasquale Malacaria
CSFW
2007
IEEE
14 years 2 months ago
Probability of Error in Information-Hiding Protocols
Randomized protocols for hiding private information can often be regarded as noisy channels in the informationtheoretic sense, and the inference of the concealed information can b...
Konstantinos Chatzikokolakis, Catuscia Palamidessi...