Author:
Bellare Mihir,Goldreich Oded,Petrank Erez
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference25 articles.
1. Statistical zero-knowledge languages can be recognized in two rounds;Aiello;J. Comput. Syst. Sci.,1991
2. Non-deterministic exponential time has two-prover interactive protocols;Babai;Comput. Complexity,1992
3. On the role of shared randomness in two prover proof systems;Bellare,1995
4. The (true) complexity of statistical zero-knowledge;Bellare,1990
5. Making zero-knowledge efficient;Bellare,1992
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. On Sequential Functions and Fine-Grained Cryptography;Lecture Notes in Computer Science;2024
3. Extracting Randomness from Samplable Distributions, Revisited;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Model Counting Meets
F
0
Estimation;ACM Transactions on Database Systems;2023-08-09
5. On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02