A post quantum vector commitment scheme with efficient insertions and deletions

DOI10.1007/978-3-032-32560-0_5MaRDI QIDQ7411895zbMATH OpenFDO

Authors Vir Pathak, Sushmita Ruj

Publication date 2027

Full work available at URL https://doi.org/10.1007/978-3-032-32560-0_5

zbMATH Keywords

multiparty dynamic functionalitypost-quantum cryptographyvector commitments

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• Aggregatable subvector commitments for stateless cryptocurrencies
• Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
• Functional commitments for all functions, with transparent setup and from SIS
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
• Lattice-based functional commitments: fast verification and cryptanalysis
• Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
• Linear-map vector commitments and their practical applications
• Partial lattice trapdoors: how to split lattice trapdoors, literally
• Signatures of correct computation
• Subvector commitments with application to succinct arguments
• Succinct vector, polynomial, and functional commitments from lattices
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Vector commitments and their applications

This page was built for publication: A post quantum vector commitment scheme with efficient insertions and deletions

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