scientific article

Yael Tauman Kalai, Shafi Goldwasser, Guy N. Rothblum

Publication date: 5 January 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (65)

Sumcheck arguments and their applications ⋮ Updateable Inner Product Argument with Logarithmic Verifier and Applications ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ Fine-grained secure computation ⋮ A Hierarchy Theorem for Interactive Proofs of Proximity ⋮ Proofs of proximity for context-free languages and read-once branching programs ⋮ Interactive Oracle Proofs ⋮ MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) ⋮ A simple post-quantum non-interactive zero-knowledge proof from garbled circuits ⋮ Efficient proof composition for verifiable computation ⋮ Refereed delegation of computation ⋮ Batch verifiable computation of outsourced functions ⋮ SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption ⋮ Unnamed Item ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Rinocchio: SNARKs for ring arithmetic ⋮ Multi-key Homomorphic Authenticators ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs ⋮ Orion: zero knowledge proof with linear prover time ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II ⋮ One-time programs from commodity hardware ⋮ The hunting of the SNARK ⋮ Somewhere statistical soundness, post-quantum security, and SNARGs ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions ⋮ Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud ⋮ Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds ⋮ Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing ⋮ Efficient algorithms for secure outsourcing of bilinear pairings ⋮ Fast Reed-Solomon Interactive Oracle Proofs of Proximity ⋮ Algebraic (trapdoor) one-way functions: constructions and applications ⋮ Trusted computing with addition machines. II ⋮ Efficient computation outsourcing for inverting a class of homomorphic functions ⋮ Practical homomorphic message authenticators for arithmetic circuits ⋮ Verification protocols with sub-linear communication for polynomial matrix operations ⋮ Measurement-Based and Universal Blind Quantum Computation ⋮ Best-order streaming model ⋮ Unnamed Item ⋮ Privacy-preserving verifiable delegation of polynomial and matrix functions ⋮ No-signaling linear PCPs ⋮ Elimination-based certificates for triangular equivalence and rank profiles ⋮ Rational Sumchecks ⋮ Interactive Coding for Interactive Proofs ⋮ Multi-server verifiable delegation of computations: unconditional security and practical efficiency ⋮ Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations ⋮ Transparent SNARKs from DARK compilers ⋮ Witness indistinguishability for any single-round argument with applications to access control ⋮ Boosting verifiable computation on encrypted data ⋮ Unnamed Item ⋮ Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions ⋮ Flexible and efficient verifiable computation on encrypted data ⋮ Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems ⋮ Verifiable Stream Computation and Arthur--Merlin Communication ⋮ Outsourcing computation: the minimal refereed mechanism ⋮ Constant-Round Interactive Proofs for Delegating Computation ⋮ VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup ⋮ Arthur-Merlin streaming complexity ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs

This page was built for publication: