On the communication complexity of zero-knowledge proofs-Reference-Cited by-同舟云学术

On the communication complexity of zero-knowledge proofs

Published:1993-06 Issue:2 Volume:6 Page:65-85
ISSN:0933-2790
Container-title:Journal of Cryptology
language:en
Short-container-title:J. Cryptology

Author:

Boyar Joan,Lund Carsten,Peralta René

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02620135.pdf

Reference20 articles.

1. L. Babai. Trading group theory for randomness. InProceedings of the 17th Annual ACM Symposium on the Theory of Computing, pp. 421–429, 1985.

2. Lecture Notes in Computer Science;J.C. Benaloh,1987

3. J. Boyar, G. Brassard, and R. Peralta. Subquadratic zero-knowledge. InProceedings of the 32nd IEEE Symposium on the Foundations of Computer Science, pp. 69–78, 1991.

4. J. Boyar, M. Krentel, and S. Kurtz. A discrete logarithm implementation of zero-knowledge blobs.Journal of Cryptology,2(2):63–76, 1990.

5. G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge.Journal of Computer and System Sciences,37:156–189, 1988.

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

1. References;Applied Cryptography, Second Edition;2015-10-09

2. Tight bounds for the multiplicative complexity of symmetric functions;Theoretical Computer Science;2008-05

3. Short Non-Interactive Cryptographic Proofs;Journal of Cryptology;2000-08-10

4. Practical proofs of knowledge without relying on theoretical proofs of membership on languages;Theoretical Computer Science;1997-07

5. A hidden cryptographic assumption in no-transferable indentification schemes;Lecture Notes in Computer Science;1996