We consider the problem of interpolating an unknown multivariate polynomial with coefficients taken from a finite field or as numerical approximations of complex numbers, and provide the first provably stable algorithm (in the sense of relative error) for this problem.Expand

We present a new oblivious RAM that supports variable-sized storage blocks (vORAM), which is the first ORAM to allow varying block sizes without trivial padding.Expand

We give a new probabilistic algorithm for interpolating a "sparse" polynomial f given by a straight-line program, using probes of smaller degree than in previous methods.Expand

Write-Only Oblivious RAM (WoORAM) protocols provide privacy by encrypting the contents of data and also hiding the pattern of write operations over that data.Expand

We propose a new primitive called partial order preserving encoding (POPE) that achieves ideal OPE security with frequency hiding and also leaves a sizable fraction of the data pairwise incomparable.Expand

We present a new Monte Carlo algorithm for the interpolation of a straight-line program as a sparse polynomial f over an arbitrary finite field of size q.Expand

A new routine based on the Karatsuba/Ofman algorithm is presented with the same time complexity of <i>O</i>(<i>n</i><sup>1.59</sup>) but only <i>[log < i>N</i>) extra space for the computation.Expand

We present randomized algorithms to compute the sumset (Minkowski sum) of two integer sets, and to multiply two univariate integer polynomials given by sparse representations.Expand