default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdeline Roux-Langlois
- > Home > Persons > Adeline Roux-Langlois
Publications
- 2024
[j5]Katharina Boudgoust
, Adeline Roux-Langlois:
Overfull: Too Large Aggregate Signatures Based on Lattices. Comput. J. 67(2): 719-727 (2024)- [c22]Corentin Jeudy, Adeline Roux-Langlois, Olivier Sanders:
Phoenix: Hash-and-Sign with Aborts from Lattice Gadgets. PQCrypto (1) 2024: 265-299 - [i21]Sven Argo, Tim Güneysu, Corentin Jeudy, Georg Land, Adeline Roux-Langlois, Olivier Sanders:
Practical Post-Quantum Signatures for Privacy. IACR Cryptol. ePrint Arch. 2024: 131 (2024) - 2023
- [j4]Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
On the Hardness of Module Learning with Errors with Short Distributions. J. Cryptol. 36(1): 1 (2023) - [c21]Malika Izabachène, Lucas Prabel, Adeline Roux-Langlois:
Identity-Based Encryption from Lattices Using Approximate Trapdoors. ACISP 2023: 270-290 - [c20]Corentin Jeudy, Adeline Roux-Langlois, Olivier Sanders:
Lattice Signature with Efficient Protocols, Application to Anonymous Credentials. CRYPTO (2) 2023: 351-383 - [c19]Pierre-Alain Fouque, Adela Georgescu, Chen Qian, Adeline Roux-Langlois, Weiqiang Wen:
A Generic Transform from Multi-round Interactive Proof to NIZK. Public Key Cryptography (2) 2023: 461-481 - [i20]Pierre-Alain Fouque, Adela Georgescu, Chen Qian, Adeline Roux-Langlois, Weiqiang Wen:
A Generic Transform from Multi-Round Interactive Proof to NIZK. IACR Cryptol. ePrint Arch. 2023: 334 (2023) - [i19]Corentin Jeudy, Adeline Roux-Langlois, Olivier Sanders:
Revisiting Preimage Sampling for Lattices. IACR Cryptol. ePrint Arch. 2023: 446 (2023) - [i18]Loris Bergerat, Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, Adeline Roux-Langlois, Samuel Tap:
Faster Secret Keys for (T)FHE. IACR Cryptol. ePrint Arch. 2023: 979 (2023) - 2022
- [c18]Olivier Bernard, Andrea Lesavourey, Tuong-Huy Nguyen, Adeline Roux-Langlois:
Log-S-unit Lattices Using Explicit Stickelberger Generators to Solve Approx Ideal-SVP. ASIACRYPT (3) 2022: 677-708 - [c17]Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
Entropic Hardness of Module-LWE from Module-NTRU. INDOCRYPT 2022: 78-99 - [i17]Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
Entropic Hardness of Module-LWE from Module-NTRU. IACR Cryptol. ePrint Arch. 2022: 245 (2022) - [i16]Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
On the Hardness of Module Learning With Errors with Short Distributions. IACR Cryptol. ePrint Arch. 2022: 472 (2022) - [i15]Corentin Jeudy, Adeline Roux-Langlois, Olivier Sanders:
Lattice-Based Signature with Efficient Protocols, Revisited. IACR Cryptol. ePrint Arch. 2022: 509 (2022) - 2021
- [c16]Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
On the Hardness of Module-LWE with Binary Secret. CT-RSA 2021: 503-526 - [c15]Guillaume Kaim, Sébastien Canard, Adeline Roux-Langlois, Jacques Traoré:
Post-quantum Online Voting Scheme. Financial Cryptography Workshops 2021: 290-305 - [c14]Pauline Bert, Gautier Eberhart, Lucas Prabel, Adeline Roux-Langlois, Mohamed Sabt:
Implementation of Lattice Trapdoors on Modules and Applications. PQCrypto 2021: 195-214 - [i14]Katharina Boudgoust, Adeline Roux-Langlois:
Compressed Linear Aggregate Signatures Based on Module Lattices. IACR Cryptol. ePrint Arch. 2021: 263 (2021) - [i13]Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
On the Hardness of Module-LWE with Binary Secret. IACR Cryptol. ePrint Arch. 2021: 265 (2021) - [i12]Olivier Bernard, Andrea Lesavourey, Tuong-Huy Nguyen, Adeline Roux-Langlois:
Log-S-unit lattices using Explicit Stickelberger Generators to solve Approx Ideal-SVP. IACR Cryptol. ePrint Arch. 2021: 1384 (2021) - 2020
- [c13]Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
Towards Classical Hardness of Module-LWE: The Linear Rank Case. ASIACRYPT (2) 2020: 289-317 - [c12]Olivier Bernard, Adeline Roux-Langlois:
Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices. ASIACRYPT (2) 2020: 349-380 - [c11]Sébastien Canard, Adela Georgescu, Guillaume Kaim, Adeline Roux-Langlois, Jacques Traoré:
Constant-Size Lattice-Based Group Signature with Forward Security in the Standard Model. ProvSec 2020: 24-44 - [i11]Samuel Bouaziz-Ermann, Sébastien Canard, Gautier Eberhart, Guillaume Kaim, Adeline Roux-Langlois, Jacques Traoré:
Lattice-based (Partially) Blind Signature without Restart. IACR Cryptol. ePrint Arch. 2020: 260 (2020) - [i10]Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
Towards Classical Hardness of Module-LWE: The Linear Rank Case. IACR Cryptol. ePrint Arch. 2020: 1020 (2020) - [i9]Olivier Bernard, Adeline Roux-Langlois:
Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices. IACR Cryptol. ePrint Arch. 2020: 1081 (2020) - 2019
- [c10]Shi Bai, Katharina Boudgoust, Dipayan Das, Adeline Roux-Langlois, Weiqiang Wen, Zhenfei Zhang:
Middle-Product Learning with Rounding Problem and Its Applications. ASIACRYPT (1) 2019: 55-81 - [i8]Shi Bai, Katharina Boudgoust, Dipayan Das, Adeline Roux-Langlois, Weiqiang Wen, Zhenfei Zhang:
Middle-Product Learning with Rounding Problem and its Applications. IACR Cryptol. ePrint Arch. 2019: 1001 (2019) - 2018
- [j3]Shi Bai, Tancrède Lepoint, Adeline Roux-Langlois, Amin Sakzad, Damien Stehlé, Ron Steinfeld:
Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance. J. Cryptol. 31(2): 610-640 (2018) - [j2]San Ling, Khoa Nguyen, Adeline Roux-Langlois, Huaxiong Wang:
A lattice-based group signature scheme with verifier-local revocation. Theor. Comput. Sci. 730: 1-20 (2018) - [c9]Pauline Bert, Adeline Roux-Langlois:
From Identification Using Rejection Sampling to Signatures via the Fiat-Shamir Transform: Application to the BLISS Signature. IWSEC 2018: 297-312 - [c8]Pauline Bert, Pierre-Alain Fouque, Adeline Roux-Langlois, Mohamed Sabt:
Practical Implementation of Ring-SIS/LWE Based Signature and IBE. PQCrypto 2018: 271-291 - 2017
- [c7]Guillaume Bonnoron, Caroline Fontaine, Guy Gogniat, Vincent Herbert, Vianney Lapôtre, Vincent Migliore, Adeline Roux-Langlois:
Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges. C2SI 2017: 68-82 - 2015
- [j1]Adeline Langlois, Damien Stehlé:
Worst-case to average-case reductions for module lattices. Des. Codes Cryptogr. 75(3): 565-599 (2015) - [c6]Shi Bai, Adeline Langlois, Tancrède Lepoint, Damien Stehlé, Ron Steinfeld:
Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance. ASIACRYPT (1) 2015: 3-24 - [c5]Martin R. Albrecht, Catalin Cocis, Fabien Laguillaumie, Adeline Langlois:
Implementing Candidate Graded Encoding Schemes from Ideal Lattices. ASIACRYPT (2) 2015: 752-775 - [i7]Shi Bai, Adeline Langlois, Tancrède Lepoint, Damien Stehlé, Ron Steinfeld:
Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance. IACR Cryptol. ePrint Arch. 2015: 483 (2015) - 2014
- [c4]Adeline Langlois, Damien Stehlé, Ron Steinfeld:
GGHLite: More Efficient Multilinear Maps from Ideal Lattices. EUROCRYPT 2014: 239-256 - [c3]Adeline Langlois, San Ling, Khoa Nguyen, Huaxiong Wang:
Lattice-Based Group Signature Scheme with Verifier-Local Revocation. Public Key Cryptography 2014: 345-361 - [i6]Adeline Langlois, San Ling, Khoa Nguyen, Huaxiong Wang:
Lattice-based Group Signature Scheme with Verifier-local Revocation. IACR Cryptol. ePrint Arch. 2014: 33 (2014) - [i5]Adeline Langlois, Damien Stehlé, Ron Steinfeld:
GGHLite: More Efficient Multilinear Maps from Ideal Lattices. IACR Cryptol. ePrint Arch. 2014: 487 (2014) - [i4]Martin R. Albrecht, Catalin Cocis, Fabien Laguillaumie, Adeline Langlois:
Improved Parameters and an Implementation of Graded Encoding Schemes from Ideal Lattices. IACR Cryptol. ePrint Arch. 2014: 928 (2014) - 2013
- [c2]Fabien Laguillaumie, Adeline Langlois, Benoît Libert, Damien Stehlé:
Lattice-Based Group Signatures with Logarithmic Signature Size. ASIACRYPT (2) 2013: 41-61 - [c1]Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, Damien Stehlé:
Classical hardness of learning with errors. STOC 2013: 575-584 - [i3]Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, Damien Stehlé:
Classical Hardness of Learning with Errors. CoRR abs/1306.0281 (2013) - [i2]Fabien Laguillaumie, Adeline Langlois, Benoît Libert, Damien Stehlé:
Lattice-Based Group Signatures with Logarithmic Signature Size. IACR Cryptol. ePrint Arch. 2013: 308 (2013) - 2012
- [i1]Adeline Langlois, Damien Stehlé:
Worst-Case to Average-Case Reductions for Module Lattices. IACR Cryptol. ePrint Arch. 2012: 90 (2012)
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-07-05 20:13 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:
