Daniel S. Roche

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 57

Top Venues

CoRR

ISSAC

IACR Cryptol. ePrint Arch.

NDSS

University of Waterloo, Ontario, Canada (PHD)

Education History

University of Waterloo, Ontario, Canada

PHD

Publications

Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
Fast interpolation and multiplication of unbalanced polynomials. ISSAC (2024)
Jean-Guillaume Dumas, Alexis Galan, Bruno Grenet, Aude Maignan, Daniel S. Roche
Communication Optimal Unbalanced Private Set Union. CoRR (2024)
Daniel S. Roche
Corrigimus, verificamus, vincimus: Ensuring algorithmic accuracy in an age of uncertainty. ISSAC (2024)
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
Fast interpolation and multiplication of unbalanced polynomials. CoRR (2024)
Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche
VESPo: Verified Evaluation of Secret Polynomials (with application to dynamic proofs of retrievability). Proc. Priv. Enhancing Technol. 2023 (3) (2023)
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
Sparse Polynomial Interpolation and Division in Soft-linear Time. ISSAC (2022)
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
Random primes in arithmetic progressions. CoRR (2022)
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
Random primes in arithmetic progressions. IACR Cryptol. ePrint Arch. 2022 (2022)
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
Sparse polynomial interpolation and division in soft-linear time. CoRR (2022)
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
Random primes without primality testing. CoRR (2022)
Linsheng Liu, Daniel S. Roche, Austin Theriault, Arkady Yerukhimovich
Fighting Fake News in Encrypted Messaging with the Fuzzy Anonymous Complaint Tally System (FACTS). NDSS (2022)
Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche
Random Primes without Primality Testing. ISSAC (2022)
Ian Martiny, Gabriel Kaptchuk, Adam J. Aviv, Daniel S. Roche, Eric Wustrow
Improving Signal's Sealed Sender. NDSS (2021)
Linsheng Liu, Daniel S. Roche, Austin Theriault, Arkady Yerukhimovich
Fighting Fake News in Encrypted Messaging with the Fuzzy Anonymous Complaint Tally System (FACTS). IACR Cryptol. ePrint Arch. 2021 (2021)
Linsheng Liu, Daniel S. Roche, Austin Theriault, Arkady Yerukhimovich
Fighting Fake News in Encrypted Messaging with the Fuzzy Anonymous Complaint Tally System (FACTS). CoRR (2021)
Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche
VESPo: Verified Evaluation of Secret Polynomials. CoRR (2021)
David Lucas, Vincent Neiger, Clément Pernet, Daniel S. Roche, Johan Rosenkilde
Verification protocols with sub-linear communication for polynomial matrix operations. J. Symb. Comput. 105 (2021)
Gaspard Anthoine, Jean-Guillaume Dumas, Mélanie de Jonghe, Aude Maignan, Clément Pernet, Michael Hanling, Daniel S. Roche
Dynamic proofs of retrievability with low server storage. USENIX Security Symposium (2021)
Pascal Giorgi, Bruno Grenet, Daniel S. Roche
Fast in-place algorithms for polynomial operations: division, evaluation, interpolation. ISSAC (2020)
Gaspard Anthoine, Jean-Guillaume Dumas, Michael Hanling, Mélanie de Jonghe, Aude Maignan, Clément Pernet, Daniel S. Roche
Dynamic proofs of retrievability with low server storage. CoRR (2020)
Timothy J. Forman, Daniel S. Roche, Adam J. Aviv
Twice as Nice? A Preliminary Evaluation of Double Android Unlock Patterns. CHI Extended Abstracts (2020)
Pascal Giorgi, Bruno Grenet, Daniel S. Roche
Fast in-place algorithms for polynomial operations: division, evaluation, interpolation. CoRR (2020)
Jean-Guillaume Dumas, Joris van der Hoeven, Clément Pernet, Daniel S. Roche
LU factorization with errors. CoRR (2019)
Pascal Giorgi, Bruno Grenet, Daniel S. Roche
Generic reductions for in-place polynomial multiplication. CoRR (2019)
Pascal Giorgi, Bruno Grenet, Daniel S. Roche
Generic Reductions for In-place Polynomial Multiplication. ISSAC (2019)
Jean-Guillaume Dumas, Joris van der Hoeven, Clément Pernet, Daniel S. Roche
LU Factorization with Errors. ISSAC (2019)
Claude-Pierre Jeannerod, Théo Mary, Clément Pernet, Daniel S. Roche
Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic. SIAM J. Matrix Anal. Appl. 40 (4) (2019)
Anrin Chakraborti, Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche, Radu Sion
rORAM: Efficient Range ORAM with O(log2 N) Locality. NDSS (2019)
Michael Hanling, Gaspard Anthoine, Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche
Poster: Proofs of Retrievability with Low Server Storage. CCS (2019)
David Lucas, Vincent Neiger, Clément Pernet, Daniel S. Roche, Johan Rosenkilde
Interactive Certificates for Polynomial Matrices with Sub-Linear Communication. CoRR (2018)
Daniel S. Roche
What Can (and Can't) we Do with Sparse Polynomials? CoRR (2018)
Anrin Chakraborti, Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche, Radu Sion
N) Locality. IACR Cryptol. ePrint Arch. 2018 (2018)
Daniel S. Roche
What Can (and Can't) we Do with Sparse Polynomials? ISSAC (2018)
Daniel S. Roche
Error correction in fast matrix multiplication and inverse. CoRR (2018)
Pierre Karpman, Daniel S. Roche
New Instantiations of the CRYPTO 2017 Masking Schemes. CoRR (2018)
Pierre Karpman, Daniel S. Roche
New Instantiations of the CRYPTO 2017 Masking Schemes. ASIACRYPT (2) (2018)
Daniel S. Roche
Error Correction in Fast Matrix Multiplication and Inverse. ISSAC (2018)
Pierre Karpman, Daniel S. Roche
New Instantiations of the CRYPTO 2017 Masking Schemes. IACR Cryptol. ePrint Arch. 2018 (2018)
Daniel S. Roche, Adam J. Aviv, Seung Geol Choi, Travis Mayberry
Deterministic, Stash-Free Write-Only ORAM. IACR Cryptol. ePrint Arch. 2017 (2017)
Daniel S. Roche, Adam J. Aviv, Seung Geol Choi, Travis Mayberry
Deterministic, Stash-Free Write-Only ORAM. CCS (2017)
Daniel S. Roche, Adam J. Aviv, Seung Geol Choi, Travis Mayberry
Deterministic, Stash-Free Write-Only ORAM. CoRR (2017)
Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche
ObliviSync: Practical Oblivious File Backup and Synchronization. NDSS (2017)
Vaishali Narkhede, Karuna P. Joshi, Adam J. Aviv, Seung Geol Choi, Daniel S. Roche, Tim Finin
Managing Cloud Storage Obliviously. CLOUD (2016)
Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche
ObliviSync: Practical Oblivious File Backup and Synchronization. IACR Cryptol. ePrint Arch. 2016 (2016)
Daniel S. Roche, Adam J. Aviv, Seung Geol Choi
A Practical Oblivious Map Data Structure with Secure Deletion and History Independence. IEEE Symposium on Security and Privacy (2016)
Adam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. Roche
ObliviSync: Practical Oblivious File Backup and Synchronization. CoRR (2016)
Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Faster sparse multivariate polynomial interpolation of straight-line programs. J. Symb. Comput. 75 (2016)
A. Whitman Groves, Daniel S. Roche
Sparse polynomials in FLINT. ACM Commun. Comput. Algebra 50 (3) (2016)
Daniel S. Roche, Daniel Apon, Seung Geol Choi, Arkady Yerukhimovich
POPE: Partial Order Preserving Encoding. CoRR (2016)
Daniel S. Roche, Daniel Apon, Seung Geol Choi, Arkady Yerukhimovich
POPE: Partial Order Preserving Encoding. CCS (2016)
Daniel S. Roche, Adam J. Aviv, Seung Geol Choi
Oblivious Secure Deletion with Bounded History Independence. CoRR (2015)
Mohamed Khochtali, Daniel S. Roche, Xisen Tian
Parallel sparse interpolation using small primes. PASCO (2015)
Andrew Arnold, Daniel S. Roche
Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication. ISSAC (2015)
Andrew Arnold, Daniel S. Roche
Output-sensitive algorithms for sumset and sparse polynomial multiplication. CoRR (2015)
Daniel S. Roche, Adam J. Aviv, Seung Geol Choi
A Practical Oblivious Map Data Structure with Secure Deletion and History Independence. IACR Cryptol. ePrint Arch. 2015 (2015)
Mohamed Khochtali, Daniel S. Roche, Xisen Tian
Parallel sparse interpolation using small primes. CoRR (2015)
Daniel S. Roche, Daniel Apon, Seung Geol Choi, Arkady Yerukhimovich
POPE: Partial Order-Preserving Encoding. IACR Cryptol. ePrint Arch. 2015 (2015)
Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Sparse interpolation over finite fields via low-order roots of unity. ISSAC (2014)
Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Faster Sparse Multivariate Polynomial Interpolation of Straight-Line Programs. CoRR (2014)
Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Faster sparse polynomial interpolation of straight-line programs over finite fields. CoRR (2014)
Andrew Arnold, Daniel S. Roche
Multivariate sparse interpolation using randomized Kronecker substitutions. ISSAC (2014)
Andrew Arnold, Daniel S. Roche
Multivariate sparse interpolation using randomized Kronecker substitutions. CoRR (2014)
Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Faster Sparse Interpolation of Straight-Line Programs. CASC (2013)
Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Recursive sparse interpolation. ACM Commun. Comput. Algebra 47 (3/4) (2013)
Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Faster sparse interpolation of straight-line program CoRR (2013)
Daniel S. Roche
Abstracts of the 2013 east coast computer algebra day. ACM Commun. Comput. Algebra 47 (1/2) (2013)
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
Computing Sparse Multiples of Polynomials. Algorithmica 64 (3) (2012)
Mark Giesbrecht, Daniel S. Roche
Diversification improves interpolation CoRR (2011)
Daniel S. Roche
Chunky and equal-spaced polynomial multiplication. J. Symb. Comput. 46 (7) (2011)
Mark Giesbrecht, Daniel S. Roche
Diversification improves interpolation. ISSAC (2011)
Mark Giesbrecht, Daniel S. Roche
Detecting lacunary perfect powers and computing their roots. J. Symb. Comput. 46 (11) (2011)
David Harvey, Daniel S. Roche
An in-place truncated fourier transform and applications to polynomial multiplication. ISSAC (2010)
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
Computing sparse multiples of polynomials CoRR (2010)
Daniel S. Roche
Chunky and Equal-Spaced Polynomial Multiplication CoRR (2010)
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
Abstract only: Complexity of sparsest multiple computation. ACM Commun. Comput. Algebra 44 (1/2) (2010)
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
Computing Sparse Multiples of Polynomials. ISAAC (1) (2010)
Mark Giesbrecht, Daniel S. Roche
Interpolation of Shifted-Lacunary Polynomials. Comput. Complex. 19 (3) (2010)
David Harvey, Daniel S. Roche
An in-place truncated Fourier transform and applications to polynomial multiplication CoRR (2010)
Daniel S. Roche
Space- and time-efficient polynomial multiplication. ISSAC (2009)
Mark Giesbrecht, Daniel S. Roche
Detecting lacunary perfect powers and computing their roots CoRR (2009)
Daniel S. Roche, Mark Giesbrecht
Detecting polynomial perfect powers (abstract only). ACM Commun. Comput. Algebra 42 (1-2) (2008)
Mark Giesbrecht, Daniel S. Roche
Interpolation of Shifted-Lacunary Polynomials CoRR (2008)
Mark Giesbrecht, Daniel S. Roche
On lacunary polynomial perfect powers. ISSAC (2008)
John P. May, Mark Giesbrecht, Daniel S. Roche, Marc Moreno Maza, Yuzhen Xie
Automatic variable order selection for polynomial system solving (abstract only). ACM Commun. Comput. Algebra 42 (1-2) (2008)

Daniel S. Roche.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Daniel S. Roche