Pages that link to "Item:Q3058656"
From MaRDI portal
The following pages link to Constant-Size Commitments to Polynomials and Their Applications (Q3058656):
Displaying 50 items.
- A position-aware Merkle tree for dynamic cloud data integrity verification (Q1701711) (← links)
- Trusted computing with addition machines. II (Q1745689) (← links)
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
- Boosting verifiable computation on encrypted data (Q2055689) (← links)
- Aggregatable distributed key generation (Q2056680) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- An algebraic framework for universal and updatable SNARKs (Q2120103) (← links)
- Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
- Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms (Q2146105) (← links)
- High-threshold AVSS with optimal communication complexity (Q2147255) (← links)
- Decentralized policy-hiding ABE with receiver privacy (Q2167764) (← links)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← links)
- Families of SNARK-friendly 2-chains of elliptic curves (Q2170053) (← links)
- Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials (Q2423846) (← links)
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system (Q2691596) (← links)
- Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← links)
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage (Q2692375) (← links)
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments (Q2697847) (← links)
- Vector and functional commitments from lattices (Q2697903) (← links)
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives (Q2790034) (← links)
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List (Q2794500) (← links)
- Constant Size Ring Signature Without Random Oracle (Q3194600) (← links)
- Polynomial-Space Approximation of No-Signaling Provers (Q3587375) (← links)
- Vector Commitments and Their Applications (Q4916001) (← links)
- Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists (Q4924437) (← links)
- Verifiable Inner Product Encryption Scheme (Q5041153) (← links)
- UC Updatable Databases and Applications (Q5048962) (← links)
- Storing and Retrieving Secrets on a Blockchain (Q5087260) (← links)
- Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes (Q5087265) (← links)
- Polynomial IOPs for Linear Algebra Relations (Q5087271) (← links)
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
- SnarkPack: practical SNARK aggregation (Q6045200) (← links)
- SoK: blockchain light clients (Q6045245) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- Proving knowledge of isogenies: a survey (Q6063129) (← links)
- Functional commitments for all functions, with transparent setup and from SIS (Q6063522) (← links)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
- KDM security for the Fujisaki-Okamoto transformations in the QROM (Q6113959) (← links)
- Logarithmic-size (linkable) threshold ring signatures in the plain model (Q6113965) (← links)
- On the impossibility of algebraic vector commitments in pairing-free groups (Q6114273) (← links)
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK (Q6132412) (← links)
- Inner product functional commitments with constant-size public parameters and openings (Q6134851) (← links)
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? (Q6134856) (← links)
- Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers (Q6134857) (← links)
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions (Q6157543) (← links)
- Proofs for inner pairing products and applications (Q6157545) (← links)
