28 search results - page 4 / 6 » Fast Garbling of Circuits Under Standard Assumptions |
WADS
2005
Springer
14 years 5 days ago
2005
Springer
We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with w-bit words, we obtain a running time of O(n2 / max{ w lg2 w , ...
FSE
2004
Springer
13 years 10 months ago
2004
Springer
ded abstract of this paper appears in Fast Software Encryption, FSE 2004, Lecture Notes in Computer Science, W. Meier and B. Roy editors, Springer-Verlag, 2004. This is the full ve...
TCC
2009
Springer
14 years 7 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
WSC
2000
13 years 8 months ago
2000
The calculation of value-at-risk (VAR) for large portfolios of complex instruments is among the most demanding and widespread computational challenges facing the financial industr...
FAST
2009
13 years 4 months ago
2009
The performance of file systems and related software depends on characteristics of the underlying file-system image (i.e., file-system metadata and file contents). Unfortunately, ...