One-message statistical Zero-Knowledge Proofs and space-bounded verifier

This publication has 17 references indexed in Scilit:

• Multiple non-interactive zero knowledge proofs based on a single random string
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Some simplified NP-complete graph problems
  Published by Elsevier ,2002
• Noninteractive Zero-Knowledge
  SIAM Journal on Computing, 1991
• The Knowledge Complexity of Interactive Proof Systems
  SIAM Journal on Computing, 1989
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
  SIAM Journal on Computing, 1988
• Does co-NP have short interactive proofs?
  Information Processing Letters, 1987
• Zero knowledge proofs of identity
  Published by Association for Computing Machinery (ACM) ,1987
• The complexity of perfect zero-knowledge
  Published by Association for Computing Machinery (ACM) ,1987
• Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
• Probabilistic encryption
  Journal of Computer and System Sciences, 1984