Sciweavers

105 search results - page 3 / 21
» A General Composition Theorem for Secure Reactive Systems
Sort
View
EUROCRYPT
2010
Springer
14 years 12 days ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
SIGSOFT
2003
ACM
14 years 8 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
IPPS
1998
IEEE
13 years 12 months ago
Automatically Proving UNITY Safety Properties with Arrays and Quantifiers
Abstract. We address the general problem of automatically proving safety properties of reactive systems within the UNITY model. We take up a relational and set-based approach, and ...
Xavier Thirioux
SP
2002
IEEE
160views Security Privacy» more  SP 2002»
13 years 7 months ago
On the Composition of Secure Systems
When complex systems are constructed from simpler components it is important to know how properties of the components behave under composition. In this article, we present various...
Heiko Mantel
ESORICS
2006
Springer
13 years 11 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...