Sciweavers

1770 search results - page 30 / 354
» Writing requirements in computer security
Sort
View
FOCS
2003
IEEE
14 years 28 days ago
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
Rafael Pass, Alon Rosen
COMPUTER
2004
120views more  COMPUTER 2004»
13 years 7 months ago
Computer Security in the Real World
After thirty years of work on computer security, why are almost all the systems in service today extremely vulnerable to attack? The main reason is that security is expensive to s...
Butler W. Lampson
PAIRING
2010
Springer
153views Cryptology» more  PAIRING 2010»
13 years 6 months ago
Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves
This paper presents a novel method for designing compact yet efficient hardware implementations of the Tate pairing over supersingular curves in small characteristic. Since such cu...
Nicolas Estibals
FC
2004
Springer
88views Cryptology» more  FC 2004»
14 years 1 months ago
Mental Models of Computer Security
Improved computer security requires improvements in risk communication to naive end users. Efficacy of risk communication depends not only on the nature of the risk, but also on t...
L. Jean Camp
SOSP
2009
ACM
14 years 4 months ago
Fabric: a platform for secure distributed computation and storage
Fabric is a new system and language for building secure distributed information systems. It is a decentralized system that allows heterogeneous network nodes to securely share bot...
Jed Liu, Michael D. George, K. Vikram, Xin Qi, Luc...