Algebraic Methods for Stronger Crypto October 2017 - September 2022
Collection
Collection
-
How Long Can Optimal Locally Repairable Codes Be? Article
IEEE Transactions on Information Theory, 65(6), 3662-3670.V. Guruswami (Venkatesan), C. Xing (Chaoping) and C. Yuan (Chen)
June 2019 -
Private hospital workflow optimization via secure k-means clustering Article
Journal of Medical Systems, 44(1)G. Spini (Gabriele), M. van Heesch (Maran), P.J.M. Veugen (Thijs) and S. Chatterjea (Supriyo)
November 2019
-
Efficient Verifiable Delay Functions Article
Journal of Cryptology, 33(4), 2113-2147.October 2020
-
Mildly short vectors in cyclotomic ideal lattices in quantum polynomial time Article
Journal of the ACM, 68(2)R.J.F. Cramer (Ronald), L. Ducas (Léo) and B.P.C. Wesolowski (Benjamin)
January 2021 -
Lossless dimension expanders via linearized polynomials and subspace designs Article
Combinatorica, 545-579.V. Guruswami (Venkatesan), N.A. Resch (Nicolas) and C. Xing (Chaoping)
February 2021 -
Online-extractability in the quantum random-oracle model Tech Report
J.W. Don (Jelle), S. Fehr (Serge), C. Majenz (Christian) and C. Schaffner (Christian)
March 2021
-
A note on short invertible ring elements and applications to cyclotomic and trinomials number fields Article
Mathematical Cryptology, 1(1), 45-70.T. Attema (Thomas), R.J.F. Cramer (Ronald) and C. Xing (Chaoping)
June 2021
-
Advanced lattice sieving on GPUs, with Tensor Cores In Proceedings
L. Ducas (Léo), M.M.J. Stevens (Marc) and W.P.J. van Woerden (Wessel)
June 2021