Concretely Efficient Lattice-based Polynomial Commitment from Standard Assumptions

ePrint Report: Concretely Efficient Lattice-based Polynomial Commitment from Standard Assumptions

Intak Hwang, Jinyeong Seo, Yongsoo Song

Polynomial commitment is a crucial cryptographic primitive in constructing zkSNARKs.
To date, most practical constructions are either insecure against quantum adversaries or lack homomorphic properties, which are useful in recursive compositions of SNARKs.
Recently, lattice-based constructions from functional commitments have drawn attention for possessing all the desirable properties, but they yet lack concrete efficiency, and their extractability, which is essential for SNARKs, requires further …

adversaries cryptographic eprint report insecure quantum report seo song standard zksnarks