On the Concurrent Composition of Quantum Zero-Knowledge-Reference-Cited by-同舟云学术

On the Concurrent Composition of Quantum Zero-Knowledge

Published:2021 Issue: Volume: Page:346-374
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2021
language:
Short-container-title:

Author:

Ananth Prabhanjan,Chung Kai-Min,Placa Rolando L. La

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-84242-0_13

Reference38 articles.

1. Agarwal, A., Bartusek, J., Goyal, V., Khurana, D., Malavolta, G.: Post-quantum multi-party computation in constant rounds. arXiv preprint arXiv:2005.12904 (2020)

2. Lecture Notes in Computer Science;P Ananth,2020

3. Ambainis, A., Rosmanis, A., Unruh, D.: Quantum attacks on classical proof systems: the hardness of quantum rewinding. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp. 474–483. IEEE (2014)

4. Broadbent, A., Grilo, A.B.: Zero-knowledge for QMA from locally simulatable proofs. arXiv preprint arXiv:1911.07782 (2019)

5. Broadbent, A., Ji, Z., Song, F., Watrous, J.: Zero-knowledge proof systems for QMA. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 31–40. IEEE (2016)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Concurrent Multi-party Quantum Computation;Advances in Cryptology – CRYPTO 2023;2023

2. On the Impossibility of Key Agreements from Quantum Random Oracles;Advances in Cryptology – CRYPTO 2022;2022

3. Post-quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round;Advances in Cryptology – CRYPTO 2022;2022