research
∙
02/24/2022
Random primes without primality testing
Numerous algorithms call for computation over the integers modulo a rand...
share
research
∙
02/16/2022
Sparse Polynomial Interpolation and Division in Soft-linear Time
Given a way to evaluate an unknown polynomial with integer coefficients,...
research
∙
02/12/2022
Random primes in arithmetic progressions
We describe a straightforward method to generate a random prime q such t...
research
∙
10/05/2021
VESPo: Verified Evaluation of Secret Polynomials
We consider the problem of efficiently evaluating a secret polynomial at...
research
∙
09/09/2021
Fighting Fake News in Encrypted Messaging with the Fuzzy Anonymous Complaint Tally System (FACTS)
Recent years have seen a strong uptick in both the prevalence and real-w...
research
∙
02/24/2020
Fast In-place Algorithms for Polynomial Operations: Division, Evaluation, Interpolation
We consider space-saving versions of several important operations on uni...
research
∙
07/22/2018
What Can (and Can't) we Do with Sparse Polynomials?
Simply put, a sparse polynomial is one whose zero coefficients are not e...
research
∙
07/03/2018
Verification Protocols with Sub-Linear Communication for Polynomial Matrix Operations
We design and analyze new protocols to verify the correctness of various...
research
∙
07/03/2018
Interactive Certificates for Polynomial Matrices with Sub-Linear Communication
We develop and analyze new protocols to verify the correctness of variou...
research
∙
05/22/2018
New Instantiations of the CRYPTO 2017 Masking Schemes
At CRYPTO 2017, Belaïd et al presented two new private multiplication al...
research
∙
02/07/2018