Zero-knowledge from secure multiparty computation
- 11 June 2007
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Computationally Sound ProofsSIAM Journal on Computing, 2000
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- On the complexity of interactive proofs with bounded communicationInformation Processing Letters, 1998
- How to construct constant-round zero-knowledge proof systems for NPJournal of Cryptology, 1996
- Subquadratic zero-knowledgeJournal of the ACM, 1995
- Small-Bias Probability Spaces: Efficient Constructions and ApplicationsSIAM Journal on Computing, 1993
- Bit commitment using pseudorandomnessJournal of Cryptology, 1991
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- A randomized protocol for signing contractsCommunications of the ACM, 1985
- How to share a secretCommunications of the ACM, 1979