Anyu Wang
Orcid: 0000-0002-1086-0288Affiliations:
- 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 30 papers
between 2013 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2014
2016
2018
2020
2022
2024
0
5
10
8
5
2
1
1
1
2
1
3
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
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
IACR Cryptol. ePrint Arch., 2024
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
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
JailbreakEval: An Integrated Toolkit for Evaluating Jailbreak Attempts Against Large Language Models.
CoRR, 2024
Have You Merged My Model? On The Robustness of Large Language Model IP Protection Methods Against Model Merging.
Proceedings of the 1st ACM Workshop on Large AI Systems and Models with Privacy and Safety Analysis, 2024
Accelerating BGV Bootstrapping for Large p Using Null Polynomials over $\mathbb {Z}_{p^e}$.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024
2023
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
CoRR, 2023
Exploiting the Symmetry of $\mathbb {Z}^n$: Randomization and the Automorphism Problem.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023
2022
IACR Cryptol. ePrint Arch., 2022
2021
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
IEEE Trans. Inf. Theory, 2019
2017
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017
2016
Proceedings of the IEEE International Symposium on Information Theory, 2016
2015
IEEE Trans. Inf. Theory, 2015
Proceedings of the IEEE International Symposium on Information Theory, 2015
2014
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