Corpus ID: 33504698

Pinocchio : Nearly Practical Verifiable Computation

  title={Pinocchio : Nearly Practical Verifiable Computation},
  author={K. Baghery},
  • K. Baghery
  • Published 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… CONTINUE READING

    Figures from this paper.


    Publications referenced by this paper.
    Efficient Arguments without Short PCPs
    • 108
    • Open Access
    Pairing-Friendly Elliptic Curves of Prime Order
    • 855
    • Open Access
    Quadratic Span Programs and Succinct NIZKs without PCPs
    • 432
    • Open Access
    New Software Speed Records for Cryptographic Pairings
    • 108
    • Open Access