• Corpus ID: 33504698

Pinocchio : Nearly Practical Verifiable Computation

@inproceedings{Baghery2016PinocchioN,
  title={Pinocchio : Nearly Practical Verifiable Computation},
  author={Karim Baghery},
  year={2016}
}
In this report, we aim to present a short description on the Pinocchio which is an efficient solution for Verifiable Computations (VC) and presented by Parno, Howell, Gentry, and Raykova in 2013 IEEE Symposium on Security and Privacy [PHGR13]. In fact, Pinocchio is a practical implementation of SNARKs (Succinct non-interactive argument of knowledge) which are systems that allow a client to ask a server or cloud to compute F (x) for a given function F and an input x and then verify the… 

Figures from this paper

References

SHOWING 1-10 OF 10 REFERENCES
Pinocchio: Nearly Practical Verifiable Computation
TLDR
This work introduces Pinocchio, a built system for efficiently verifying general computations while relying only on cryptographic assumptions, and is the first general-purpose system to demonstrate verification cheaper than native execution (for some apps).
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
TLDR
A protocol that allows the worker to return a computationally-sound, non-interactive proof that can be verified in O(mċpoly(λ)) time, where m is the bit-length of the output of F, and λ is a security parameter.
D 5 . 8 : Overview of Verifiable Computing Techniques Providing Private and Public Verification
TLDR
This deliverable investigates the state-of-the-art in cryptographic approaches to verifiable computing and highlights some interesting directions for future work in Privacy and Security Maintaining Services in the Cloud Overview of Verifiable Computing Techniques Providing Private and Public Verification.
Making argument systems for outsourced computation practical (sometimes)
TLDR
A general-purpose system that builds on work of Ishai et al. (CCC ’07) and incorporates new theoretical work to improve performance by 20 orders of magnitude, suggesting that, as a tool for building secure systems, PCPs are not a lost cause.
Efficient Arguments without Short PCPs
TLDR
A direct method for compiling an exponentially long PCP which is succinctly described by a linear oracle function into an argument system in which the verifier sends to the prover O(n) encrypted field elements and receives O(1) encryptions in return.
Taking Proof-Based Verified Computation a Few Steps Closer to Practicality
We describe GINGER, a built system for unconditional, general-purpose, and nearly practical verification of outsourced computation. GINGER is based on PEPPER, which uses the PCP theorem and
Pairing-Friendly Elliptic Curves of Prime Order
TLDR
This paper describes a method to construct elliptic curves of prime order and embedding degree k = 12 and shows that the ability to handle log(D)/log(r) ~ (q–3)/(q–1) enables building curves with ρ ~ q/(q-1).
New Software Speed Records for Cryptographic Pairings
TLDR
An implementation which computes the optimal ate pairing on a 257- bit Barreto-Naehrig curve in only 4,470,408 cycles on one core of an Intel Core 2 Quad Q6600 processor is presented.
Quadratic Span Programs and Succinct NIZKs without PCPs
We introduce a new characterization of the NP complexity class, called Quadratic Span Programs (QSPs), which is a natural extension of span programs defined by Karchmer and Wigderson. Our main
Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks
TLDR
Two efficient constructions aimed at making public key systems secure against chosen ciphertext attacks are presented and a connection between such public-key systems and efficient identification schemes is pointed out.