Inner product functional commitments with constant-size public parameters and openings

DOI10.1007/978-3-031-14791-3_28zbMath1518.94052OpenAlexW4294698944MaRDI QIDQ6134851

Dominique Schröder, Dimitris Kolonelos, Dario Fiore, Hien Chu

Publication date: 25 July 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-14791-3_28

zbMATH Keywords

communication complexityrandom oracle model

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

\textsf{Dew}: a transparent constant-sized polynomial commitment scheme ⋮ Inner product functional commitments with constant-size public parameters and openings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computation of quadratic 2-class groups
• Updatable and universal common reference strings with applications to zk-SNARKs
• Verifiable delay functions
• Transparent SNARKs from DARK compilers
• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Subvector commitments with application to succinct arguments
• Batching techniques for accumulators with applications to IOPs and stateless blockchains
• Aurora: transparent succinct arguments for R1CS
• Scalable zero knowledge with no trusted setup
• Succinct functional commitment for a large class of arithmetic circuits
• Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
• Vector and functional commitments from lattices
• Constant-Size Commitments to Polynomials and Their Applications
• Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
• Non-interactive Zero-Knowledge Arguments for Voting
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Secure Hash-and-Sign Signatures Without the Random Oracle
• Vector Commitments and Their Applications
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
• Advances in Cryptology - ASIACRYPT 2003
• Efficient verifiable delay functions
• Inner product functional commitments with constant-size public parameters and openings

This page was built for publication: Inner product functional commitments with constant-size public parameters and openings