Updatable, Aggregatable, Succinct Mercurial Vector Commitment from Lattice

[1]  Ertem Nusret Tas,et al.  Vector Commitments with Efficient Updates , 2023, AFT.

[2]  Zhenfei Zhang,et al.  Pointproofs: Aggregating Proofs for Multiple Vector Commitments , 2020, IACR Cryptol. ePrint Arch..

[3]  Giulio Malavolta,et al.  Subvector Commitments with Application to Succinct Arguments , 2019, CRYPTO.

[4]  Huaxiong Wang,et al.  Zero-Knowledge Elementary Databases with More Expressive Queries , 2019, Public Key Cryptography.

[5]  Somindu C. Ramanna,et al.  Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions , 2016, ICALP.

[6]  Dario Fiore,et al.  Vector Commitments and Their Applications , 2013, Public Key Cryptography.

[7]  Chris Peikert,et al.  Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller , 2012, IACR Cryptol. ePrint Arch..

[8]  Moti Yung,et al.  Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs , 2010, TCC.

[9]  Craig Gentry,et al.  Trapdoors for hard lattices and new cryptographic constructions , 2008, IACR Cryptol. ePrint Arch..

[10]  Mario Di Raimondo,et al.  Zero-Knowledge Sets With Short Proofs , 2008, IEEE Transactions on Information Theory.

[11]  Jung Hee Cheon,et al.  Security Analysis of the Strong Diffie-Hellman Problem , 2006, EUROCRYPT.

[12]  Ivan Visconti,et al.  Mercurial Commitments: Minimal Assumptions and Efficient Constructions , 2006, TCC.

[13]  Moses D. Liskov.  Updatable Zero-Knowledge Databases , 2005, ASIACRYPT.

[14]  Leonid Reyzin,et al.  Mercurial Commitments with Applications to Zero-Knowledge Sets , 2005, Journal of Cryptology.

[15]  Silvio Micali,et al.  Zero-knowledge sets , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[16]  Moni Naor,et al.  On Cryptographic Assumptions and Challenges , 2003, CRYPTO.

[17]  Leonid A. Levin,et al.  A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..

[18]  Miklós Ajtai,et al.  Generating hard instances of lattice problems (extended abstract) , 1996, STOC '96.

[19]  Oleksandra Lapiha,et al.  SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions , 2023, IACR Cryptol. ePrint Arch..

[20]  Russell W. F. Lai,et al.  Chainable Functional Commitments for Unbounded-Depth Circuits , 2023, TCC.

[21]  Ben Fisch,et al.  Orbweaver: Succinct Linear Functional Commitments from Lattices , 2023, CRYPTO.

[22]  Martin R. Albrecht,et al.  Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable , 2022, IACR Cryptol. ePrint Arch..

[23]  Leo de Castro,et al.  Functional Commitments for All Functions, with Transparent Setup , 2022, IACR Cryptol. ePrint Arch..

[24]  Guomin Yang,et al.  Concise Mercurial Subvector Commitments: Definitions and Constructions , 2021, ACISP.

[25]  Chris Peikert,et al.  Vector and Functional Commitments from Lattices , 2021, IACR Cryptol. ePrint Arch..

[26]  Damien Stehlé,et al.  Can Round-Optimal Lattice-Based Blind Signatures be Practical? , 2021, IACR Cryptol. ePrint Arch..