Author:
Dey Debasmita,Biswas G. P.
Reference19 articles.
1. Burmester, M., Desmedt, Y., Beth, T.: Efficient zero-knowledge identification schemes for smart cards. Comput. J. 35(1), 21–29 (1992)
2. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186–208 (1989)
3. Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing. ACM (1986)
4. Brassard, G., Crepeau. C.: Non-transitive transfer of confidence: a perfect zero-knowledge interactive protocol for SAT and beyond. In: 27th Annual Symposium on Foundations of Computer Science (sfcs 1986). IEEE (1986)
5. Guillou, L.C., Quisquater, J.-J.: A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing both Transmission and Memory. Workshop on the Theory and Application of Cryptographic Techniques. Springer, Heidelberg (1988)