530 search results - page 106 / 106 » Universal randomized switching |
ICSE
2011
IEEE-ACM
14 years 3 months ago
2011
IEEE-ACM
Considerable progress has been made towards automatic support for one of the principal techniques available to enhance program reliability: equipping programs with extensive contr...
123
click to vote
CRYPTO
2011
Springer
13 years 11 months ago
2011
Springer
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...
123
click to vote
IACR
2011
13 years 11 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
112
Voted
ISCA
2005
IEEE
15 years 5 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
99
Voted
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...