Author:
Mahmoody Mohammad,Xiao David
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Capturing One-Way Functions via NP-Hardness of Meta-Complexity;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. On the Complexity of Compressing Obfuscation;Journal of Cryptology;2022-07
3. Average-case hardness of NP from exponential worst-case hardness assumptions;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
4. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23
5. Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing;Advances in Cryptology – EUROCRYPT 2019;2019