Inner-product commitments over integers with applications to succinct arguments

DOI10.1007/978-981-95-5116-3_17MaRDI QIDQ7232570zbMATH OpenFDO

Authors Shihui Fu

Publication date 23 April 2026

Full work available at URL https://doi.org/10.1007/978-981-95-5116-3_17

zbMATH Keywords

inner-product commitmentinteger commitmentrange proofzero-knowledge proof

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
• A compressed \(\varSigma \)-protocol theory for lattices
• A non-PCP approach to succinct quantum-safe zero-knowledge
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Batching techniques for accumulators with applications to IOPs and stateless blockchains
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Compact E-Cash
• Efficient range proofs with transparent setup from bounded integer commitments
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Finding the four squares in Lagrange's theorem
• scientific article; zbMATH DE number 1088224 (Why is no real title available?)
• Non-interactive Zero-Knowledge Arguments for Voting
• On the Evaluation of Powers and Monomials
• Randomized algorithms in number theory
• Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
• Succinct Diophantine-satisfiability arguments
• Sumcheck arguments and their applications
• Time- and space-efficient arguments from groups of unknown order
• Transparent SNARKs from DARK compilers
• Vector commitments over rings and compressed -protocols

This page was built for publication: Inner-product commitments over integers with applications to succinct arguments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232570)