On succinct arguments and witness encryption from groups
type: Item
instance of: scholarly article
title: On succinct arguments and witness encryption from groups
zbMATH Open document ID: 1504.94100
DOI: 10.1007/978-3-030-56784-2_26
author: Ohad Barta
author: Yuval Ishai
author: Rafail Ostrovsky
author: David J. Wu
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68N20
zbMATH DE Number: 7614558
zbMATH Keywords: witness encryption schemes
zbMATH Keywords: compiler construction
describes a project that uses: ADSNARK
describes a project that uses: Curve25519
describes a project that uses: Pinocchio
describes a project that uses: libsnark
MaRDI profile type: Publication
full work available at URL: 978-3-030-56784-2 26
OpenAlex ID: W3048460738
cites work: A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
cites work: Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
cites work: Proof verification and the hardness of approximation problems
cites work: Zero-knowledge proofs on secret-shared data via fully linear PCPs
cites work: Scalable zero knowledge with no trusted setup
cites work: Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
cites work: Minimum disclosure proofs of knowledge
cites work: Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
cites work: The hunting of the SNARK
cites work: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
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: From laconic zero-knowledge to public-key cryptography. Extended abstract
cites work: Public Key Cryptography - PKC 2006
cites work: Does co-NP have short interactive proofs ?
cites work: Q5875789
cites work: Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
cites work: Quasi-optimal SNARGs via linear multi-prover interactive proofs
cites work: Targeted malleability: homomorphic encryption for restricted computations
cites work: Succinct NP Proofs from an Extractability Assumption
cites work: Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract)
cites work: GGH15 beyond permutation branching programs: proofs, attacks, and candidates
cites work: A deterministic reduction for the gap minimum distance problem
cites work: Square Span Programs with Applications to Succinct NIZK Arguments
cites work: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
cites work: Candidate indistinguishability obfuscation and functional encryption for all circuits
cites work: Quadratic Span Programs and Succinct NIZKs without PCPs
cites work: Witness encryption and its applications
cites work: On the complexity of interactive proofs with bounded communication
cites work: Witness Encryption from Instance Independent Assumptions
cites work: The knowledge complexity of interactive proof-systems
cites work: Candidate One-Way Functions Based on Expander Graphs
cites work: Short Pairing-Based Non-interactive Zero-Knowledge Arguments
cites work: On the Size of Pairing-Based Non-interactive Arguments
cites work: Q4535028
cites work: 2 log1-ε n hardness for the closest vector problem with preprocessing
cites work: Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
cites work: Computationally Sound Proofs
cites work: Polylogarithmic two-round argument systems
cites work: Lower Bounds on Assumptions Behind Indistinguishability Obfuscation
cites work: Complexity of a determinate algorithm for the discrete logarithm
cites work: Monte Carlo Methods for Index Computation (mod p)
cites work: Q4234093
cites work: Automata, Languages and Programming
description: scientific article; zbMATH DE number 7614558