Publisher
Springer Berlin Heidelberg
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Nearly Optimal Pseudorandomness from Hardness;Journal of the ACM;2022-11-17
2. Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge);Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
3. Nearly Optimal Pseudorandomness From Hardness;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
4. Polylog depth, highness and lowness for E;Information and Computation;2020-04
5. Bibliography;Theory of Computational Complexity;2013-12-06