315 search results - page 5 / 63 » Algebraic Lower Bounds for Computing on Encrypted Data |
IACR
2011
13 years 9 months ago
2011
Although malleability is undesirable in traditional digital signatures, schemes with limited malleability properties enable interesting functionalities that may be impossible to o...
81
Voted
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper proves ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
97
Voted
SPAA
2004
ACM
15 years 2 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
90
Voted
GLVLSI
2000
IEEE
15 years 1 months ago
2000
IEEE
In this paper we present a novel and fast estimation technique that produces tight latency lower bounds for Data Flow Graphs representing time critical segments of the application...