On succinct arguments and witness encryption from groups
From MaRDI portal
Publication:2096510
DOI10.1007/978-3-030-56784-2_26zbMath1504.94100OpenAlexW3048460738MaRDI QIDQ2096510
Ohad Barta, David J. Wu, Rafail Ostrovsky, Yuval Ishai
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_26
Related Items (5)
Succinct non-interactive arguments via linear interactive proofs ⋮ Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees ⋮ Forward-secure public key encryption without key update from proof-of-stake blockchain ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ Towards witness encryption without multilinear maps
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of interactive proofs with bounded communication
- From laconic zero-knowledge to public-key cryptography. Extended abstract
- Does co-NP have short interactive proofs ?
- Minimum disclosure proofs of knowledge
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- The hunting of the SNARK
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Complexity of a determinate algorithm for the discrete logarithm
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Scalable zero knowledge with no trusted setup
- Lower Bounds on Assumptions Behind Indistinguishability Obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Secure computation with honest-looking parties (extended abstract)
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Targeted malleability
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Witness Encryption from Instance Independent Assumptions
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
- Square Span Programs with Applications to Succinct NIZK Arguments
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Candidate One-Way Functions Based on Expander Graphs
- Proof verification and the hardness of approximation problems
- Succinct NP Proofs from an Extractability Assumption
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Polylogarithmic two-round argument systems
- Monte Carlo Methods for Index Computation (mod p)
- The knowledge complexity of interactive proof-systems
- Computationally Sound Proofs
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- A deterministic reduction for the gap minimum distance problem
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
- 2 log1-ε n hardness for the closest vector problem with preprocessing
- Witness encryption and its applications
- Automata, Languages and Programming
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
- Public Key Cryptography - PKC 2006
This page was built for publication: On succinct arguments and witness encryption from groups
