The hunting of the SNARK
type: Item
instance of: scholarly article
title: The hunting of the SNARK
zbMATH Open document ID: 1386.94066
author: Nir Bitansky
author: Ran Canetti
author: Alessandro Chiesa
author: Huijia Lin
author: Aviad Rubinstein
author: Eran Tromer
author: Shafi Goldwasser
published in: Journal of Cryptology
publication date: 2018-02-15T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 6839568
zbMATH Keywords: succinct non-interactive adaptive argument of knowledge (SNARK)
zbMATH Keywords: extractable collision-resistant hash function (ECRH)
zbMATH Keywords: extractable one-way functions (EOWFs)
describes a project that uses: SNARKs for C
describes a project that uses: Pinocchio
describes a project that uses: zk-SNARK
describes a project that uses: ADSNARK
describes a project that uses: Geppetto
MaRDI profile type: Publication
full work available at URL: s00145-016-9241-9
OpenAlex ID: W4210966189
cites work: Q2754165
cites work: Survey: Leakage Resilience and the Bounded Retrieval Model
cites work: Perfect NIZK with Adaptive Soundness
cites work: From Secrecy to Soundness: Efficient Verification via Secure Computation
cites work: Q4228459
cites work: Proof verification and the hardness of approximation problems
cites work: Probabilistic checking of proofs
cites work: IP = PSPACE
cites work: Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
cites work: Minimum disclosure proofs of knowledge
cites work: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
cites work: Recursive composition and bootstrapping for SNARKS and proof-carrying data
cites work: SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
cites work: Succinct Non-interactive Arguments via Linear Interactive Proofs
cites work: On the existence of extractable one-way functions
cites work: Scalable Zero Knowledge via Cycles of Elliptic Curves
cites work: Definitions and properties of zero-knowledge proof systems
cites work: Universal Arguments and their Applications
cites work: On the (im)possibility of obfuscating programs
cites work: Verifiable Delegation of Computation over Large Datasets
cites work: New lattice-based cryptographic constructions
cites work: Does co-NP have short interactive proofs ?
cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Limits of Extractability Assumptions with Distributional Auxiliary Input
cites work: On the concrete efficiency of probabilistically-checkable proofs
cites work: Short PCPs with Polylog Query Complexity
cites work: Targeted malleability: homomorphic encryption for restricted computations
cites work: Efficient Fully Homomorphic Encryption from (Standard) LWE
cites work: Q4364570
cites work: Extractable Perfectly One-Way Functions
cites work: Towards a Theory of Extractable Functions
cites work: Succinct Malleable NIZKs and an Application to Compact Shuffles
cites work: Memory Delegation
cites work: Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
cites work: Improved Delegation of Computation Using Fully Homomorphic Encryption
cites work: Q4250776
cites work: Two Protocols for Delegation of Computation
cites work: Q4035738
cites work: Succinct NP Proofs from an Extractability Assumption
cites work: Square Span Programs with Applications to Succinct NIZK Arguments
cites work: Secure Two-Party Computation with Low Communication
cites work: Algorithmic Number Theory
cites work: Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
cites work: Zaps and Their Applications
cites work: Magic Functions
cites work: Salvaging Merkle-Damgård for Practical Applications
cites work: On the Composition of Zero-Knowledge Proof Systems
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Fully homomorphic encryption using ideal lattices
cites work: Collision-Free Hashing from Lattice Problems
cites work: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers

The hunting of the SNARK (cites work)
cites work: Quadratic Span Programs and Succinct NIZKs without PCPs

The hunting of the SNARK (cites work)
cites work: On the complexity of interactive proofs with bounded communication

The hunting of the SNARK (cites work)
cites work: Q3549691

The hunting of the SNARK (cites work)
cites work: Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead

The hunting of the SNARK (cites work)
cites work: Probabilistic encryption

The hunting of the SNARK (cites work)
cites work: The Knowledge Complexity of Interactive Proof Systems

The hunting of the SNARK (cites work)
cites work: Predicting Lattice Reduction

The hunting of the SNARK (cites work)
cites work: Foundations of Cryptography

The hunting of the SNARK (cites work)
cites work: Foundations of Cryptography

The hunting of the SNARK (cites work)
cites work: Automata, Languages and Programming

The hunting of the SNARK (cites work)
cites work: Short Pairing-Based Non-interactive Zero-Knowledge Arguments

The hunting of the SNARK (cites work)
cites work: On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption

The hunting of the SNARK (cites work)
cites work: On interactive proofs with a laconic prover

The hunting of the SNARK (cites work)
cites work: Separating succinct non-interactive arguments from all falsifiable assumptions

The hunting of the SNARK (cites work)
cites work: Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions

The hunting of the SNARK (cites work)
cites work: A Pseudorandom Generator from any One-way Function

The hunting of the SNARK (cites work)
cites work: Q4249347

The hunting of the SNARK (cites work)
cites work: Efficient Non-interactive Secure Computation

The hunting of the SNARK (cites work)
cites work: Delegating RAM Computations

The hunting of the SNARK (cites work)
cites work: Probabilistically Checkable Arguments

The hunting of the SNARK (cites work)
cites work: Delegation for bounded space

The hunting of the SNARK (cites work)
cites work: How to delegate computations

The hunting of the SNARK (cites work)
cites work: Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments

The hunting of the SNARK (cites work)
cites work: Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes

The hunting of the SNARK (cites work)
cites work: Efficient NIZK Arguments via Parallel Verification of Benes Networks

The hunting of the SNARK (cites work)
cites work: On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem

The hunting of the SNARK (cites work)
cites work: Publicly Verifiable Non-Interactive Zero-Knowledge Proofs

The hunting of the SNARK (cites work)
cites work: Q3342347

The hunting of the SNARK (cites work)
cites work: Computationally Sound Proofs

The hunting of the SNARK (cites work)
cites work: Polylogarithmic two-round argument systems

The hunting of the SNARK (cites work)
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

The hunting of the SNARK (cites work)
cites work: Advances in Cryptology - CRYPTO 2003

The hunting of the SNARK (cites work)
cites work: Complexity of a determinate algorithm for the discrete logarithm

The hunting of the SNARK (cites work)
cites work: Communication preserving protocols for secure function evaluation

The hunting of the SNARK (cites work)
cites work: Limits of provable security from standard assumptions

The hunting of the SNARK (cites work)
cites work: Streaming Authenticated Data Structures

The hunting of the SNARK (cites work)
cites work: Optimal Verification of Operations on Dynamic Sets

The hunting of the SNARK (cites work)
cites work: Statistically Hiding Sets

The hunting of the SNARK (cites work)
cites work: New lattice based cryptographic constructions

The hunting of the SNARK (cites work)
cites work: On lattices, learning with errors, random linear codes, and cryptography

The hunting of the SNARK (cites work)
cites work: Natural proofs

The hunting of the SNARK (cites work)
cites work: Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency

The hunting of the SNARK (cites work)
cites work: Automata, Languages and Programming

The hunting of the SNARK (DOI)
DOI: 10.1007/S00145-016-9241-9

The hunting of the SNARK (Recommended article)
Recommended article: The Continuing Saga of Snarks
Similarity Score: 0.8538667
Recommender Run: Recommender Run 3

The hunting of the SNARK (Recommended article)
Recommended article: Q4873782
Similarity Score: 0.8095325
Recommender Run: Recommender Run 3

The hunting of the SNARK (Recommended article)
Recommended article: The hunting of a snark with total chromatic number 5
Similarity Score: 0.8029065
Recommender Run: Recommender Run 3

The hunting of the SNARK (Recommended article)
Recommended article: Q3820638
Similarity Score: 0.7931094
Recommender Run: Recommender Run 3

The hunting of the SNARK (Recommended article)
Recommended article: Q3218161
Similarity Score: 0.77768445
Recommender Run: Recommender Run 3

The hunting of the SNARK (Recommended article)
Recommended article: Q3196673
Similarity Score: 0.77476984
Recommender Run: Recommender Run 3

The hunting of the SNARK (Recommended article)
Recommended article: Q4294635
Similarity Score: 0.7682484
Recommender Run: Recommender Run 3

The hunting of the SNARK (Recommended article)
Recommended article: Decomposition of snarks
Similarity Score: 0.76031435
Recommender Run: Recommender Run 3

The hunting of the SNARK (Recommended article)
Recommended article: Special classes of snarks
Similarity Score: 0.7469705
Recommender Run: Recommender Run 3