Pinocchio: Nearly Practical Verifiable Computation
- 1 May 2013
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 29 references indexed in Scilit:
- Efficient Non-interactive Proof Systems for Bilinear GroupsPublished by Springer Science and Business Media LLC ,2008
- Identity-Based Encryption from the Weil PairingSIAM Journal on Computing, 2003
- Practical byzantine fault tolerance and proactive recoveryACM Transactions on Computer Systems, 2002
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding ProtocolsPublished by Springer Science and Business Media LLC ,2001
- Computationally Sound ProofsSIAM Journal on Computing, 2000
- Proof verification and the hardness of approximation problemsJournal of the ACM, 1998
- Probabilistic checking of proofsJournal of the ACM, 1998
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Relations Among Complexity MeasuresJournal of the ACM, 1979