| More efficient, provably-secure direct anonymous attestation from lattices N El Kassem, L Chen, R El Bansarkhani, A El Kaafarani, J Camenisch, ... Future Generation Computer Systems 99, 425-458, 2019 | 18 | 2019 |
| A lower bound for biases amongst products of two primes P Hough Research in Number Theory 3, 1-11, 2017 | 5 | 2017 |
| L-DAA: Lattice-Based Direct Anonymous Attestation. N El Kassem, L Chen, R El Bansarkhani, A El Kaafarani, J Camenisch, ... IACR Cryptol. ePrint Arch. 2018, 401, 2018 | 3 | 2018 |
| Lattice-based direct anonymous attestation (LDAA) NEL Kassem, L Chen, R El Bansarkhani, A El Kaafarani, J Camenisch, ... Cryptology ePrint Archive, 2018 | 2 | 2018 |
| Concrete NTRU Security and Advances in Practical Lattice-Based Electronic Voting. P Hough, C Sandsbråten, T Silde IACR Cryptol. ePrint Arch. 2023, 933, 2023 | 1 | 2023 |
| More Efficient Post-Quantum Electronic Voting from NTRU P Hough, C Sandsbråten, T Silde Cryptology ePrint Archive, 2023 | 1 | 2023 |
| Collaborative, Segregated NIZK (CoSNIZK) and More Efficient Lattice-Based Direct Anonymous Attestation L Chen, P Hough, N El Kassem Cryptology ePrint Archive, 2024 | | 2024 |
Liqun ChenProfessor, University of Surrey, UKVerified email at surrey.ac.uk
