On lacunary polynomial perfect powers. - Mark Giesbrecht; Daniel S. Roche (ISSAC, 2008)

Automatic variable order selection for polynomial system solving (abstract only). - John P. May; Mark Giesbrecht; Daniel S. Roche; Marc Moreno Maza; Yuzhen Xie (ACM Commun. Comput. Algebra, 2008)

Detecting polynomial perfect powers (abstract only). - Daniel S. Roche; Mark Giesbrecht (ACM Commun. Comput. Algebra, 2008)

Space- and time-efficient polynomial multiplication. - Daniel S. Roche (ISSAC, 2009)

An in-place truncated fourier transform and applications to polynomial multiplication. - David Harvey; Daniel S. Roche (ISSAC, 2010)

Interpolation of Shifted-Lacunary Polynomials. - Mark Giesbrecht; Daniel S. Roche (Comput. Complex., 2010)

Abstract only: Complexity of sparsest multiple computation. - Mark Giesbrecht; Daniel S. Roche; Hrushikesh Tilak (ACM Commun. Comput. Algebra, 2010)

Diversification improves interpolation. - Mark Giesbrecht; Daniel S. Roche (ISSAC, 2011)

Detecting lacunary perfect powers and computing their roots. - Mark Giesbrecht; Daniel S. Roche (J. Symb. Comput., 2011)

Chunky and equal-spaced polynomial multiplication. - Daniel S. Roche (J. Symb. Comput., 2011)

Efficient Computation with Sparse and Dense Polynomials. - Daniel S. Roche (2011)

Computing Sparse Multiples of Polynomials. - Mark Giesbrecht; Daniel S. Roche; Hrushikesh Tilak (Algorithmica, 2012)

Faster Sparse Interpolation of Straight-Line Programs. - Andrew Arnold; Mark Giesbrecht; Daniel S. Roche (CASC, 2013)

Recursive sparse interpolation. - Andrew Arnold; Mark Giesbrecht; Daniel S. Roche (ACM Commun. Comput. Algebra, 2013)

Abstracts of the 2013 east coast computer algebra day. - Daniel S. Roche (ACM Commun. Comput. Algebra, 2013)

Faster sparse interpolation of straight-line program - Andrew Arnold; Mark Giesbrecht; Daniel S. Roche (CoRR, 2013)

Sparse interpolation over finite fields via low-order roots of unity. - Andrew Arnold; Mark Giesbrecht; Daniel S. Roche (ISSAC, 2014)

Multivariate sparse interpolation using randomized Kronecker substitutions. - Andrew Arnold; Daniel S. Roche (ISSAC, 2014)

Faster sparse polynomial interpolation of straight-line programs over finite fields. - Andrew Arnold; Mark Giesbrecht; Daniel S. Roche (CoRR, 2014)

Parallel sparse interpolation using small primes. - Mohamed Khochtali; Daniel S. Roche; Xisen Tian (PASCO, 2015)

Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication. - Andrew Arnold; Daniel S. Roche (ISSAC, 2015)

Oblivious Secure Deletion with Bounded History Independence. - Daniel S. Roche; Adam J. Aviv; Seung Geol Choi (CoRR, 2015)

A Practical Oblivious Map Data Structure with Secure Deletion and History Independence. - Daniel S. Roche; Adam J. Aviv; Seung Geol Choi (IACR Cryptol. ePrint Arch., 2015)

POPE: Partial Order-Preserving Encoding. - Daniel S. Roche; Daniel Apon; Seung Geol Choi; Arkady Yerukhimovich (IACR Cryptol. ePrint Arch., 2015)

Managing Cloud Storage Obliviously. - Vaishali Narkhede; Karuna P. Joshi; Adam J. Aviv; Seung Geol Choi; Daniel S. Roche; Tim Finin (CLOUD, 2016)

Sparse polynomials in FLINT. - A. Whitman Groves; Daniel S. Roche (ACM Commun. Comput. Algebra, 2016)

ObliviSync: Practical Oblivious File Backup and Synchronization. - Adam J. Aviv; Seung Geol Choi; Travis Mayberry; Daniel S. Roche (IACR Cryptol. ePrint Arch., 2016)

Faster sparse multivariate polynomial interpolation of straight-line programs. - Andrew Arnold; Mark Giesbrecht; Daniel S. Roche (J. Symb. Comput., 2016)

Deterministic, Stash-Free Write-Only ORAM. - Daniel S. Roche; Adam J. Aviv; Seung Geol Choi; Travis Mayberry (IACR Cryptol. ePrint Arch., 2017)

What Can (and Can't) we Do with Sparse Polynomials? - Daniel S. Roche (ISSAC, 2018)

Error Correction in Fast Matrix Multiplication and Inverse. - Daniel S. Roche (ISSAC, 2018)

Interactive Certificates for Polynomial Matrices with Sub-Linear Communication. - David Lucas 001; Vincent Neiger; Clément Pernet; Daniel S. Roche; Johan Rosenkilde (CoRR, 2018)

Efficient Range ORAM with 핆(log2N) Locality. - Anrin Chakraborti; Adam J. Aviv; Seung Geol Choi; Travis Mayberry; Daniel S. Roche; Radu Sion (IACR Cryptol. ePrint Arch., 2018)

New Instantiations of the CRYPTO 2017 Masking Schemes. - Pierre Karpman; Daniel S. Roche (IACR Cryptol. ePrint Arch., 2018)

Poster: Proofs of Retrievability with Low Server Storage. - Michael Hanling; Gaspard Anthoine; Jean-Guillaume Dumas; Aude Maignan; Clément Pernet; Daniel S. Roche (CCS, 2019)

LU Factorization with Errors. - Jean-Guillaume Dumas; Joris van der Hoeven; Clément Pernet; Daniel S. Roche (ISSAC, 2019)

Generic Reductions for In-place Polynomial Multiplication. - Pascal Giorgi; Bruno Grenet; Daniel S. Roche (ISSAC, 2019)

rORAM: Efficient Range ORAM with O(log2 N) Locality. - Anrin Chakraborti; Adam J. Aviv; Seung Geol Choi; Travis Mayberry; Daniel S. Roche; Radu Sion (NDSS, 2019)

Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic. - Claude-Pierre Jeannerod; Théo Mary; Clément Pernet; Daniel S. Roche (SIAM J. Matrix Anal. Appl., 2019)

Twice as Nice? A Preliminary Evaluation of Double Android Unlock Patterns. - Timothy J. Forman; Daniel S. Roche; Adam J. Aviv (CHI Extended Abstracts, 2020)

Fast in-place algorithms for polynomial operations: division, evaluation, interpolation. - Pascal Giorgi; Bruno Grenet; Daniel S. Roche (ISSAC, 2020)

Improving Signal's Sealed Sender. - Ian Martiny; Gabriel Kaptchuk; Adam J. Aviv; Daniel S. Roche; Eric Wustrow (NDSS, 2021)

Dynamic proofs of retrievability with low server storage. - Gaspard Anthoine; Jean-Guillaume Dumas; Mélanie de Jonghe; Aude Maignan; Clément Pernet; Michael Hanling; Daniel S. Roche (USENIX Security Symposium, 2021)

VESPo: Verified Evaluation of Secret Polynomials. - Jean-Guillaume Dumas; Aude Maignan; Clément Pernet; Daniel S. Roche (CoRR, 2021)

Fighting Fake News in Encrypted Messaging with the Fuzzy Anonymous Complaint Tally System (FACTS). - Linsheng Liu; Daniel S. Roche; Austin Theriault; Arkady Yerukhimovich (IACR Cryptol. ePrint Arch., 2021)

Verification protocols with sub-linear communication for polynomial matrix operations. - David Lucas 001; Vincent Neiger; Clément Pernet; Daniel S. Roche; Johan Rosenkilde (J. Symb. Comput., 2021)

Random Primes without Primality Testing. - Pascal Giorgi; Bruno Grenet; Armelle Perret du Cray; Daniel S. Roche (ISSAC, 2022)

Sparse Polynomial Interpolation and Division in Soft-linear Time. - Pascal Giorgi; Bruno Grenet; Armelle Perret du Cray; Daniel S. Roche (ISSAC, 2022)

Random primes in arithmetic progressions. - Pascal Giorgi; Bruno Grenet; Armelle Perret du Cray; Daniel S. Roche (IACR Cryptol. ePrint Arch., 2022)

VESPo: Verified Evaluation of Secret Polynomials (with application to dynamic proofs of retrievability). - Jean-Guillaume Dumas; Aude Maignan; Clément Pernet; Daniel S. Roche (Proc. Priv. Enhancing Technol., 2023)

Fast interpolation and multiplication of unbalanced polynomials. - Pascal Giorgi; Bruno Grenet; Armelle Perret du Cray; Daniel S. Roche (ISSAC, 2024)

Corrigimus, verificamus, vincimus: Ensuring algorithmic accuracy in an age of uncertainty. - Daniel S. Roche (ISSAC, 2024)

Communication Optimal Unbalanced Private Set Union. - Jean-Guillaume Dumas; Alexis Galan; Bruno Grenet; Aude Maignan; Daniel S. Roche (CoRR, 2024)

Optimal Communication Unbalanced Private Set Union. - Jean-Guillaume Dumas; Alexis Galan; Bruno Grenet; Aude Maignan; Daniel S. Roche (ACNS (2), 2025)