Paul Lou

Orcid: 0000-0002-8709-2205

According to our database1, Paul Lou authored at least 14 papers between 2017 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Quantum Advantage via Solving Multivariate Polynomials.
CoRR, September, 2025

Post-quantum PKE from Unstructured Noisy Linear Algebraic Assumptions: Beyond LWE and Alekhnovich's LPN.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Fully Anonymous Secret Sharing.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Relinearization Attack On LPN Over Large Fields.
Comput. J., 2024

Witness Semantic Security.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

2023
Hard Languages in $\mathsf{NP} \cap \mathsf{coNP}$ and NIZK Proofs from Unstructured Hardness.
IACR Cryptol. ePrint Arch., 2023

Hard Languages in $\text{NP}\cap\text{coNP}$ and NIZK Proofs from Unstructured Hardness.
Electron. Colloquium Comput. Complex., 2023

Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Polynomial-Time Cryptanalysis of the Subspace Flooding Assumption for Post-quantum i풪.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Computational Wiretap Coding from Indistinguishability Obfuscation.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Beyond the Csiszár-Korner Bound: Best-Possible Wiretap Coding via Obfuscation.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Efficient NIZKs from LWE via Polynomial Reconstruction and "MPC in the Head".
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
A Note on the Pseudorandomness of Low-Degree Polynomials over the Integers.
IACR Cryptol. ePrint Arch., 2021

2017
Post-quantum RSA.
Proceedings of the Post-Quantum Cryptography - 8th International Workshop, 2017


  Loading...