Arnaud Sipasseuth

Orcid: 0000-0003-1048-4822

According to our database1, Arnaud Sipasseuth authored at least 11 papers between 2019 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Fast verification and public key storage optimization for unstructured lattice-based signatures.
J. Cryptogr. Eng., September, 2023

2022
Tight Bound on NewHope Failure Probability.
IEEE Trans. Emerg. Top. Comput., 2022

Generating Very Large RNS Bases.
IEEE Trans. Emerg. Top. Comput., 2022

Lattice-based public-key encryption with equality test supporting flexible authorization in standard model.
Theor. Comput. Sci., 2022

Chosen-ciphertext lattice-based public key encryption with equality test in standard model.
Theor. Comput. Sci., 2022

2021
Generating Residue Number System Bases.
Proceedings of the 28th IEEE Symposium on Computer Arithmetic, 2021

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

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

2019
Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices.
J. Math. Cryptol., 2019

Using Freivalds' Algorithm to Accelerate Lattice-Based Signature Verifications.
Proceedings of the Information Security Practice and Experience, 2019

Improving the Security of the DRS Scheme with Uniformly Chosen Random Noise.
Proceedings of the Information Security and Privacy - 24th Australasian Conference, 2019


  Loading...