An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge-Reference-Cited by-同舟云学术

An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge

Published:2018 Issue: Volume: Page:66-87
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2018
language:
Short-container-title:

Author:

Hubáček Pavel,Rosen Alon,Vald Margarita

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-319-78372-7_3

Reference17 articles.

1. Aiello, W., Håstad, J.: Statistical zero-knowledge languages can be recognized in two rounds. J. Comput. Syst. Sci. 42(3), 327–345 (1991)

2. Bellare, M., Micali, S., Ostrovsky, R.: Perfect zero-knowledge in constant rounds. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 13–17 May 1990, Baltimore, Maryland, USA, pp. 482–493 (1990)

3. Bellare, M., Micali, S., Ostrovsky, R.: The (true) complexity of statistical zero knowledge. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 13–17 May 1990, Baltimore, Maryland, USA, pp. 494–502 (1990)

4. Lecture Notes in Computer Science;IB Damgård,1994

5. Damgård, I., Goldreich, O., Wigderson, A.: Hashing functions can simplify zero-knowledge protocol design(too). Technical report RS94-39, BRICS, November 1994

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

1. Batch Proofs Are Statistically Hiding;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. One-Way Functions and (Im)perfect Obfuscation;SIAM Journal on Computing;2022-12-20

3. An identification system based on the explicit isomorphism problem;Applicable Algebra in Engineering, Communication and Computing;2021-10-19

4. Public-Coin Statistical Zero-Knowledge Batch Verification Against Malicious Verifiers;Lecture Notes in Computer Science;2021