Universal Arguments and their Applications
- 1 January 2009
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 38 (5), 1661-1694
- https://doi.org/10.1137/070709244
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- The random oracle methodology, revisitedJournal of the ACM, 2004
- Proof verification and the hardness of approximation problemsJournal of the ACM, 1998
- Probabilistic checking of proofsJournal of the ACM, 1998
- Interactive proofs and the hardness of approximating cliquesJournal of the ACM, 1996
- On the power of multi-prover interactive protocolsTheoretical Computer Science, 1994
- Algebraic methods for interactive proof systemsJournal of the ACM, 1992
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988