A sub-linear lattice-based submatrix commitment scheme

DOI10.1007/978-3-030-68890-5_5MaRDI QIDQ831634zbMATH OpenOpenAlexFDO

Authors Huang Lin

Publication date 24 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-68890-5_5

zbMATH Keywords

homomorphic encryptionlattice-based cryptographyposition bindingsubvector commitment

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• Batching techniques for accumulators with applications to IOPs and stateless blockchains
• Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
• Homomorphic evaluation of the AES circuit
• More efficient commitments from structured lattice assumptions
• Subvector commitments with application to succinct arguments
• Towards practical lattice-based one-time linkable ring signatures
• Vector commitments and their applications

This page was built for publication: A sub-linear lattice-based submatrix commitment scheme

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