Inner product functional commitments with constant-size public parameters and openings
From MaRDI portal
Publication:6134851
DOI10.1007/978-3-031-14791-3_28zbMATH Open1518.94052OpenAlexW4294698944MaRDI QIDQ6134851FDOQ6134851
Authors: Hien Chu, Dario Fiore, Dimitris Kolonelos, Dominique Schröder 
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
Recommendations
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Succinct functional commitment for a large class of arithmetic circuits
- Vector and functional commitments from lattices
- Constant-Size Commitments to Polynomials and Their Applications
- Additive-homomorphic functional commitments and applications to homomorphic signatures
Cites Work
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Secure Hash-and-Sign Signatures Without the Random Oracle
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - ASIACRYPT 2003
- Non-interactive Zero-Knowledge Arguments for Voting
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- On the computation of quadratic 2-class groups
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Updatable and universal common reference strings with applications to zk-SNARKs
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Title not available (Why is that?)
- Subvector commitments with application to succinct arguments
- Title not available (Why is that?)
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Vector commitments and their applications
- Verifiable delay functions
- Efficient verifiable delay functions
- Constant-Size Commitments to Polynomials and Their Applications
- Transparent SNARKs from DARK compilers
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- A survey on IQ cryptography
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- Succinct functional commitment for a large class of arithmetic circuits
- Vector and functional commitments from lattices
- Inner product functional commitments with constant-size public parameters and openings
Cited In (4)
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
- Vector commitments with proofs of smallness: short range proofs and more
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134851)
