Sciweavers

1770 search results - page 16 / 354
» Writing requirements in computer security
Sort
View
CSFW
2005
IEEE
14 years 1 months ago
Nomad: A Security Model with Non Atomic Actions and Deadlines
Modelling security policies requires means to specify permissions and prohibitions. However, this is generally not sufficient to express security properties such as availability ...
Frédéric Cuppens, Nora Cuppens-Boula...
EUROCRYPT
2004
Springer
14 years 1 months ago
Multi-party Computation with Hybrid Security
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
Matthias Fitzi, Thomas Holenstein, Jürg Wulls...
TIT
2008
187views more  TIT 2008»
13 years 7 months ago
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
Stefan Dziembowski, Ueli M. Maurer
PROVSEC
2007
Springer
14 years 1 months ago
Formal Proof of Provable Security by Game-Playing in a Proof Assistant
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
Reynald Affeldt, Miki Tanaka, Nicolas Marti
IPPS
2000
IEEE
14 years 5 hour ago
A Requirements Analysis for Parallel KDD Systems
Abstract. The current generation of data mining tools have limited capacity and performance, since these tools tend to be sequential. This paper explores a migration path out of th...
William Maniatty, Mohammed Javeed Zaki