Sciweavers

349 search results - page 20 / 70
» Compositional Security for Task-PIOAs
Sort
View
CSFW
2006
IEEE
15 years 9 months ago
Securing Interaction between Threads and the Scheduler
The problem of information flow in multithreaded programs remains an important open challenge. Existing approaches to specifying and enforcing information-flow security often su...
Alejandro Russo, Andrei Sabelfeld
CSFW
1996
IEEE
15 years 7 months ago
Comparing Two Information Flow Security Properties
In this paper we compare two information flow security properties: the lazy security (L-Sec) [11] and the Bisimulation Non-deducibility on Compositions (BNDC) [4]. To make this we...
Riccardo Focardi
FC
2010
Springer
196views Cryptology» more  FC 2010»
15 years 4 months ago
Secure Computation with Fixed-Point Numbers
Abstract. Secure computation is a promising approach to business problems in which several parties want to run a joint application and cannot reveal their inputs. Secure computatio...
Octavian Catrina, Amitabh Saxena
FOSSACS
2009
Springer
15 years 10 months ago
Cryptographic Protocol Composition via the Authentication Tests
Although cryptographic protocols are typically analyzed in isolation, they are used in combinations. If a protocol was analyzed alone and shown to meet some security goals, will it...
Joshua D. Guttman
TES
2005
Springer
15 years 8 months ago
Systematic Design of Web Service Transactions
The development of composite Web services is still not as simple as the original vision indicated. Currently, the designer of a composite service needs to consider many different ...
Benjamin A. Schmit, Schahram Dustdar