Sciweavers

5476 search results - page 277 / 1096
» Resettably Secure Computation
Sort
View
163
Voted
FSTTCS
2009
Springer
16 years 1 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...
SSS
2009
Springer
163views Control Systems» more  SSS 2009»
16 years 1 months ago
Developing Autonomic and Secure Virtual Organisations with Chemical Programming
This paper studies the development of autonomic and secure Virtual Organisations (VOs) when following the chemical-programming paradigm. We have selected the Higher-Order Chemical ...
Alvaro E. Arenas, Jean-Pierre Banâtre, Thier...
TRIDENTCOM
2008
IEEE
16 years 1 months ago
A case study in testing a network security algorithm
Several difficulties arise when testing network security algorithms. First, using network data captured at a router does not guarantee that any instances of the security event of...
Carrie Gates
184
Voted
CSFW
2006
IEEE
16 years 23 days ago
Simulation-Based Security with Inexhaustible Interactive Turing Machines
Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Findi...
Ralf Küsters
ACNS
2004
Springer
106views Cryptology» more  ACNS 2004»
16 years 3 days ago
On the Security of Cryptosystems with All-or-Nothing Transform
We study the data privacy of cryptosystems with All-or-Nothing transform (AONT). An AONT is an efficient computable transform with two properties: Given all the bits of its output...
Rui Zhang 0002, Goichiro Hanaoka, Hideki Imai