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

DOI10.1007/978-3-031-14791-3_28MaRDI QIDQ6134851zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

communication complexityrandom oracle model

Mathematics Subject Classification ID

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

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

• scientific article; zbMATH DE number 1583782 (Why is no real title available?)
• scientific article; zbMATH DE number 1304086 (Why is no real title available?)
• scientific article; zbMATH DE number 2086711 (Why is no real title available?)
• scientific article; zbMATH DE number 1394309 (Why is no real title available?)
• A survey on IQ cryptography
• Advances in Cryptology - ASIACRYPT 2003
• Aurora: transparent succinct arguments for R1CS
• Batching techniques for accumulators with applications to IOPs and stateless blockchains
• Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
• Constant-Size Commitments to Polynomials and Their Applications
• Efficient verifiable delay functions
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
• Inner product functional commitments with constant-size public parameters and openings
• Non-interactive Zero-Knowledge Arguments for Voting
• On the computation of quadratic 2-class groups
• Scalable zero knowledge with no trusted setup
• Secure Hash-and-Sign Signatures Without the Random Oracle
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Subvector commitments with application to succinct arguments
• Succinct functional commitment for a large class of arithmetic circuits
• Transparent SNARKs from DARK compilers
• Updatable and universal common reference strings with applications to zk-SNARKs
• Vector and functional commitments from lattices
• Vector commitments and their applications
• Verifiable delay functions
• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography

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)