4263 search results - page 853 / 853 » Network Security |
EUROCRYPT
2012
Springer
11 years 7 months ago
2012
Springer
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
SOSP
2007
ACM
14 years 2 months ago
2007
ACM
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
PODC
2009
ACM
14 years 5 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...