default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnaud Sipasseuth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j7]Jean-Claude Bajard
, Kazuhide Fukushima, Thomas Plantard, Arnaud Sipasseuth:
Fast verification and public key storage optimization for unstructured lattice-based signatures. J. Cryptogr. Eng. 13(3): 373-388 (2023)- 2022
- [j6]Dung Hoang Duong, Partha Sarathi Roy, Willy Susilo, Kazuhide Fukushima, Shinsaku Kiyomoto, Arnaud Sipasseuth:
Chosen-ciphertext lattice-based public key encryption with equality test in standard model. Theor. Comput. Sci. 905: 31-53 (2022) - [j5]Partha Sarathi Roy, Dung Hoang Duong, Willy Susilo, Arnaud Sipasseuth, Kazuhide Fukushima, Shinsaku Kiyomoto:
Lattice-based public-key encryption with equality test supporting flexible authorization in standard model. Theor. Comput. Sci. 929: 124-139 (2022) - [j4]Jean-Claude Bajard, Kazuhide Fukushima, Thomas Plantard, Arnaud Sipasseuth:
Generating Very Large RNS Bases. IEEE Trans. Emerg. Top. Comput. 10(3): 1289-1301 (2022) - [j3]Thomas Plantard, Arnaud Sipasseuth, Willy Susilo, Vincent Zucca:
Tight Bound on NewHope Failure Probability. IEEE Trans. Emerg. Top. Comput. 10(4): 1955-1965 (2022) - 2020
- [j2]Arnaud Sipasseuth, Thomas Plantard, Willy Susilo:
A Noise Study of the PSW Signature Family: Patching DRS with Uniform Distribution †. Inf. 11(3): 133 (2020) - 2019
- [j1]Arnaud Sipasseuth, Thomas Plantard, Willy Susilo:
Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices. J. Math. Cryptol. 13(3-4): 169-196 (2019)
Conference and Workshop Papers
- 2024
- [c5]Arnaud Sipasseuth:
Faster Verifications and Smaller Signatures: Trade-Offs for ALTEQ Using Rejections. ACISP (2) 2024: 144-163 - 2022
- [c4]Jean-Claude Bajard, Kazuhide Fukushima, Thomas Plantard, Arnaud Sipasseuth:
Generating Very Large RNS Bases. ARITH 2022: 102 - 2021
- [c3]Jean-Claude Bajard, Kazuhide Fukushima, Shinsaku Kiyomoto, Thomas Plantard, Arnaud Sipasseuth, Willy Susilo:
Generating Residue Number System Bases. ARITH 2021: 86-93 - 2019
- [c2]Arnaud Sipasseuth, Thomas Plantard, Willy Susilo:
Improving the Security of the DRS Scheme with Uniformly Chosen Random Noise. ACISP 2019: 119-137 - [c1]Arnaud Sipasseuth, Thomas Plantard, Willy Susilo:
Using Freivalds' Algorithm to Accelerate Lattice-Based Signature Verifications. ISPEC 2019: 401-412
Informal and Other Publications
- 2024
- [i5]Arnaud Sipasseuth:
Faster verifications and smaller signatures: Trade-offs for ALTEQ using rejections. IACR Cryptol. ePrint Arch. 2024: 815 (2024) - [i4]Arnaud Sipasseuth:
DVA: Dangerous Variations of ALTEQ. IACR Cryptol. ePrint Arch. 2024: 817 (2024) - 2020
- [i3]Dung Hoang Duong, Partha Sarathi Roy, Willy Susilo, Kazuhide Fukushima, Shinsaku Kiyomoto, Arnaud Sipasseuth:
Lattice-based public key encryption with equality test in standard model, revisited. CoRR abs/2005.03178 (2020) - [i2]Dung Hoang Duong, Kazuhide Fukushima, Shinsaku Kiyomoto, Partha Sarathi Roy, Arnaud Sipasseuth, Willy Susilo:
Lattice-based public key encryption with equality test supporting flexible authorization in standard model. CoRR abs/2005.05308 (2020) - 2019
- [i1]Thomas Plantard, Arnaud Sipasseuth, Willy Susilo, Vincent Zucca:
Tight bound on NewHope failure probability. IACR Cryptol. ePrint Arch. 2019: 1451 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
