Sciweavers

8644 search results - page 266 / 1729
» On the Composition of Secure Systems
Sort
View
SCN
2008
Springer
142views Communications» more  SCN 2008»
15 years 6 months ago
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
Yehuda Lindell, Benny Pinkas, Nigel P. Smart
NAACL
2007
15 years 8 months ago
A Cascaded Machine Learning Approach to Interpreting Temporal Expressions
A new architecture for identifying and interpreting temporal expressions is introduced, in which the large set of complex hand-crafted rules standard in systems for this task is r...
David Ahn, Joris van Rantwijk, Maarten de Rijke
ESORICS
2006
Springer
15 years 10 months ago
Conditional Reactive Simulatability
Abstract. Simulatability has established itself as a salient notion for defining and proving the security of cryptographic protocols since it entails strong security and compositio...
Michael Backes, Markus Dürmuth, Dennis Hofhei...
CSFW
2005
IEEE
16 years 11 days ago
Achieving Information Flow Security through Precise Control of Effects
This paper advocates a novel approach to the construction of secure software: controlling information flow and maintaining integrity via monadic encapsulation of effects. This ap...
William L. Harrison, James Hook
PODC
1994
ACM
15 years 10 months ago
Open Systems in TLA
We describe a method for writing assumption/guarantee specifications of concurrent systems. We also provide a proof rule for reasoning about the composition of these systems. Spec...
Martín Abadi, Leslie Lamport