On the complexity of composite numbers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)
KeywordsQuadratic Residue Constant Move Real Interaction Interactive Proof Fourth Root
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- Adleman, L.M. and Huang, M.D.A., “Recognizing Primes in Random Polynomial Time,” Proc. of STOC, pp.462–469 (1987).Google Scholar
- Aiello, W. and Håstad, J., “Statistical Zero-Knowledge Languages Can Be Recognized in Two Rounds,” JCSS, Vol. 42, No.3, pp. 327–345 (1991).Google Scholar
- Babai, L. and Moran, S., “Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes,” JCSS, Vol. 36, No.2, pp. 254–276 (1988).Google Scholar
- Bellare, M., Micali, S., and Ostrovsky, R., “Perfect Zero-Knowledge in Constant Rounds,” Proc. of STOC, pp.482–493 (1990).Google Scholar
- Fortnow, L., The Complexity of Perfect Zero-Knowledge,” Proc. of STOC, pp.204–209 (1987).Google Scholar
- Goldreich, O. and Krawczyk, H., “On the Composition of Zero-Knowledge Proof Systems,” Proc. of ICALP'90, LNCS 443, Springer-Verlag, Berlin, pp. 268–282 (1990).Google Scholar
- Goldreich, O. and Oren, Y., “Definitions and Properties of Zero-Knowledge Proof Systems,” Tech. Rep. #610, Technion, Department of Computer Science (1990).Google Scholar
- Tompa, M. and Woll, H., “Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information,” Proc. of FOCS, pp.472–482 (1987).Google Scholar
© Springer-Verlag Berlin Heidelberg 1992