Weiqiang Wen

Orcid: 0000-0001-5272-2572

According to our database1, Weiqiang Wen authored at least 22 papers between 2013 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Generic Construction of Threshold Ring Signatures and Lattice-based Instantiations.
IACR Cryptol. ePrint Arch., 2025

Hardness of M-LWE with General Distributions and Applications to Leaky Variants.
IACR Cryptol. ePrint Arch., 2025

2024
Zero-Knowledge Proofs of Quantumness.
IACR Commun. Cryptol., 2024

Compact Encryption Based on Module-NTRU Problems.
Proceedings of the Post-Quantum Cryptography - 15th International Workshop, 2024

Adaptive Hardcore Bit and Quantum Key Leasing over Classical Channel from LWE with Polynomial Modulus.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
A Generic Transform from Multi-round Interactive Proof to NIZK.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

2022
On the Hardness of Module Learning With Errors with Short Distributions.
IACR Cryptol. ePrint Arch., 2022

Post-Quantum κ-to-1 Trapdoor Claw-free Functions from Extrapolated Dihedral Cosets.
CoRR, 2022

Entropic Hardness of Module-LWE from Module-NTRU.
Proceedings of the Progress in Cryptology - INDOCRYPT 2022, 2022

Partial Key Exposure Attacks on BIKE, Rainbow and NTRU.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
On the Hardness of Module-LWE with Binary Secret.
Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021

2020
Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k)).
IACR Cryptol. ePrint Arch., 2020

Faster Enumeration-Based Lattice Reduction: Root Hermite Factor k<sup>1/(2k)</sup> Time k<sup>k/8+o(k)</sup>.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Towards Classical Hardness of Module-LWE: The Linear Rank Case.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
Middle-Product Learning with Rounding Problem and Its Applications.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

A Refined Analysis of the Cost for Solving LWE via uSVP.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2019, 2019

2018
Contributions to the hardness foundations of lattice-based cryptography. (Contributions aux fondements de complexité de la cryptographie sur réseaux).
PhD thesis, 2018

Learning with Errors and Extrapolated Dihedral Cosets.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Measuring, Simulating and Exploiting the Head Concavity Phenomenon in BKZ.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2016
Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2014
One-Round Deniable Key Exchange with Perfect Forward Security.
IACR Cryptol. ePrint Arch., 2014

2013
A Unified Security Model of Authenticated Key Exchange with Specific Adversarial Capabilities.
IACR Cryptol. ePrint Arch., 2013


  Loading...