Zero Knowledge Proofs of Knowledge in Two Rounds-Reference-Cited by-同舟云学术

Zero Knowledge Proofs of Knowledge in Two Rounds

Published: Issue: Volume: Page:526-544
ISSN:
Container-title:Advances in Cryptology — CRYPTO’ 89 Proceedings
language:
Short-container-title:

Author:

Feige U.,Shamir A.

Publisher

Springer New York

Link

http://link.springer.com/content/pdf/10.1007/0-387-34805-0_46.pdf

Reference23 articles.

1. M. Abadi, E. Allender, A. Broder, J. Feigenbaum, L. Hemachandra, On Generating Solved Instances of Computational Problems Proc. of CRYPTO88.

2. D. Angluin, D. Lichtenstein, Provable Security of Cryptosystems: a Survey TR-288, Yale University, 1983.

3. M. Blum, How to Prove a Theorem So No One Else Can Claim It Proc. of the International Congress of Mathematicians, Berkeley, California, USA, 1986, pp. 1444–1451.

4. M. Blum, P. Feldman, S. Micali, Non-Interactive Zero-Knowledge and its Applications Proc. of 20th STOC 1988, pp. 103–112.

5. G. Brassard, D. Chaum, C. Crépeau, Minimum Disclosure Proofs of Knowledge JCSS, Vol. 37, 1988, pp. 156–189.

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

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

2. Auditable Attribute-Based Credentials Scheme and Its Application in Contact Tracing;Lecture Notes in Computer Science;2024

3. Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance;Journal of Cryptology;2022-05-04

4. 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

5. Zero-Knowledge-Verfahren;Moderne Verfahren der Kryptographie;2022