# Daniel S. Roche

According to our database

Collaborative distances:

^{1}, Daniel S. Roche authored at least 30 papers between 2008 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Efficient Range ORAM with 핆(log

^{2}N) Locality.
IACR Cryptology ePrint Archive, 2018

Error Correction in Fast Matrix Multiplication and Inverse.

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

What Can (and Can't) we Do with Sparse Polynomials?

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

New Instantiations of the CRYPTO 2017 Masking Schemes.

Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017

ObliviSync: Practical Oblivious File Backup and Synchronization.

Proceedings of the 24th Annual Network and Distributed System Security Symposium, 2017

Deterministic, Stash-Free Write-Only ORAM.

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30, 2017

2016

Faster sparse multivariate polynomial interpolation of straight-line programs.

J. Symb. Comput., 2016

Sparse polynomials in FLINT.

ACM Comm. Computer Algebra, 2016

A Practical Oblivious Map Data Structure with Secure Deletion and History Independence.

Proceedings of the IEEE Symposium on Security and Privacy, 2016

POPE: Partial Order Preserving Encoding.

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

Managing Cloud Storage Obliviously.

Proceedings of the 9th IEEE International Conference on Cloud Computing, 2016

2015

Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication.

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

Parallel sparse interpolation using small primes.

Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, 2015

2014

Multivariate sparse interpolation using randomized Kronecker substitutions.

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

Sparse interpolation over finite fields via low-order roots of unity.

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013

Abstracts of the 2013 east coast computer algebra day.

ACM Comm. Computer Algebra, 2013

Recursive sparse interpolation.

ACM Comm. Computer Algebra, 2013

Faster Sparse Interpolation of Straight-Line Programs.

Proceedings of the Computer Algebra in Scientific Computing - 15th International Workshop, 2013

2011

Efficient Computation with Sparse and Dense Polynomials.

PhD thesis, 2011

Chunky and equal-spaced polynomial multiplication.

J. Symb. Comput., 2011

Detecting lacunary perfect powers and computing their roots.

J. Symb. Comput., 2011

Diversification improves interpolation.

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010

Abstract only: Complexity of sparsest multiple computation.

ACM Comm. Computer Algebra, 2010

Interpolation of Shifted-Lacunary Polynomials.

Computational Complexity, 2010

An in-place truncated fourier transform and applications to polynomial multiplication.

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

Computing Sparse Multiples of Polynomials.

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Space- and time-efficient polynomial multiplication.

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2008

Detecting polynomial perfect powers (abstract only).

ACM Comm. Computer Algebra, 2008

Automatic variable order selection for polynomial system solving (abstract only).

ACM Comm. Computer Algebra, 2008

On lacunary polynomial perfect powers.

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008