Author:
Chia Nai-Hui,Chung Kai-Min,Yamakawa Takashi
Publisher
Springer International Publishing
Reference51 articles.
1. Lecture Notes in Computer Science;G Alagic,2020
2. Lecture Notes in Computer Science;P Ananth,2020
3. Aharon, N., Regev, O.: Witness-preserving Amplification of QMA (lecture note) (2006). https://cims.nyu.edu/regev/teaching/quantum_fall_2005/ln/qma.pdf
4. Lecture Notes in Computer Science;G Brassard,1990
5. Brassard, G., Crépeau, C., Yung, M.: Constant-round perfect zero-knowledge computationally convincing protocols. Theor. Comput. Sci. 84(1), 23–52 (1991)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Efficient Quantum Parallel Repetition Theorem and Applications;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. A New Approach to Post-Quantum Non-Malleability;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Commitments to Quantum States;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. Post-Quantum Zero Knowledge, Revisited or: How to Do Quantum Rewinding Undetectably;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
5. On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Round;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02