Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions

DOI10.4230/LIPICS.ICALP.2016.30zbMATH Open1377.94061MaRDI QIDQ4598166FDOQ4598166

Authors: Benoît Libert, Somindu C. Ramanna, Moti Yung 

Publication date: 19 December 2017

Recommendations

• Inner product functional commitments with constant-size public parameters and openings
• 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

zbMATH Keywords

cryptographyprovable securitycommitment schemesaccumulatorssimple assumptionsfunctional commitmentspairing-based

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (35)

• A sub-linear lattice-based submatrix commitment scheme
• Constant-Size Commitments to Polynomials and Their Applications
• Chainable functional commitments for unbounded-depth circuits
• Verifiable Inner Product Encryption Scheme
• Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
• Lattice-based functional commitments: fast verification and cryptanalysis
• Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys
• PointProofs, revisited
• Succinct vector, polynomial, and functional commitments from lattices
• Linear-map vector commitments and their practical applications
• Functional commitments for all functions, with transparent setup and from SIS
• Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
• Additive-homomorphic functional commitments and applications to homomorphic signatures
• Tightly Secure IBE Under Constant-Size Master Public Key
• On the impossibility of algebraic NIZK in pairing-free groups
• Verifiable Functional Encryption
• \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
• Updatable, aggregatable, succinct mercurial vector commitment from lattice
• Witness encryption for succinct functional commitments and applications
• Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
• Inner product functional commitments with constant-size public parameters and openings
• Concise Mercurial Subvector Commitments: Definitions and Constructions
• UC Updatable Databases and Applications
• Functional commitments for arbitrary circuits of bounded sizes
• Fully-succinct multi-key homomorphic signatures from standard assumptions
• Certifying private probabilistic mechanisms
• FRIDA: data availability sampling from FRI
• Greyhound: fast polynomial commitments from lattices
• Function-Dependent Commitments for Verifiable Multi-party Computation
• KVaC: key-value commitments for blockchains and beyond
• Succinct functional commitment for a large class of arithmetic circuits
• On the impossibility of algebraic vector commitments in pairing-free groups
• Zero-Knowledge Accumulators and Set Algebra
• Vector and functional commitments from lattices
• Committed private information retrieval

This page was built for publication: Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598166)