On succinct arguments and witness encryption from groups
From MaRDI portal
Publication:2096510
Recommendations
- On the size of pairing-based non-interactive arguments
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Succinct non-interactive arguments via linear interactive proofs
- Succinct non-interactive arguments via linear interactive proofs
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
Cites work
- \(2^{\log^{1-\varepsilon} n}\) hardness for the closest vector problem with preprocessing
- A deterministic reduction for the gap minimum distance problem (extended abstract)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
- Automata, Languages and Programming
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate one-way functions based on expander graphs
- Complexity of a determinate algorithm for the discrete logarithm
- Computationally Sound Proofs
- Does co-NP have short interactive proofs ?
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- From laconic zero-knowledge to public-key cryptography. Extended abstract
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- scientific article; zbMATH DE number 1263221 (Why is no real title available?)
- scientific article; zbMATH DE number 1754603 (Why is no real title available?)
- scientific article; zbMATH DE number 7650430 (Why is no real title available?)
- Lattice-based SNARGs and their application to more efficient obfuscation
- Lower bounds on assumptions behind indistinguishability obfuscation
- Minimum disclosure proofs of knowledge
- Monte Carlo Methods for Index Computation (mod p)
- On the complexity of interactive proofs with bounded communication
- On the size of pairing-based non-interactive arguments
- Polylogarithmic two-round argument systems
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Proof verification and the hardness of approximation problems
- Public Key Cryptography - PKC 2006
- Quadratic span programs and succinct NIZKs without PCPs
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Scalable zero knowledge with no trusted setup
- Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract)
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Short pairing-based non-interactive zero-knowledge arguments
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Square span programs with applications to succinct NIZK arguments
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
- Succinct non-interactive arguments via linear interactive proofs
- Succinct NP Proofs from an Extractability Assumption
- Targeted malleability: homomorphic encryption for restricted computations
- The hunting of the SNARK
- The knowledge complexity of interactive proof-systems
- Witness encryption and its applications
- Witness encryption from instance independent assumptions
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
Cited in
(16)- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Towards witness encryption without multilinear maps
- Succinct non-interactive arguments via linear interactive proofs
- SNARGs for P from sub-exponential DDH and QR
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
- Succinct non-interactive arguments via linear interactive proofs
- On the size of pairing-based non-interactive arguments
- 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
- Indistinguishability obfuscation, range avoidance, and bounded arithmetic
- Witness-authenticated key exchange, revisited: extensions to groups, improved models, simpler constructions
- Witness encryption for succinct functional commitments and applications
- On witness encryption and laconic zero-knowledge arguments
- Designated-verifier SNARGs with one group element
- Adaptively secure attribute-based encryption from witness encryption
This page was built for publication: On succinct arguments and witness encryption from groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096510)
