1770 search results - page 85 / 354 » Writing requirements in computer security |
SACRYPT
1998
Springer
14 years 1 months ago
1998
Springer
In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accident...
ICDCS
2006
IEEE
14 years 3 months ago
2006
IEEE
Byzantine quorum systems have been proposed that work properly even when up to f replicas fail arbitrarily. However, these systems are not so successful when confronted with Byzan...
SPAA
2010
ACM
14 years 1 months ago
2010
ACM
Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of...
STACS
1992
Springer
14 years 1 months ago
1992
Springer
abstract Rafail Ostrovskyy Ramarathnam Venkatesanz Moti Yungx Secure commitment is a primitive enabling information hiding, which is one of the most basic tools in cryptography. S...
ENTCS
2008
13 years 9 months ago
2008
In Kahn process network (KPN), the processes (nodes) communicate by unbounded unidirectional FIFO channels (arcs), with the property of non-blocking writes and blocking reads on t...