Author:
Caballero-Gil Pino,Hernández-Goya Candelaria
Publisher
Springer Berlin Heidelberg
Reference4 articles.
1. Garey, M., Johnson, D., Computers and Intractability, Freeman and Company (1979).
2. Goldreich, O., Modern Cryptography, Probabilistic Proofs and Pseudo-randomness. Springer (1999)
3. Goldreich, O., Micali, S., Wigderson, A., Howto Prove All NP Statements in Zero-Knowledge and a Methodology of Cryptographic Protocol Design, Advances in Cryptology-CRYPTO’ 86, 171. Springer-Verlag (1986)
4. Goldwasser, S., Micali, S., Rackoff, C., The knowledge complexity of interactive proof systems, SIAM Journal on Computing, 18, 186–208 (1989)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献