Signatures of Correct Computation

DOI10.1007/978-3-642-36594-2_13zbMath1315.94098OpenAlexW174039250MaRDI QIDQ4910280

Elaine Shi, Charalampos Papamanthou, Roberto Tamassia

Publication date: 18 March 2013

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_13

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (25)

An algebraic framework for universal and updatable SNARKs ⋮ Time- and space-efficient arguments from groups of unknown order ⋮ Verifiable Computation for Randomized Algorithm ⋮ Batch verifiable computation of outsourced functions ⋮ HyperPlonk: Plonk with linear-time prover and high-degree custom gates ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) ⋮ Private polynomial commitments and applications to MPC ⋮ An Efficient and Provably Secure Private Polynomial Evaluation Scheme ⋮ Linear-map vector commitments and their practical applications ⋮ On the impossibility of algebraic NIZK in pairing-free groups ⋮ Succinct functional commitment for a large class of arithmetic circuits ⋮ Confidentiality-Preserving Publicly Verifiable Computation ⋮ Dory: efficient, transparent arguments for generalised inner products and polynomial commitments ⋮ On Privacy-Preserving Biometric Authentication ⋮ Algebraic (trapdoor) one-way functions: constructions and applications ⋮ Trusted computing with addition machines. II ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Privacy-preserving verifiable delegation of polynomial and matrix functions ⋮ Multi-server verifiable delegation of computations: unconditional security and practical efficiency ⋮ Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations ⋮ Marlin: preprocessing zkSNARKs with universal and updatable SRS ⋮ Boosting verifiable computation on encrypted data ⋮ Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup

This page was built for publication: Signatures of Correct Computation