Pages that link to "Item:Q2891482"
From MaRDI portal
The following pages link to Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments (Q2891482):
Displaying 50 items.
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- The wonderful world of global random oracles (Q1648798) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- Election control through social influence with unknown preferences (Q2019485) (← links)
- On subversion-resistant SNARKs (Q2039405) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- Verifiable registration-based encryption (Q2096501) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- A classification of computational assumptions in the algebraic group model (Q2096519) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Somewhere statistically binding commitment schemes with applications (Q2145407) (← links)
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs (Q2149845) (← links)
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) (Q2170012) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials (Q2423846) (← links)
- Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← links)
- On the existence of extractable one-way functions (Q2829449) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Zero-Knowledge Accumulators and Set Algebra (Q2953773) (← links)
- A Shuffle Argument Secure in the Generic Model (Q2953798) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- Delegating RAM Computations (Q3181023) (← links)
- Arguments of Proximity (Q3457077) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- On QA-NIZK in the BPK Model (Q5041171) (← links)
- A Unified Framework for Non-universal SNARKs (Q5087272) (← links)
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- Optimally Sound Sigma Protocols Under DCRA (Q5854433) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge (Q6045075) (← links)
- Rinocchio: SNARKs for ring arithmetic (Q6070447) (← links)
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK (Q6132412) (← links)
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection (Q6132417) (← links)
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier (Q6132419) (← links)
- Unconditionally secure NIZK in the fine-grained setting (Q6132420) (← links)
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? (Q6134856) (← links)
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions (Q6157543) (← links)
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG (Q6157544) (← links)
