Orion: Zero Knowledge Proof with Linear Prover Time
- 11 October 2022
- book chapter
- Published by Springer Nature
- p. 299-328
Abstract
No abstract availableKeywords
This publication has 54 references indexed in Scilit:
- Geppetto: Versatile Verifiable Computation2015
- Scalable Zero Knowledge via Cycles of Elliptic Curves2014
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge2013
- On Testing Expansion in Bounded-Degree Graphs2011
- Short PCPPs verifiable in polylogarithmic time with O(1) queriesAnnals of Mathematics and Artificial Intelligence, 2009
- Expander graphs and their applicationsBulletin of the American Mathematical Society, 2006
- Computationally Sound ProofsSIAM Journal on Computing, 2000
- Linear-time encodable and decodable error-correcting codesIEEE Transactions on Information Theory, 1996
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- A Comparison of Signalling AlphabetsBell System Technical Journal, 1952