1 citations · 3 across the 11 of their papers we have counts for
Showing 2024 · cs.CRShow all
3 papers · 2 filters
cs.CR2024
Linearly Homomorphic Signature with Tight Security on Lattice
Heng Guo, Fengxia Liu, Kun Tian +1
Constructing cryptographic schemes with tight or almost-tight security has long been one of the central problems in theoretical cryptography. At ASIACRYPT 2016, Boyen and Li posed…
cs.CR2024
On the MacWilliams Theorem over Codes and Lattices
Zhiyong Zheng, Fengxia Liu, Kun Tian
Analogies between codes and lattices have been extensively studied for the last decades, in this dictionary, the MacWilliams identity is the finite analog of the Jacobi-Poisson for…
cs.CR2024★ 1 cited
Towards Quantum-Safe Federated Learning via Homomorphic Encryption: Learning with Gradients
Guangfeng Yan, Shanxiang Lyu, Hanxu Hou +2
This paper introduces a privacy-preserving distributed learning framework via private-key homomorphic encryption. Thanks to the randomness of the quantization of gradients, our lea…