Sciweavers

5665 search results - page 70 / 1133
» Introduction to Computer Security
Sort
View
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
13 years 10 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 2 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
ICC
2007
IEEE
111views Communications» more  ICC 2007»
14 years 3 months ago
SecureRank: A Risk-Based Vulnerability Management Scheme for Computing Infrastructures
— In this paper, we introduce a new scheme called SecureRank for prioritizing vulnerabilities to patch in computing systems/networks. This has become a key issue for IT infrastru...
Reiko Ann Miura-Ko, Nicholas Bambos
FC
2004
Springer
88views Cryptology» more  FC 2004»
14 years 2 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
EUROCRYPT
1998
Springer
14 years 1 months ago
Quorum-Based Secure Multi-party Computation
Abstract. This paper describes e cient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to...
Donald Beaver, Avishai Wool