Constant-Size Commitments to Polynomials and Their Applications
From MaRDI portal
Publication:3058656
DOI10.1007/978-3-642-17373-8_11zbMath1253.94054OpenAlexW1909324101MaRDI QIDQ3058656
Ian Goldberg, Gregory M. Zaverucha, Aniket Kate
Publication date: 7 December 2010
Published in: Advances in Cryptology - ASIACRYPT 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17373-8_11
Related Items (63)
\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments ⋮ An algebraic framework for universal and updatable SNARKs ⋮ Verifiable Inner Product Encryption Scheme ⋮ UC Updatable Databases and Applications ⋮ Time- and space-efficient arguments from groups of unknown order ⋮ Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms ⋮ High-threshold AVSS with optimal communication complexity ⋮ Constant Size Ring Signature Without Random Oracle ⋮ Decentralized policy-hiding ABE with receiver privacy ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ Families of SNARK-friendly 2-chains of elliptic curves ⋮ Gemini: elastic SNARKs for diverse environments ⋮ Storing and Retrieving Secrets on a Blockchain ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ Polynomial IOPs for Linear Algebra Relations ⋮ ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ SnarkPack: practical SNARK aggregation ⋮ SoK: blockchain light clients ⋮ Witness-succinct universally-composable SNARKs ⋮ HyperPlonk: Plonk with linear-time prover and high-degree custom gates ⋮ A survey of elliptic curves for proof systems ⋮ Proving knowledge of isogenies: a survey ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ Private polynomial commitments and applications to MPC ⋮ \textsf{Dew}: a transparent constant-sized polynomial commitment scheme ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ KDM security for the Fujisaki-Okamoto transformations in the QROM ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model ⋮ On the impossibility of algebraic vector commitments in pairing-free groups ⋮ Counting vampires: from univariate sumcheck to updatable ZK-SNARK ⋮ Inner product functional commitments with constant-size public parameters and openings ⋮ What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? ⋮ Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions ⋮ Proofs for inner pairing products and applications ⋮ An Efficient and Provably Secure Private Polynomial Evaluation Scheme ⋮ Nova: recursive zero-knowledge arguments from folding schemes ⋮ Additive-homomorphic functional commitments and applications to homomorphic signatures ⋮ Linear-map vector commitments and their practical applications ⋮ PointProofs, revisited ⋮ \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation ⋮ Revisiting cycles of pairing-friendly elliptic curves ⋮ \textsf{Orbweaver}: succinct linear functional commitments from lattices ⋮ On the impossibility of algebraic NIZK in pairing-free groups ⋮ MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system ⋮ Succinct functional commitment for a large class of arithmetic circuits ⋮ A position-aware Merkle tree for dynamic cloud data integrity verification ⋮ Incrementally aggregatable vector commitments and applications to verifiable decentralized storage ⋮ Dory: efficient, transparent arguments for generalised inner products and polynomial commitments ⋮ Vector and functional commitments from lattices ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Trusted computing with addition machines. II ⋮ Vector Commitments and Their Applications ⋮ Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives ⋮ Zero-Knowledge Authenticated Order Queries and Order Statistics on a List ⋮ Transparent SNARKs from DARK compilers ⋮ Marlin: preprocessing zkSNARKs with universal and updatable SRS ⋮ Boosting verifiable computation on encrypted data ⋮ Aggregatable distributed key generation ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup
This page was built for publication: Constant-Size Commitments to Polynomials and Their Applications
