Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model-Reference-Cited by-同舟云学术

Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model

Published: Issue: Volume: Page:501-534
ISSN:
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Chailloux André,Ciocan Dragos Florin,Kerenidis Iordanis,Vadhan Salil

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-78524-8_28.pdf

Reference44 articles.

1. Chailloux, A., Kerenidis, I.: The role of help in classical and quantum zero-knowledge. Cryptology ePrint Archive, Report 2007/421 (2007), http://eprint.iacr.org/

2. Ciocan, D.F., Vadhan, S.: Interactive and noninteractive zero knowledge coincide in the help model. Cryptology ePrint Archive, Report 2007/389 (2007), http://eprint.iacr.org/

3. Ciocan, D.: Constructions and characterizations of non-interactive zero-knowledge. Undergradute thesis, Harvard University (2007)

4. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing 18(1), 186–208 (1989)

5. Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: STOC 1988: Proceedings of the twentieth annual ACM symposium on Theory of computing, pp. 103–112 (1988)

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

1. QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge;SIAM Journal on Computing;2022-08

2. Certified Everlasting Zero-Knowledge Proof for QMA;Advances in Cryptology – CRYPTO 2022;2022

3. Oblivious Transfer from Trapdoor Permutations in Minimal Rounds;Theory of Cryptography;2021

4. QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11

5. Secure Quantum Extraction Protocols;Theory of Cryptography;2020