Sciweavers

36 search results - page 6 / 8
» fsttcs 2009
Sort
View
FSTTCS
2009
Springer
14 years 2 months ago
Simulation based security in the applied pi calculus
We present a symbolic framework for refinement and composition of security protocols. ework uses the notion of ideal functionalities. These are abstract systems which are secure b...
Stéphanie Delaune, Steve Kremer, Olivier Pe...
FSTTCS
2009
Springer
14 years 2 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya
FSTTCS
2009
Springer
14 years 2 months ago
Approximating Fault-Tolerant Group-Steiner Problems
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
FSTTCS
2009
Springer
14 years 2 months ago
Donation Center Location Problem
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
Chien-Chung Huang, Zoya Svitkina
FSTTCS
2009
Springer
14 years 2 months ago
Non-Local Box Complexity and Secure Function Evaluation
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...