1770 search results - page 35 / 354 » Writing requirements in computer security |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
TRUST
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Virtual Private Networks are a popular mechanism for building complex network infrastructures. Such infrastructures are usually accompanied by strict administrative restr...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In secure multi-party computation n parties jointly evaluate an n-variate function f in the presence of an adversary which can corrupt up till t parties. All honest parties are req...
SIAMCOMP
2011
13 years 2 months ago
2011
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...