Valiant’s universal circuits revisited: an overall improvement and a lower bound S Zhao, Y Yu, J Zhang, H Liu
International Conference on the Theory and Application of Cryptology and …, 2019
23 2019 The hardness of LPN over any integer ring and field for PCG applications H Liu, X Wang, K Yang, Y Yu
Annual International Conference on the Theory and Applications of …, 2024
15 2024 Pushing the limits of valiant’s universal circuits: simpler, tighter and more compact H Liu, Y Yu, S Zhao, J Zhang, W Liu, Z Hu
Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021
14 2021 Pushing the Limits of Valiant's Universal Circuits: Simpler, Tighter and More Compact H Liu, Y Yu, S Zhao, J Zhang, W Liu, Z Hu
Cryptology ePrint Archive, 2020
6 2020 H Cui, H Liu, D Yan, K Yang, Y Yu, K Zhang
IACR International Conference on Public-Key Cryptography, 229-258, 2024
5 2024 Learning parity with physical noise: Imperfections, reductions and fpga prototype D Bellizia, C Hoffmann, D Kamel, H Liu, P Méaux, FX Standaert, Y Yu
IACR Transactions on Cryptographic Hardware and Embedded Systems, 390-417, 2021
5 2021 A non-heuristic approach to time-space tradeoffs and optimizations for BKW H Liu, Y Yu
International Conference on the Theory and Application of Cryptology and …, 2022
4 2022 基于格的后量子密钥交换研究 刘亚敏， 李祥学， 刘晗林
密码学报 4 (5), 485-497, 2017
1 2017 On the Hardness of Sparsely Learning Parity with Noise D Yan, H Liu, S Zhao, Y Yu
The Computer Journal 65 (8), 1939-1947, 2022
2022 An improved algorithm for learning sparse parities in the presence of noise D Yan, Y Yu, H Liu, S Zhao, J Zhang
Theoretical Computer Science 873, 76-86, 2021
2021 稀疏 LPN 问题的困难性研究 刘晗林
上海交通大学, 2018
2018 On the Hardness of Sparsely Learning Parity with Noise H Liu, D Yan, Y Yu, S Zhao
Provable Security: 11th International Conference, ProvSec 2017, Xi'an, China …, 2017
2017 