\textsf{Dew}: a transparent constant-sized polynomial commitment scheme

DOI10.1007/978-3-031-31371-4_19zbMath1526.94020OpenAlexW4367593152MaRDI QIDQ6088998

Chaya Ganesh, Satya Lokam, Tushar Mopuri, Arasu Arun, Sriram Sridhar

Publication date: 16 November 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-31371-4_19

zbMATH Keywords

zero-knowledge succinct non-interactive arguments of knowledgeinner product commitment scheme with constant-sized proofs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Secure multiparty computation from threshold encryption based on class groups

Cites Work

• On the computation of quadratic 2-class groups
• Transparent SNARKs from DARK compilers
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• An algebraic framework for universal and updatable SNARKs
• Time- and space-efficient arguments from groups of unknown order
• Linear-size constant-query IOPs for delegating computation
• Subvector commitments with application to succinct arguments
• Batching techniques for accumulators with applications to IOPs and stateless blockchains
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• Constant-Size Commitments to Polynomials and Their Applications
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Efficient verifiable delay functions
• Inner product functional commitments with constant-size public parameters and openings
• \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \textsf{Dew}: a transparent constant-sized polynomial commitment scheme