default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWeiqiang Wen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Shi Bai, Hansraj Jangir, Hao Lin, Tran Ngo, Weiqiang Wen, Jinwei Zheng:
Compact Encryption Based on Module-NTRU Problems. PQCrypto (1) 2024: 371-405- [i16]Shi Bai, Hansraj Jangir, Hao Lin, Tran Ngo, Weiqiang Wen, Jinwei Zheng:
Compact Encryption based on Module-NTRU problems. IACR Cryptol. ePrint Arch. 2024: 732 (2024) - 2023
- [j2]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) - [c11]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 - [i15]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) - 2022
- [c10]Andre Esser, Alexander May, Javier A. Verbel, Weiqiang Wen:
Partial Key Exposure Attacks on BIKE, Rainbow and NTRU. CRYPTO (3) 2022: 346-375 - [c9]Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
Entropic Hardness of Module-LWE from Module-NTRU. INDOCRYPT 2022: 78-99 - [i14]Xingyu Yan, Licheng Wang, Weiqiang Wen, Ziyi Li, Jingwen Suo, Lize Gu:
Post-Quantum κ-to-1 Trapdoor Claw-free Functions from Extrapolated Dihedral Cosets. CoRR abs/2211.16993 (2022) - [i13]Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
Entropic Hardness of Module-LWE from Module-NTRU. IACR Cryptol. ePrint Arch. 2022: 245 (2022) - [i12]Andre Esser, Alexander May, Javier A. Verbel, Weiqiang Wen:
Partial Key Exposure Attacks on BIKE, Rainbow and NTRU. IACR Cryptol. ePrint Arch. 2022: 259 (2022) - [i11]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) - 2021
- [c8]Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
On the Hardness of Module-LWE with Binary Secret. CT-RSA 2021: 503-526 - [i10]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) - 2020
- [c7]Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
Towards Classical Hardness of Module-LWE: The Linear Rank Case. ASIACRYPT (2) 2020: 289-317 - [c6]Martin R. Albrecht, Shi Bai, Pierre-Alain Fouque, Paul Kirchner, Damien Stehlé, Weiqiang Wen:
Faster Enumeration-Based Lattice Reduction: Root Hermite Factor k1/(2k) Time kk/8+o(k). CRYPTO (2) 2020: 186-212 - [i9]Martin R. Albrecht, Shi Bai, Pierre-Alain Fouque, Paul Kirchner, Damien Stehlé, Weiqiang Wen:
Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k)). IACR Cryptol. ePrint Arch. 2020: 707 (2020) - [i8]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)
2010 – 2019
- 2019
- [c5]Shi Bai, Shaun Miller, Weiqiang Wen:
A Refined Analysis of the Cost for Solving LWE via uSVP. AFRICACRYPT 2019: 181-205 - [c4]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 - [i7]Shi Bai, Shaun Miller, Weiqiang Wen:
A refined analysis of the cost for solving LWE via uSVP. IACR Cryptol. ePrint Arch. 2019: 502 (2019) - [i6]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
- [b1]Weiqiang Wen:
Contributions to the hardness foundations of lattice-based cryptography. (Contributions aux fondements de complexité de la cryptographie sur réseaux). University of Lyon, France, 2018 - [c3]Shi Bai, Damien Stehlé, Weiqiang Wen:
Measuring, Simulating and Exploiting the Head Concavity Phenomenon in BKZ. ASIACRYPT (1) 2018: 369-404 - [c2]Zvika Brakerski, Elena Kirshanova, Damien Stehlé, Weiqiang Wen:
Learning with Errors and Extrapolated Dihedral Cosets. Public Key Cryptography (2) 2018: 702-727 - [i5]Shi Bai, Damien Stehlé, Weiqiang Wen:
Measuring, simulating and exploiting the head concavity phenomenon in BKZ. IACR Cryptol. ePrint Arch. 2018: 856 (2018) - 2017
- [i4]Zvika Brakerski, Elena Kirshanova, Damien Stehlé, Weiqiang Wen:
Learning With Errors and Extrapolated Dihedral Cosets. CoRR abs/1710.08223 (2017) - 2016
- [j1]Weiqiang Wen, Libin Wang, Jiaxin Pan:
Unified security model of authenticated key exchange with specific adversarial capabilities. IET Inf. Secur. 10(1): 8-17 (2016) - [c1]Shi Bai, Damien Stehlé, Weiqiang Wen:
Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices. ICALP 2016: 76:1-76:12 - [i3]Shi Bai, Damien Stehlé, Weiqiang Wen:
Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices. IACR Cryptol. ePrint Arch. 2016: 753 (2016) - 2014
- [i2]Weiqiang Wen, Libin Wang, Min Xie:
One-Round Deniable Key Exchange with Perfect Forward Security. IACR Cryptol. ePrint Arch. 2014: 661 (2014) - 2013
- [i1]Weiqiang Wen, Libin Wang, Jiaxin Pan:
A Unified Security Model of Authenticated Key Exchange with Specific Adversarial Capabilities. IACR Cryptol. ePrint Arch. 2013: 871 (2013)
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-06-20 21:33 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:
