Sciweavers

202 search results - page 13 / 41
» Composing and decomposing systems under security properties
Sort
View
ICALP
2010
Springer
14 years 1 months ago
Compositionality in Graph Transformation
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....
Arend Rensink
ESORICS
2002
Springer
14 years 8 months ago
Confidentiality-Preserving Refinement is Compositional - Sometimes
Confidentiality-preserving refinement describes a relation between a specification and an implementation that ensures that all confidentiality properties required in the specificat...
Thomas Santen, Maritta Heisel, Andreas Pfitzmann
IFIP
2010
Springer
13 years 3 months ago
Bounded Memory Dolev-Yao Adversaries in Collaborative Systems
Abstract. This paper extends existing models for collaborative systems. We investigate how much damage can be done by insiders alone, without collusion with an outside adversary. I...
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, ...
PKC
2012
Springer
235views Cryptology» more  PKC 2012»
11 years 11 months ago
Improved Security for Linearly Homomorphic Signatures: A Generic Framework
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
David Mandell Freeman
COLING
2008
13 years 10 months ago
Modeling Semantic Containment and Exclusion in Natural Language Inference
We propose an approach to natural language inference based on a model of natural logic, which identifies valid inferences by their lexical and syntactic features, without full sem...
Bill MacCartney, Christopher D. Manning