Searching for "The Knowledge Complexity of Interactive Proof Systems." – sorted by Relevance.
-
The knowledge complexity of interactive proof systems
- The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) Shafi Goldwasser Silvio
- Cited by 726 (28 self) – Add To MetaCart
-
Mclnnes, J., "Cryptography Using Weak Sources of Randomness," Tech. Report 194/87, U. of Toronto, 1987.
- Knowledge Complexity of Interactive Proof Systems," 'IAM J. on Cornpuling, Vol. 18, No. 1, 1989, pp. 186
- Add To MetaCart
-
Ranyi, A., (1970), Probability Theory, North-Holland, Ansterdan.
- , S. and Rackoff, C., "The Knowledge Complexity of Interactive Proof Systems," a preliminary version
- Add To MetaCart
-
Secure Computation (Preliminary Report)
- ,.ACKOFr, "The Knowledge Complexity of Interactive Proof Systems," SIAM J. of Comp., Vol. 18, No. 1, 186
- Add To MetaCart
-
Computational Complexity and Knowledge Complexity
- of their interactive proof systems [GMR-89]. The lowest level of the knowledge-complexity hierarchy is the class
- Cited by 5 (1 self) – Add To MetaCart
-
Computational Complexity and Knowledge Complexity
- of their interactive proof systems [GMR-89]. The lowest level of the knowledge-complexity hierarchy is the class
- Add To MetaCart
-
List of Publications Related to the Thesis
- . Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof-Systems. In Proc. 17th
- Add To MetaCart
-
On the Knowledge Complexity of ...
- of their interactive proof systems [GMR-89]. The class of knowledge complexity 0 (better known as zero knowledge
- Cited by 25 (8 self) – Add To MetaCart
-
On the Knowledge Complexity of NP
- , is to characterize languages according to the knowledge-complexity of their interactive proof systems [GMR-89
- Cited by 6 (3 self) – Add To MetaCart
-
A Complete Promise Problem for Statistical Zero-Knowledge
- we consider. All of the following definitions of knowledge complexity for interactive proof systems
- Cited by 28 (1 self) – Add To MetaCart

