S. Goldwasser, S. Micali and C. Rackoff, "The knowledge complexity of interactive proof systems," SIAM J. of Comp., Vol. 18, No. 1, pp. 186--208, February 1989. 15 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Resettable Zero-Knowledge - Canetti, Goldreich, Goldwasser.. (2000) (22 citations) Self-citation (Goldwasser Micali) (Correct)
No context found.
S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput., Vol. 18, No. 1, pp. 186--208, 1989.
Appears in the proceedings of the First ACM Conference on.. - Random Oracles Are (Correct)
No context found.
S. Goldwasser, S. Micali and C. Rackoff, "The knowledge complexity of interactive proof systems," SIAM J. of Comp., Vol. 18, No. 1, pp. 186--208, February 1989. 15
On the Role of Definitions in and Beyond Cryptography - Phillip Rogaway Dept (Correct)
No context found.
S. Goldwasser, S. Micali, and C. Racko#. The knowledge complexity of interactive proof systems. SIAM J. on Computing, vol. 18, no. 1, pp. 186--208, 1989.
Software Protection - And Simulation On (Correct)
No context found.
S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, STOC 1985.
Concurrent Statistical Zero-Knowledge Arguments - For Np From (Correct)
No context found.
Shafi Goldwasser, Silvio Micali, and Charles Racko#. The knowledge complexity of interactive proof systems. SIAM J. Comput., 18(1):186--208, 1989.
Universally Composable Security with Global Setup - Ran Canetti Yevgeniy (Correct)
No context found.
S. Goldwasser, S. Micali, C. Racko#. The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computation, 18(1):186--208, 1989.
On Probabilistic versus Deterministic Provers - In The Definition (2006) (Correct)
No context found.
S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing, Vol. 18, pages 186--208, 1989.
Testing Disjointness of Private Datasets - Aggelos Kiayias And (2005) (2 citations) (Correct)
No context found.
Shafi Goldwasser, Silvio Micali and Charles Racko#, The Knowledge Complexity of Interactive Proof Systems SIAM J. Comput. 18(1): 186-208 (1989)
Anonymous Identification in Ad Hoc Groups - Yevgeniy Dodis Aggelos (2004) (11 citations) (Correct)
No context found.
S. Goldwasser, S. Micali, and C. Racko#. The knowledge complexity of interactive proof systems. SIAM Journal on computing, 18(1):186--208, 1989.
Information-Theoretic Conditions for - Two-Party Secure Function (2006) (Correct)
No context found.
S. Goldwasser, S. Micali, and C. Racko#. The knowledge complexity of interactive proof systems. SIAM J. Comput., 18(1):186--208, 1989.
Logical Concepts in Cryptography - Kramer (2006) (Correct)
No context found.
Goldwasser, S., Micali, S., Racko#, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing 18(1) (1989)
On Expected Probabilistic Polynomial-Time Adversaries: - Suggestion For Restricted (2006) (Correct)
No context found.
S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing, Vol. 18, pages 186--208, 1989. Preliminary version in 17th STOC, 1985.
Resettable Zero Knowledge in the Bare Public-Key Model under.. - Deng, Lin (2006) (Correct)
No context found.
S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM. J. Computing, 18(1):186-208, February 1989.
Statistical Zero-Knowledge Arguments for NP - From Any One-Way (2006) (Correct)
No context found.
Shafi Goldwasser, Silvio Micali, and Charles Racko#. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186--208, 1989.
The Probability Advantages of Two Linear Expressions in.. - Haina Zhang Shaohui (2006) (Correct)
No context found.
S. Goldwasser, S. Micali, C.Racko#, The Knowledge Complexity of Interactive Proof-Systems, SIAM Journal on Comput., Vol. 18, No. 1, 1989.
Zero-knowledge-like Proof of Cryptanalysis of - Bluetooth Encryption Eric (2006) (Correct)
No context found.
Goldwasser S., Micali S. and Racko# C. (1989), "The Knowledgecomplexity of Interactive Proof Systems", SIAM Journal on Computing, Vol. 18, pp. 186--208.
Concurrently Non-Malleable Zero Knowledge in the.. - Deng, Di Crescenzo, Lin (2006) (Correct)
No context found.
S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM. J. Computing, 18(1):186-208, February 1989.
Cryptographic Voting Protocols: A Systems Perspective - Chris Karlof Naveen (2005) (1 citation) (Correct)
No context found.
Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof systems. In SIAM Journal on Computing, volume 18, pages 270-- 299, 1984.
Technical Reports on Mathematical and Computing Sciences.. - Title The Complexity (Correct)
No context found.
S. Goldwasser, S.Macali, and C. Racko#, The knowledge complexity of interactive proof systems, Proc. 17th ACM Symp. on the Theory of Computing, pp.291-304, 1985.
Ecient Zero-knowledge Authentication Based - On Linear Algebra (2001) (Correct)
No context found.
S. Goldwasser, S. Micali and C. Racko#, The knowledge Complexity of interactive proof systems; SIAM Journal of computing, 1997, Vol. 6, No.1, pp.84.
Using Probabilistic I/O Automata to Analyze an.. - Canetti, Cheung.. (2005) (Correct)
No context found.
S. Goldwasser, S. Micali and C. Racko#. The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Comput., Vol. 18, No. 1, 1989, pp. 186-208.
Cryptanalysis of a Zero-Knowledge Identification.. - Jean-Sebastien Coron And (Correct)
No context found.
S. Goldwasser, S. Micali and C. Racko#, The knowledge complexity of interactive proof-systems, Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 291-304, 1985.
Cryptanalysis of a Zero-Knowledge Identification.. - Jean-Sebastien Coron And (Correct)
No context found.
S. Goldwasser, S. Micali and C. Racko#, The knowledge complexity of interactive proof-systems, Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 291-304, 1985.
Conditional Reactive Simulatability - Backes, Dürmuth, Hofheinz, Küsters (2006) (Correct)
No context found.
Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186--208, 1989.
Privacy Preserving Data Collection - Swiss Federal Section (Correct)
No context found.
S. Micali S. Goldwasser and C. Racko. The knowledge complexity of interactive proofsystems. Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pages 291--304, 1985.
Testing Disjointness of Private Datasets - Aggelos Kiayias And (2005) (2 citations) (Correct)
No context found.
Shafi Goldwasser, Silvio Micali and Charles Racko#, The Knowledge Complexity of Interactive Proof Systems SIAM J. Comput. 18(1): 186-208 (1989)
Basic Research in Computer Science - Zero-Knowledge Proofs And (1998) (Correct)
No context found.
Goldwasser, S., S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems, in 17th Annual Symposium on Theory of Computing (STOC), 1985.
Invariant Signatures and - Non-Interactive Zero-Knowledge Proofs (Correct)
No context found.
S. Goldwasser, S. Micali and C. Rackoff, "The Knowledge Complexity of Interactive Proof-Systems", SIAM J. Comput. 18 (1989), pp. 186208; (also in STOC 85, pp. 291-304.)
The Graph Clustering Problem Has a Perfect Zero-Knowledge Proof - Goldreich (1996) (Correct)
No context found.
S. Goldwasser, S. Micali and C. Rackoff, "The Knowledge Complexity of Interactive Proof Systems", SIAM J. Comput., Vol. 18, No. 1, pp. 186--208, 1989. 3
Oblivious Transfers and Intersecting Codes - Brassard, Crepeau, Santha (1996) (14 citations) (Correct)
No context found.
S. Goldwasser, S. Micali and C. Rackoff, "The knowledge complexity of interactive proof-systems", SIAM Journal on Computing, Vol. 18, 1989, pp. 186 -- 208.
Fair Games Against an All-Powerful Adversary - Rafail Ostrovsky Ramarathnam (1993) (9 citations) (Correct)
No context found.
S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, Proc. ACM Symp. on Theory of Computing, pp. 291-304 1985.
Non-Interactive and Non-Malleable Commitment - Giovanni Di Crescenzo (1998) (5 citations) (Correct)
No context found.
S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of interactive Proof-Systems, in SIAM Journal on Computing, vol. 18, n. 1, February 1989.
Perfect Zero-Knowledge Arguments for NP Can Be Based .. - Naor, Ostrovsky.. (1992) (12 citations) (Correct)
No context found.
S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, STOC 85, pp. 291-304. (also in SIAM J. COMP.)
One-Way Functions, Hard on Average Problems, and Statistical.. - Ostrovsky (2 citations) (Correct)
No context found.
S. Goldwasser, S. Micali and C. Rackoff, "The Knowledge Complexity of Interactive Proof-Systems", STOC 85, pp. 291-304.
Robust Non-Interactive Zero Knowledge - Alfredo De Santis (25 citations) (Correct)
No context found.
S. GOLDWASSER, S. MICALI, AND C. RACKOFF, The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186--208, February 1989.
Randomness versus Fault-Tolerance - Canetti, Kushilevitz, Ostrovsky.. (1999) (Correct)
No context found.
S. Goldwasser, S. Micali and C. Rackoff, "The Knowledge Complexity of Interactive Proof Systems", SIAM Journal on Comput., Vol. 18, No. 1, 1989, pp. 186-208.
On Security Preserving Reductions - Revised Terminology - Goldreich (2000) (Correct)
No context found.
S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM J. on Comput., Vol. 18, pages 186--208, 1989.
Software Protection and Simulation on Oblivious RAMs - Goldreich, Ostrovsky (1996) (46 citations) (Correct)
No context found.
S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, STOC 1985.
The Impossibility of Realizable Ideal Functionality - Datta, Derek, Mitchell.. (2005) (1 citation) (Correct)
No context found.
Shafi Goldwasser, Silvio Micali, and Charles Racko#. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186--208, 1989.
On the Existence of 3-Round Zero-Knowledge Protocols - Hada, Tanaka (1999) (26 citations) (Correct)
No context found.
S. Goldwasser, S. Micali, and C. Racko#, "The Knowledge Complexity of Interactive Proof Systems," SIAM Journal on Computing, Vol.18, No.1, pp.186-208, 1989.
Comparing Entropies in Statistical Zero-Knowledge with.. - Goldreich, Vadhan (1998) (6 citations) (Correct)
No context found.
Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186--208, February 1989.
Identity-Based Zero-Knowledge - Jonathan Katz Rafail (Correct)
No context found.
S. Goldwasser, S. Micali, and C. Racko#. The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comp. 18(1): 186--208 (1989).
Session-Key Generation Using Human Passwords Only - Goldreich, Lindell (2005) (24 citations) (Correct)
No context found.
S. Goldwasser, S. Micali and C. Racko#. The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing, 18(1):186--208, 1989.
Replication Is Not Needed: - Single Database.. (Correct)
No context found.
S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof-Systems, SIAM J. Comput. 18 (1989), pp. 186-208; (also in STOC 85, pp. 291-304.)
Guessing Attacks in the pi-calculus with a Computational.. - Chothia (2005) (Correct)
No context found.
Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof-systems. SIAM Jounral on Computing, 17:281--308, 1988.
Unifying Simulatability Definitions in Cryptographic Systems.. - Backes (2003) (2 citations) (Correct)
No context found.
S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186--207, 1989.
Reducing Server Trust In Private Proxy Auctions - Di Crescenzo, Herranz, Sáez (2004) (Correct)
No context found.
S. Goldwasser, S. Micali and C. Racko . The Knowledge Complexity of Interactive Proof-Systems. SIAM Journal on Computing, vol. 18, no. 1, pp. 186-208 (1989).
Cryptographically Sound and Machine-Assisted Verification of.. - Backes, Jacobi (2002) (7 citations) (Correct)
No context found.
S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186--207, 1989.
A Cryptographically Sound Dolev-Yao Style Security Proof of the.. - Backes (2004) (Correct)
No context found.
S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186--207, 1989.
A Cryptographically Sound Security Proof of the.. - Backes, Pfitzmann (2003) (9 citations) (Correct)
No context found.
S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186--207, 1989.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC