Arnaud Sipasseuth

IACR Cryptol. ePrint Arch., 2024

Faster verifications and smaller signatures: Trade-offs for ALTEQ using rejections.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

2023

Fast verification and public key storage optimization for unstructured lattice-based signatures.

[BibT_eX]

[DOI]

J. Cryptogr. Eng., September, 2023

2022

Tight Bound on NewHope Failure Probability.

[BibT_eX]

[DOI]

IEEE Trans. Emerg. Top. Comput., 2022

Generating Very Large RNS Bases.

[BibT_eX]

[DOI]

IEEE Trans. Emerg. Top. Comput., 2022

Lattice-based public-key encryption with equality test supporting flexible authorization in standard model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Chosen-ciphertext lattice-based public key encryption with equality test in standard model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

2021

Generating Residue Number System Bases.

[BibT_eX]

[DOI]

Proceedings of the 28th IEEE Symposium on Computer Arithmetic, 2021

2020

A Noise Study of the PSW Signature Family: Patching DRS with Uniform Distribution †.

[BibT_eX]

[DOI]

Inf., 2020

Lattice-based public key encryption with equality test in standard model, revisited.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2019

Using Freivalds' Algorithm to Accelerate Lattice-Based Signature Verifications.

[BibT_eX]

[DOI]

Proceedings of the Information Security Practice and Experience, 2019

Improving the Security of the DRS Scheme with Uniformly Chosen Random Noise.

[BibT_eX]

[DOI]