#### Filter Results:

- Full text PDF available (18)

#### Publication Year

2000

2019

- This year (9)
- Last 5 years (24)
- Last 10 years (45)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Mark Giesbrecht, Daniel S. Roche
- ISSAC
- 2011

We consider the problem of interpolating an unknown multivariate polynomial with coefficients taken from a finite field or as numerical approximations of complex numbers. Building on the recent work… (More)

- Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
- CASC
- 2013

We give a new probabilistic algorithm for interpolating a “sparse” polynomial f given by a straight-line program. Our algorithm constructs an approximation f of f , such that f − f probably has at… (More)

- Daniel S. Roche, Daniel Christopher Apon, Seung Geol Choi, Arkady Yerukhimovich
- ACM Conference on Computer and Communications…
- 2015

Recently there has been much interest in performing search queries over encrypted data to enable functionality while protecting sensitive data. One particularly efficient mechanism for executing such… (More)

- Daniel S. Roche
- ISSAC
- 2009

Countless algorithms have been developed for the multiplication of univariate polynomials and multiprecision integers, but all those with sub-quadratic time complexity currently require at least… (More)

- Daniel S. Roche, Adam J. Aviv, Seung Geol Choi, Travis Mayberry
- ACM Conference on Computer and Communications…
- 2017

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. WoORAMs provide better privacy than… (More)

- Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
- ISSAC
- 2014

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. We assume a priori bounds D and T are given… (More)

- Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
- J. Symb. Comput.
- 2016

Given a straight-line program whose output is a polynomial function of the inputs, we present a new algorithm to compute a concise representation of that unknown function. Our algorithm can handle… (More)

- Andrew Arnold, Daniel S. Roche
- ISSAC
- 2014

We present new techniques for reducing a multivariate sparse polynomial to a univariate polynomial. The reduction works similarly to the classical and widely-used Kronecker substitution, except that… (More)

- Daniel S. Roche, Adam J. Aviv, Seung Geol Choi
- IEEE Symposium on Security and Privacy (SP)
- 2015

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. We also present a new… (More)

- Andrew Arnold, Daniel S. Roche
- ISSAC
- 2015

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. Our algorithm for… (More)