Sciweavers

1770 search results - page 13 / 354
» Writing requirements in computer security
Sort
View
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
14 years 8 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...
ISSA
2008
13 years 9 months ago
The Impact of Information Security Awareness Training on Information Security Behaviour: The Case for Further Research
Information Security awareness initiatives are seen as critical to any information security programme. But, how do we determine the effectiveness of these awareness initiatives? W...
Tony Stephanou, Rabelani Dagada
OOPSLA
2001
Springer
14 years 1 days ago
An On-the-Fly Reference Counting Garbage Collector for Java
Reference counting is not naturally suitable for running on multiprocessors. The update of pointers and reference counts requires atomic and synchronized operations. We present a ...
Yossi Levanoni, Erez Petrank
HPCA
1999
IEEE
13 years 12 months ago
Using Lamport Clocks to Reason about Relaxed Memory Models
Cache coherence protocols of current shared-memory multiprocessors are difficult to verify. Our previous work proposed an extension of Lamport's logical clocks for showing th...
Anne Condon, Mark D. Hill, Manoj Plakal, Daniel J....
ACSAC
1999
IEEE
13 years 12 months ago
Safe Areas of Computation for Secure Computing with Insecure Applications
Currently the computer systems and software used by the average user offer virtually no security. Because of this many attacks, both simulated and real, have been described by the...
André L. M. dos Santos, Richard A. Kemmerer