Succinct Arguments in the Quantum Random Oracle Model
- 22 November 2019
- book chapter
- Published by Springer Nature
- p. 1-29
Abstract
No abstract availableKeywords
All Related Versions
This publication has 53 references indexed in Scilit:
- Zero-Knowledge against Quantum AttacksSIAM Journal on Computing, 2009
- Quantum lower bounds for the collision and the element distinctness problemsJournal of the ACM, 2004
- Computationally Sound ProofsSIAM Journal on Computing, 2000
- On the complexity of interactive proofs with bounded communicationInformation Processing Letters, 1998
- 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
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- Algebraic methods for interactive proof systemsJournal of the ACM, 1992
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988