53 search results - page 3 / 11 » The Exact Round Complexity of Secure Computation |
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
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...
CTRSA
2006
Springer
13 years 8 months ago
2006
Springer
In this work, we initiate the study of realizing a ranking functionality (m1,
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
Broadcast among n parties in the presence of t ≥ n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI an...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...