Short pairing-based non-interactive zero-knowledge arguments
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- PMNS arithmetic for elliptic curve cryptography
- Verifiable registration-based encryption
- Constant-round interactive proofs for delegating computation
- Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- Shorter arithmetization of nondeterministic computations
- On the classification of knowledge-of-exponent assumptions in cyclic groups
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Scalable zero knowledge via cycles of elliptic curves
- On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
- Non-interactive zero-knowledge proofs to multiple verifiers
- Zero-knowledge RAM: doubly efficient and black-box
- Adaptively secure MPC with sublinear communication complexity
- Multikey fully homomorphic encryption and applications
- On cycles of pairing-friendly abelian varieties
- Secure formation of public parameters and elimination of vulnerabilities of zero-knowledge succint non-interactive arguments of knowledge
- Efficient NIZK arguments via parallel verification of Beneš networks
- Square span programs with applications to succinct NIZK arguments
- Somewhere statistically binding commitment schemes with applications
- The hunting of the SNARK
- Adaptively sound zero-knowledge SNARKs for UP
- Adaptive security in SNARGs via iO and lossy functions
- How to prove statements obliviously?
- Polymath: Groth16 is not the limit
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- Succinct functional commitment for a large class of arithmetic circuits
- Resumable zero-knowledge for circuits from symmetric key primitives
- NIZK from SNARGs
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- On constant-round concurrent zero-knowledge from a knowledge assumption
- Pairings in rank-1 constraint systems
- Universal Arguments and their Applications
- On the existence of extractable one-way functions
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Refereed delegation of computation
- Lower bound on SNARGs in the random oracle model
- Obtaining simulation extractable NIZKs in the updatable CRS model generically
- On succinct arguments and witness encryption from groups
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Perfect NIZK with Adaptive Soundness
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Succinct non-interactive secure computation
- Batching adaptively-sound SNARGs for NP
- Homomorphic secret sharing with verifiable evaluation
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- A unified framework for non-universal SNARKs
- A simple and efficient framework of proof systems for NP
- On black-box knowledge-sound commit-and-prove SNARKs
- Sigma protocols from verifiable secret sharing and their applications
- Succinct arguments for RAM programs via projection codes
- Pairing-based non-interactive zero-knowledge proofs
- Delegating RAM Computations
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- An algebraic framework for universal and updatable SNARKs
- Subquadratic SNARGs in the random oracle model
- No-signaling linear PCPs
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Speeding up multi-scalar multiplications for pairing-based zkSNARKs
- Snarky ceremonies
- Locally verifiable distributed SNARGs
- From polynomial IOP and commitments to non-malleable zkSNARKs
- A shuffle argument secure in the generic model
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- How to build time-lock encryption
- Tight state-restoration soundness in the algebraic group model
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
- Election control through social influence with unknown preferences
- Succinct non-interactive arguments via linear interactive proofs
- Compact NIZKs from standard assumptions on bilinear maps
- Lattice-based SNARGs and their application to more efficient obfuscation
- scientific article; zbMATH DE number 7746256 (Why is no real title available?)
- CRS-updatable asymmetric quasi-adaptive NIZK arguments
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
- On the size of pairing-based non-interactive arguments
- Shorter pairing-based arguments under standard assumptions
- Arguments of proximity (extended abstract)
- Rinocchio: SNARKs for ring arithmetic
- Cryptographic accumulators: new definitions, enhanced security, and delegatable proofs
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- Ligero: lightweight sublinear arguments without a trusted setup
- On the (in)security of SNARKs in the presence of oracles
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Signatures of knowledge for Boolean circuits under standard assumptions
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
- On QA-NIZK in the BPK model
- On subversion-resistant SNARKs
- A survey of elliptic curves for proof systems
- Samaritan: linear-time prover SNARK from new multilinear polynomial commitments
- Pairing-based batch arguments for NP with a linear-size CRS
- Impossibilities in succinct arguments: black-box extraction and more
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
This page was built for publication: Short pairing-based non-interactive zero-knowledge arguments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058664)
