Pinocchio: Nearly Practical Verifiable Computation

Reference. Pinocchio: Nearly Practical Verifiable Computation

Bryan Parno, Jon Howell, C. Gentry, M. Raykova · IEEE S&P · 2013 · security · DOI

Cite

Cite as @parno-2013-pinocchio (helia, typst) · \cite{parno-2013-pinocchio} (LaTeX)

BibTeX

bibtex · 1 line

@inproceedings{parno-2013-pinocchio, title={Pinocchio: Nearly Practical Verifiable Computation}, url={http://dx.doi.org/10.1109/sp.2013.47}, DOI={10.1109/sp.2013.47}, booktitle={2013 IEEE Symposium on Security and Privacy}, publisher={IEEE}, author={Parno, B. and Howell, J. and Gentry, C. and Raykova, M.}, year={2013}, month=May, pages={238–252} }

hayagriva YAML (typst)

yaml · 17 lines

parno-2013-pinocchio:
  type: article
  title: 'Pinocchio: Nearly Practical Verifiable Computation'
  author:
  - Parno, B.
  - Howell, J.
  - Gentry, C.
  - Raykova, M.
  date: 2013-05
  page-range: 238-252
  url: http://dx.doi.org/10.1109/sp.2013.47
  serial-number:
    doi: 10.1109/sp.2013.47
  parent:
    type: proceedings
    title: 2013 IEEE Symposium on Security and Privacy
    publisher: IEEE

Download: parno-2013-pinocchio.bib · parno-2013-pinocchio.yml

Cites 67 works (1 here)

With notes (1)

Bootstrapping Trust in Modern Computers parno-2011-bootstrappingSpringerBriefs in Computer Science · 2011

DOI

External (66)

A Hybrid Architecture for Interactive Verifiable Computation (2013)
Resolving the conflict between generality and plausibility in verified computation (2013)
Verifiable computation: Pinocchio (project web page) (2013)
Practical verified computation with streaming interactive proofs (2012)
Secure two-party computations in ANSI C (2012)
Privacy-preserving smart metering (2011)
Separating succinct non-interactive arguments from all falsifiable assumptions (2011)
Faster secure two-party computation using garbled circuits (2011)
To cloud or not to cloud?: musings on costs and viability (2011)
Improved delegation of computation using fully homomorphic encryption (2010)
Token-based cloud computing: Secure outsourcing of data and arbitrary computations with lower latency (2010)
Short pairing-based non-interactive zero-knowledge arguments (2010)
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers (2010)
A fully homomorphic encryption scheme (PhD thesis, Stanford University) (2009)
Delegating computation: interactive proofs for muggles (2008)
Efficient Arguments without Short PCPs (2007)
Uncheatable reputation for distributed computation markets (2006)
Pairing-friendly elliptic curves of prime order (2006)
A protocol for property-based attestation (2006)
Hierarchical identity based encryption with constant size ciphertext (2005)
Collusion resistant broadcast encryption with short ciphertexts and private keys (2005)
Searching for High-Value Rare Events with Uncheatable Grid Computing (2005)
Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions (2005)
The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols (2004)
Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks (2004)
Short signatures without random oracles (2004)
Identity-Based Encryption from the Weil Pairing (2003)
SETI@home: an experiment in public-resource computing (2002)
Practical byzantine fault tolerance and proactive recovery (2002)
Computationally Sound Proofs (2000)
Lattice-Gas Cellular Automata and Lattice Boltzmann Models: An Introduction (2000)
Proof verification and the hardness of approximation problems (1998)
Probabilistic checking of proofs: a new characterization of NP (1998)
Randomized Algorithms (1995)
A note on efficient zero-knowledge proofs and arguments (extended abstract) (1992)
Towards practical public key systems secure against chosen ciphertext attacks (1991)
Noninteractive Zero-Knowledge (1991)
The Knowledge Complexity of Interactive Proof Systems (1989)
Relations Among Complexity Measures (1979)
The Design and Analysis of Computer Algorithms (1974)
On cryptographic assumptions and challenges
Efficient Non-interactive Proof Systems for Bilinear Groups
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Verifiable computation with massively parallel interactive proofs
Making argument systems for outsourced computation practical (sometimes)
Taking proof-based verified computation a few steps closer to practicality
How to delegate and verify in public: Verifiable computation from attribute-based encryption
Secure distributed computing in a commercial environment
Distributed execution with remote audit
Quadratic span programs and succinct NIZKs without PCPs
Query execution assurance for outsourced databases
Uncheatable distributed computations
Design and implementation of a TCG-based integrity measurement architecture
Fairplay - A secure two-party computation system
Secure remote execution of sequential computations
Architecture for Protecting Critical Secrets in Microprocessors
Architectural support for copy and tamper resistant software
Pioneer: Verifying integrity and guaranteeing execution of code on legacy platforms
ZKPDL: A language-based system for efficient zero-knowledge proofs and electronic cash
Automated synthesis of privacy-preserving distributed applications
A certifying compiler for zero-knowledge proofs of knowledge based on s-protocols
Billion-gate secure computation with malicious adversaries
On the evaluation of powers and related problems (preliminary version)
Secure computation on floating point numbers
New software speed records for cryptographic pairings
Homomorphic evaluation of the AES circuit