Succinct functional commitments for circuits from \(k\)-\textsf{Lin}

DOI10.1007/978-3-031-58723-8_10MaRDI QIDQ6636508

David J. Wu, Hoeteck Wee

Publication date: 12 November 2024

zbMATH Keywords

pairing-based functional commitment for arbitrary circuitsprojective chainable commitments

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
• Transparent SNARKs from DARK compilers
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
• Shorter pairing-based arguments under standard assumptions
• Subvector commitments with application to succinct arguments
• Succinct functional commitment for a large class of arithmetic circuits
• Somewhere statistical soundness, post-quantum security, and SNARGs
• Fully-succinct publicly verifiable delegation from constant-size assumptions
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• An Algebraic Framework for Diffie-Hellman Assumptions
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
• Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
• Square Span Programs with Applications to Succinct NIZK Arguments
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• Constant-Size Commitments to Polynomials and Their Applications
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
• Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
• Signatures of Correct Computation
• Succinct Non-interactive Arguments via Linear Interactive Proofs
• Vector Commitments and Their Applications
• Streaming Authenticated Data Structures
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Verifiable Delegation of Computation over Large Datasets
• Zero-Knowledge Sets with Short Proofs
• On the Size of Pairing-Based Non-interactive Arguments
• Functional commitments for all functions, with transparent setup and from SIS
• Succinct vector, polynomial, and functional commitments from lattices
• Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
• Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
• Additive-homomorphic functional commitments and applications to homomorphic signatures
• Lattice-based succinct arguments from vanishing polynomials (extended abstract)
• Correlation intractability and SNARGs from sub-exponential DDH
• Boosting batch arguments and RAM delegation
• Chainable functional commitments for unbounded-depth circuits
• Lattice-based functional commitments: fast verification and cryptanalysis

Related Items (1)

Fully-succinct multi-key homomorphic signatures from standard assumptions

This page was built for publication: Succinct functional commitments for circuits from \(k\)-\textsf{Lin}