Anyu Wang

Orcid: 0000-0002-1086-0288

Affiliations:
  • Tsinghua University, Institute for Advanced Study, Beijing, China
  • Chinese Academy of Sciences, Key Laboratory of Mathematics Mechanization, Beijing, China (PhD 2015)


According to our database1, Anyu Wang authored at least 23 papers between 2013 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast and Accurate: Efficient Full-Domain Functional Bootstrap and Digit Decomposition for Homomorphic Computation.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2024

Faster BGV Bootstrapping for Power-of-Two Cyclotomics through Homomorphic NTT.
IACR Cryptol. ePrint Arch., 2024

Accelerating BGV Bootstrapping for Large p Using Null Polynomials Over ℤ<sub>p<sup>e</sup></sub>.
IACR Cryptol. ePrint Arch., 2024

Approximate Methods for the Computation of Step Functions in Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2024

2023
Lattice-based cryptosystems in standardisation processes: A survey.
IET Inf. Secur., March, 2023

Exploring Decryption Failures of BIKE: New Class of Weak Keys and Key Recovery Attacks.
IACR Cryptol. ePrint Arch., 2023

Fast and Accurate: Efficient Full-Domain Functional Bootstrap and Digit Decomposition for Homomorphic Computation.
IACR Cryptol. ePrint Arch., 2023

Exploiting the Symmetry of ℤ<sup>n</sup>: Randomization and the Automorphism Problem.
IACR Cryptol. ePrint Arch., 2023

FigStep: Jailbreaking Large Vision-language Models via Typographic Visual Prompts.
CoRR, 2023

Exploiting the Symmetry of $\mathbb {Z}^n$: Randomization and the Automorphism Problem.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022
Mind the TWEAKEY Schedule: Cryptanalysis on SKINNYe-64-256.
IACR Cryptol. ePrint Arch., 2022

A Refinement of Key Mismatch Attack on NewHope.
Comput. J., 2022

2021
Optimizing Bootstrapping and Evaluating Large FHE Gates in the LWE-based GSW-FHE.
IACR Cryptol. ePrint Arch., 2021

2020
SCloud: Public Key Encryption and Key Encapsulation Mechanism Based on Learning with Errors.
IACR Cryptol. ePrint Arch., 2020

2019
Bounds for Binary Linear Locally Repairable Codes via a Sphere-Packing Approach.
IEEE Trans. Inf. Theory, 2019

2017
Bounds and constructions for linear locally repairable codes over binary fields.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Two classes of (r, t)-locally repairable codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
An Integer Programming-Based Bound for Locally Repairable Codes.
IEEE Trans. Inf. Theory, 2015

Achieving Arbitrary Locality and Availability in Binary Codes.
CoRR, 2015

Achieving arbitrary locality and availability in binary codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Repair Locality With Multiple Erasure Tolerance.
IEEE Trans. Inf. Theory, 2014

Repair locality from a combinatorial perspective.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Exact cooperative regenerating codes with minimum-repair-bandwidth for distributed storage.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013


  Loading...