Sciweavers

14850 search results - page 2968 / 2970
» The Security of
Sort
View
EUROCRYPT
2012
Springer
11 years 9 months ago
Fully Homomorphic Encryption with Polylog Overhead
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...
Craig Gentry, Shai Halevi, Nigel P. Smart
AVBPA
2005
Springer
395views Biometrics» more  AVBPA 2005»
13 years 9 months ago
A Score-Level Fusion Benchmark Database for Biometric Authentication
Fusing the scores of several biometric systems is a very promising approach to improve the overall system’s accuracy. Despite many works in the literature, it is surprising that ...
Norman Poh, Samy Bengio
PODC
2009
ACM
14 years 8 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
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...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
SOSP
2007
ACM
14 years 4 months ago
Attested append-only memory: making adversaries stick to their word
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...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
SOSP
2009
ACM
14 years 4 months ago
Automatically patching errors in deployed software
We present ClearView, a system for automatically patching errors in deployed software. ClearView works on stripped Windows x86 binaries without any need for source code, debugging...
Jeff H. Perkins, Sunghun Kim, Samuel Larsen, Saman...
« Prev « First page 2968 / 2970 Last » Next »