1. 2015年论文《Composable & Modular Anonymous Credentials:Definitions and Practical Constructions》
2015年论文《Composable & Modular Anonymous Credentials:Definitions and Practical Constructions》第三节中提到了通过构建Lagrange basis polynomial来实现vector commitment的算法：
2. 2016年论文《Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions》
2016年论文《Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions》中提出：
该论文中将vector commitments转换为了更通用的线性函数的functional commitments。
参考资料：
[1] 2015年论文《Composable & Modular Anonymous Credentials:Definitions and Practical Constructions》
[2] 2016年论文《Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions》
[3] 2012论文摘要《Vector Commitments with Efficient Proofs》
[4] 2019年论文《Subvector Commitments with Application to Succinct Arguments》