상세 보기
A Brief Survey of Two Recent Polynomial Commitment Schemes from Lattices
- Ban, Minuk;
- Lee, Hyung Tae
SCOPUS
0초록
A polynomial commitment scheme (PCS) enables a prover to commit to a polynomial and later prove the correctness of its evaluation without revealing the polynomial. Although discrete logarithm-based PCSs offer succinct proofs, they are not quantum-safe. Lattice-based PCSs provide post-quantum security and additive homomorphism, making them suitable for applications such as zero-knowledge proofs and secure multiparty computation. In this article, we review two recent lattice-based PCSs, Greyhound and HyperWolf, both relying on the Module-SIS assumption but differing in target polynomial classes and proof techniques. In particular, Greyhound achieves a smaller proof size O(log log N) through folding and LaBRADOR proofs, while HyperWolf supports univariate and multilinear polynomials with lower verifier cost O(log N) using hypercube evaluation.
키워드
- 제목
- A Brief Survey of Two Recent Polynomial Commitment Schemes from Lattices
- 저자
- Ban, Minuk; Lee, Hyung Tae
- 발행일
- 2025
- 유형
- Conference Paper
- 저널명
- International Conference on ICT Convergence
- 페이지
- 898 ~ 903
- 언어
- ENG
- 출판사
- IEEE Computer Society
- 발행국가
- 미국
- 분량
- 6 페이지
- ISSN
- E 2162-1241
P 2162-1233