Constant-Size Commitments to Polynomials and Their Applications
From MaRDI portal
(Redirected from Publication:3058656)
Recommendations
- Private polynomial commitments and applications to MPC
- Succinct vector, polynomial, and functional commitments from lattices
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
- scientific article; zbMATH DE number 2086626
- Polynomial-Space Approximation of No-Signaling Provers
- The complexity of promise problems with applications to public-key cryptography
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant
Cited in
(only showing first 100 items - show all)- A position-aware Merkle tree for dynamic cloud data integrity verification
- Trusted computing with addition machines. II
- 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
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- An algebraic framework for universal and updatable SNARKs
- 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
- 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
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
- Succinct functional commitment for a large class of arithmetic circuits
- 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
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
- Partial bits exposure attacks on a new commitment scheme based on the Zagier polynomial
- Constant size ring signature without random oracle
- Polynomial-Space Approximation of No-Signaling Provers
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Vector commitments and their applications
- Zero-knowledge argument for polynomial evaluation with application to blacklists
- Verifiable Inner Product Encryption Scheme
- UC Updatable Databases and Applications
- 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
- \textsf{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)
- 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
- Concise Mercurial Subvector Commitments: Definitions and Constructions
- Improved extension protocols for Byzantine broadcast and agreement
- Pairings in rank-1 constraint systems
- Efficient transparent polynomial commitments for zk-SNARKs
- Fiat-Shamir security of FRI and related SNARKs
- On black-box knowledge-sound commit-and-prove SNARKs
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines
- Proof of necessary work: succinct state verification with fairness guarantees
- Cryptoeconomic security for data availability committees
- Distributed-prover interactive proofs
- Chainable functional commitments for unbounded-depth circuits
- From polynomial IOP and commitments to non-malleable zkSNARKs
- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
- Algebraic group model with oblivious sampling
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
- Lattice-based functional commitments: fast verification and cryptanalysis
- Towards zero knowledge argument for double discrete logarithm with constant cost
- Folding schemes with selective verification
- \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup
- Benchmarking the setup of updatable zk-SNARKs
- eSTARK: extending STARKs with arguments
- Vector commitments with proofs of smallness: short range proofs and more
- Simulation-extractable KZG polynomial commitments and applications to HyperPlonk
- Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
- Efficient KZG-based univariate sum-check and lookup argument
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- SPRINT: high-throughput robust distributed Schnorr signatures
- \textsf{Jolt}: SNARKs for virtual machines via lookups
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- Unlocking the lookup singularity with \textsf{Lasso}
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
This page was built for publication: Constant-Size Commitments to Polynomials and Their Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058656)
