Multi-oracle interactive protocols with space bounded verifiers
- 7 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 158-164
- https://doi.org/10.1109/sct.1989.41822
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Multi-prover interactive proofs: how to remove intractabilityPublished by Association for Computing Machinery (ACM) ,1988
- Zero-knowledge with log-space verifiersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Probabilistic game automataPublished by Springer Nature ,1986
- Private coins versus public coins in interactive proof systemsPublished by Association for Computing Machinery (ACM) ,1986
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985
- Games against naturePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Multiple-person alternationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979