Daniel S. Roche

CoRR, 2024

2023

VESPo: Verified Evaluation of Secret Polynomials (with application to dynamic proofs of retrievability).

[BibT_eX]

[DOI]

Proc. Priv. Enhancing Technol., July, 2023

2022

Random primes in arithmetic progressions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Sparse Polynomial Interpolation and Division in Soft-linear Time.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

Random Primes without Primality Testing.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021

Verification protocols with sub-linear communication for polynomial matrix operations.

[BibT_eX]

[DOI]

J. Symb. Comput., 2021

Fighting Fake News in Encrypted Messaging with the Fuzzy Anonymous Complaint Tally System (FACTS).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

VESPo: Verified Evaluation of Secret Polynomials.

[BibT_eX]

[DOI]

CoRR, 2021

Dynamic proofs of retrievability with low server storage.

[BibT_eX]

[DOI]

Proceedings of the 30th USENIX Security Symposium, 2021

Improving Signal's Sealed Sender.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Network and Distributed System Security Symposium, 2021

2020

Fast in-place algorithms for polynomial operations: division, evaluation, interpolation.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Twice as Nice? A Preliminary Evaluation of Double Android Unlock Patterns.

[BibT_eX]

[DOI]

Timothy J. Forman

Adam J. Aviv

Proceedings of the Extended Abstracts of the 2020 CHI Conference on Human Factors in Computing Systems, 2020

2019

Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic.

[BibT_eX]

[DOI]

Claude-Pierre Jeannerod

Théo Mary

Clément Pernet

SIAM J. Matrix Anal. Appl., 2019

rORAM: Efficient Range ORAM with O(log2 N) Locality.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual Network and Distributed System Security Symposium, 2019

Generic Reductions for In-place Polynomial Multiplication.

[BibT_eX]

[DOI]

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

LU Factorization with Errors.

[BibT_eX]

[DOI]

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

Poster: Proofs of Retrievability with Low Server Storage.

[BibT_eX]

[DOI]

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

2018

New Instantiations of the CRYPTO 2017 Masking Schemes.

[BibT_eX]

[DOI]

Pierre Karpman

IACR Cryptol. ePrint Arch., 2018

Efficient Range ORAM with 핆(log<sup>2</sup>N) Locality.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Interactive Certificates for Polynomial Matrices with Sub-Linear Communication.

[BibT_eX]

[DOI]

CoRR, 2018

Error Correction in Fast Matrix Multiplication and Inverse.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

2017

Deterministic, Stash-Free Write-Only ORAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

2016

Faster sparse multivariate polynomial interpolation of straight-line programs.

[BibT_eX]

[DOI]

J. Symb. Comput., 2016

ObliviSync: Practical Oblivious File Backup and Synchronization.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Sparse polynomials in FLINT.

[BibT_eX]

[DOI]

A. Whitman Groves

ACM Commun. Comput. Algebra, 2016

Managing Cloud Storage Obliviously.

[BibT_eX]

[DOI]

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

2015

POPE: Partial Order-Preserving Encoding.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

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

[BibT_eX]

[DOI]

Adam J. Aviv

Seung Geol Choi

IACR Cryptol. ePrint Arch., 2015

Oblivious Secure Deletion with Bounded History Independence.

[BibT_eX]

[DOI]

Adam J. Aviv

Seung Geol Choi

CoRR, 2015

Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication.

[BibT_eX]

[DOI]

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

Parallel sparse interpolation using small primes.

[BibT_eX]

[DOI]

Mohamed Khochtali

Xisen Tian

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

2014

Faster sparse polynomial interpolation of straight-line programs over finite fields.

[BibT_eX]

[DOI]

CoRR, 2014

Multivariate sparse interpolation using randomized Kronecker substitutions.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

2013

Faster sparse interpolation of straight-line program

[BibT_eX]

[DOI]

CoRR, 2013

Abstracts of the 2013 east coast computer algebra day.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2013

Recursive sparse interpolation.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2013

Faster Sparse Interpolation of Straight-Line Programs.

[BibT_eX]

[DOI]

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

2012

Computing Sparse Multiples of Polynomials.

[BibT_eX]

[DOI]

Hrushikesh Tilak

Algorithmica, 2012

2011

Efficient Computation with Sparse and Dense Polynomials.

[BibT_eX]

[DOI]

PhD thesis, 2011

Chunky and equal-spaced polynomial multiplication.

[BibT_eX]

[DOI]

J. Symb. Comput., 2011

Detecting lacunary perfect powers and computing their roots.

[BibT_eX]

[DOI]

J. Symb. Comput., 2011

Diversification improves interpolation.

[BibT_eX]

[DOI]

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

2010

Abstract only: Complexity of sparsest multiple computation.

[BibT_eX]

[DOI]

Hrushikesh Tilak

ACM Commun. Comput. Algebra, 2010

Interpolation of Shifted-Lacunary Polynomials.

[BibT_eX]

[DOI]

Comput. Complex., 2010

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

[BibT_eX]

[DOI]

David Harvey

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

2009

Space- and time-efficient polynomial multiplication.

[BibT_eX]

[DOI]

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

2008

Detecting polynomial perfect powers (abstract only).

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2008

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

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2008

On lacunary polynomial perfect powers.

[BibT_eX]

[DOI]