Lattice-based polynomial commitments: towards asymptotic and concrete efficiency

DOI10.1007/s00145-024-09511-8zbMath1546.94073MaRDI QIDQ6595849

Ngoc Khanh Nguyen, Giacomo Fenzi, Hossein Moghaddas

Publication date: 30 August 2024

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

latticesrandom oracle modelzero-knowledgesuccinct argumentspolynomial commitments

Mathematics Subject Classification ID

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

This page was built for publication: Lattice-based polynomial commitments: towards asymptotic and concrete efficiency