Public-Randomness in Public-Key Cryptography

This publication has 21 references indexed in Scilit:

• Demonstrating that a Public Predicate can be Satisfied Without Revealing Any Information About How
  Published by Springer Nature ,2000
• Non-Interactive Zero-Knowledge with Preprocessing
  Published by Springer Nature ,1990
• Minimum disclosure proofs of knowledge
  Journal of Computer and System Sciences, 1988
• Multiparty unconditionally secure protocols
  Published by Association for Computing Machinery (ACM) ,1988
• Completeness theorems for non-cryptographic fault-tolerant distributed computation
  Published by Association for Computing Machinery (ACM) ,1988
• Does co-NP have short interactive proofs?
  Information Processing Letters, 1987
• Information theoretic reductions among disclosure problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
• Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
• A randomized protocol for signing contracts
  Communications of the ACM, 1985
• New directions in cryptography
  IEEE Transactions on Information Theory, 1976