Designated-verifier SNARGs with one group element

DOI10.1007/978-3-032-01907-3_7MaRDI QIDQ6862537zbMATH OpenFDO

Authors Gal Arnon, Jesko Dujmovic, Yuval Ishai

Publication date 6 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01907-3_7

zbMATH Keywords

group-based homomorphic secret sharingtrapdoor hash functions

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• An optimal distributed discrete log protocol with applications to homomorphic secret sharing
• Breaking the circuit size barrier for secure computation under DDH
• Constant ciphertext-rate non-committing encryption from standard assumptions
• Constant-round interactive proofs for delegating computation
• Designated-verifier SNARGs with one group element
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Fast Reed-Solomon interactive oracle proofs of proximity
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• How to use indistinguishability obfuscation: deniable encryption, and more
• Interactive oracle proofs
• LaBRADOR: compact proofs for R1CS from Module-SIS
• Lattice-based SNARGs and their application to more efficient obfuscation
• Linear-consistency testing.
• Minimum disclosure proofs of knowledge
• On succinct arguments and witness encryption from groups
• On the size of pairing-based non-interactive arguments
• Optimal inapproximability with universal factor graphs
• Polymath: Groth16 is not the limit
• Quadratic span programs and succinct NIZKs without PCPs
• Quasi-optimal SNARGs via linear multi-prover interactive proofs
• Query efficient PCPs with perfect completeness
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Short pairing-based non-interactive zero-knowledge arguments
• SLAP: succinct lattice-based polynomial commitments from standard assumptions
• Some optimal inapproximability results
• Square span programs with applications to succinct NIZK arguments
• STIR: Reed-Solomon proximity testing with fewer queries
• Subvector commitments with application to succinct arguments
• Succinct non-interactive arguments via linear interactive proofs
• Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
• The hunting of the SNARK
• The Knowledge Complexity of Interactive Proof Systems
• Trapdoor hash functions and their applications
• Universal factor graphs

Cited in

(1)

• Designated-verifier SNARGs with one group element

This page was built for publication: Designated-verifier SNARGs with one group element

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862537)