Short pairing-based non-interactive zero-knowledge arguments
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Scalable zero knowledge via cycles of elliptic curves
- On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
- The hunting of the SNARK
- How to build time-lock encryption
- Election control through social influence with unknown preferences
- On subversion-resistant SNARKs
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Compact NIZKs from standard assumptions on bilinear maps
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Linearly-homomorphic signatures and scalable mix-nets
- Public verifiable private decision tree prediction
- Verifiable registration-based encryption
- On succinct arguments and witness encryption from groups
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Succinct non-interactive secure computation
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Subquadratic SNARGs in the random oracle model
- An algebraic framework for universal and updatable SNARKs
- Tight state-restoration soundness in the algebraic group model
- Succinct non-interactive arguments via linear interactive proofs
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Signatures of knowledge for Boolean circuits under standard assumptions
- Somewhere statistically binding commitment schemes with applications
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- Asymptotically quasi-optimal cryptography
- On succinct non-interactive arguments in relativized worlds
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- SNARGs for P from sub-exponential DDH and QR
- Shorter pairing-based arguments under standard assumptions
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Efficient chameleon hash functions in the enhanced collision resistant model
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Cryptographic algorithms for privacy-preserving online applications
- Succinct functional commitment for a large class of arithmetic circuits
- Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
- On the existence of extractable one-way functions
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Efficient NIZK arguments via parallel verification of Beneš networks
- Square span programs with applications to succinct NIZK arguments
- On constant-round concurrent zero-knowledge from a knowledge assumption
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- A shuffle argument secure in the generic model
- Pairing-based non-interactive zero-knowledge proofs
- On the (in)security of SNARKs in the presence of oracles
- Interactive oracle proofs
- Delegating RAM Computations
- Constant-round leakage-resilient zero-knowledge argument for NP from the knowledge-of-exponent assumption
- Arguments of proximity (extended abstract)
- Perfect NIZK with Adaptive Soundness
- Universal Arguments and their Applications
- Refereed delegation of computation
- Multikey fully homomorphic encryption and applications
- Shorter arithmetization of nondeterministic computations
- Constant-round interactive proofs for delegating computation
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- On QA-NIZK in the BPK model
- A unified framework for non-universal SNARKs
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- On the classification of knowledge-of-exponent assumptions in cyclic groups
- Lattice-based SNARGs and their application to more efficient obfuscation
- Computational integrity with a public random string from quasi-linear PCPs
- On the size of pairing-based non-interactive arguments
- Optimally sound sigma protocols under DCRA
- No-signaling linear PCPs
- No-signaling linear PCPs
- Adaptively secure MPC with sublinear communication complexity
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
- A survey of elliptic curves for proof systems
- Ligero: lightweight sublinear arguments without a trusted setup
- Non-interactive publicly-verifiable delegation of committed programs
- Rinocchio: SNARKs for ring arithmetic
- scientific article; zbMATH DE number 7746256 (Why is no real title available?)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- 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
- Obtaining simulation extractable NIZKs in the updatable CRS model generically
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- Short-lived zero-knowledge proofs and signatures
- Non-interactive zero-knowledge proofs to multiple verifiers
- Succinct arguments for RAM programs via projection codes
- \(\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
- Snarky ceremonies
- Lower bound on SNARGs in the random oracle model
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- CRS-updatable asymmetric quasi-adaptive NIZK arguments
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)
