VLDB 2026 Research / reviewers in the wild / expert
Victor Dyseryn
dblp:206/7136 · also Victor Dyseryn-Fostier
· DBLP profile ↗
9ranked-venue papers
0as first author
8since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 8 · 7 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Somewhat homomorphic encryption based on random codes
Carlos Aguilar Melchor, Victor Dyseryn, Philippe Gaborit |
Des. Codes Cryptogr. | 2 |
| 2024 | MinRank Gabidulin Encryption Scheme on Matrix Codes
Nicolas Aragon, Alain Couvreur, Victor Dyseryn, Philippe Gaborit, Adrien Vinçotte |
ASIACRYPT (4) | 3 |
| 2024 | The Blockwise Rank Syndrome Learning Problem and Its Applications to Cryptography
Nicolas Aragon, Pierre Briaud, Victor Dyseryn, Philippe Gaborit, Adrien Vinçotte |
PQCrypto (1) | 3 |
| 2024 | LowMS: a new rank metric code-based KEM without ideal structure
Nicolas Aragon, Victor Dyseryn, Philippe Gaborit, Pierre Loidreau, Julian Renner, Antonia Wachter-Zeh |
Des. Codes Cryptogr. | 2 |
| 2024 | PERK: compact signature scheme based on a new variant of the permuted kernel problem
Slim Bettaieb, Loïc Bidoux, Victor Dyseryn, Andre Esser 0001, Philippe Gaborit, Mukul Kulkarni, Marco Palumbi |
Des. Codes Cryptogr. | 3 |
| 2023 | Analysis of the Security of the PSSI Problem and Cryptanalysis of the Durandal Signature Scheme
Nicolas Aragon, Victor Dyseryn, Philippe Gaborit |
CRYPTO (3) | 2 |
| 2022 | LRPC Codes with Multiple Syndromes: Near Ideal-Size KEMs Without Ideals
Carlos Aguilar Melchor, Nicolas Aragon, Victor Dyseryn, Philippe Gaborit, Gilles Zémor |
PQCrypto | 3 |
| 2021 | Fast and Secure Key Generation for Low Rank Parity Check Codes CryptosystemsabstractAmong the candidates for NIST's post-quantum cryptography standardization project, cryptosystems that rely on Low Rank Parity Check (LRPC) codes have interesting properties, such as a low public key size. However, the key generation phase for these cryptosystems is computationally expensive when done in constant-time, which is a security requirement on the standardization project, making it almost unusable for ephemeral key generation. We present a new constant-time algorithm for key generation on LRPC code-based cryptosystems, that divides the computational costs by four when compared to previous work over ROLLO, one of the NIST candidates. Our improvement consists in changing the way objects of a quotient ring are represented. By switching from a canonical basis to an optimal normal basis, we enable the full potential of the Itoh-Tsuiji algorithm for field inversion. Carlos Aguilar Melchor, Nicolas Aragon, Victor Dyseryn, Philippe Gaborit |
ISIT | 3 |
| 2020 | Feasibility study of a camera-based PUF in a realistic scenarioabstractSupply chain management is critical in industrial efforts to reduce costs and time, stabilize product supply, and improve profitability. Surveillance cameras play a significant role in supply chain management, as they can record work activities to achieve appropriate monitoring of company operations. A solution for ensuring the reliability of the video taken by a surveillance camera is to achieve data integrity using a cryptographic algorithm. Another important solution is the identification of a surveillance camera to ensure the traceability of video. This paper proposes a novel approach for video-based fingerprint extraction and key generation, that can be used for camera PUF construction. Our experiment shows that a 256-bit key can be extracted from 50 frames of a normal video with a resolution of 800 X 600 pixels, and we theoretically prove that our methodology satisfies the randomness, uniqueness, steadiness, and unpredictability requirements. Our PUF construction can thus be used to identify a surveillance camera from a video. Kazuhide Fukushima, Thomas Perianin, Victor Dyseryn, Shinsaku Kiyomoto, Sylvain Guilley, Adrien Facon |
ARES | 3 |