Impossibility and Feasibility Results for Zero Knowledge with Public Keys-Reference-Cited by-同舟云学术

Impossibility and Feasibility Results for Zero Knowledge with Public Keys

Published:2005 Issue: Volume: Page:135-151
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2005
language:
Short-container-title:

Author:

Alwen Joël,Persiano Giuseppe,Visconti Ivan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11535218_9.pdf

Reference21 articles.

1. Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM J. on Computing 18, 186–208 (1989)

2. Dwork, C., Naor, M., Sahai, A.: Concurrent Zero-Knowledge. In: Proc. of STOC 1998, pp. 409–418. ACM, New York (1998)

3. Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable Zero-Knowledge. In: Proc. of STOC 2000, pp. 235–244. ACM, New York (2000)

4. Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-Box Concurrent Zero-Knowledge Requires ω(logn) Rounds. In: Proc. of STOC 2001, pp. 570–579. ACM, New York (2001)

5. Barak, B.: How to Go Beyond the Black-Box Simulation Barrier. In: Proc. of FOCS 2001, pp. 106–115 (2001)

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

1. Knowledge Encryption and Its Applications to Simulatable Protocols with Low Round-Complexity;Advances in Cryptology – ASIACRYPT 2022;2022

2. Smooth Zero-Knowledge Hash Functions;Lecture Notes in Computer Science;2021

3. Individual Simulations;Advances in Cryptology – ASIACRYPT 2020;2020

4. On Round-Optimal Zero Knowledge in the Bare Public-Key Model;Advances in Cryptology – EUROCRYPT 2012;2012

5. Simultaneously Resettable Arguments of Knowledge;Theory of Cryptography;2012