Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials 学习笔记
1. 引言 Bootle和Groth 2018年论文《Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials》，发表于IACR-PKC-2018。 基于discrete logarithm assumption。 本文主要关注对 relations between commitments and field eleme
相关文章
- 1. Efficient polynomial commitment schemes for multiple points and polynomials学习笔记
- 2. Hyrax: Doubly-efficient zkSNARKs without trusted setup学习笔记
- 3. Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting学习笔记
- 4. Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments 学习笔记
- 5. Efficient Modular NIZK Arguments from Shift and Product学习笔记
- 6. Efficient Zero-Knowledge Argument for Correctness of a Shuffle学习笔记
- 7. JavaScript 学习笔记— —Arguments
- 8. 论文笔记-IGCV3：Interleaved Low-Rank Group Convolutions for Efficient Deep Neural Networks
- 9. 《Efficient Batch Processing for Multiple Keyword Queries on Graph Data》——论文笔记
- 10. Batch Normalization 学习笔记
- 更多相关文章...
- • 您已经学习了 XML Schema，下一步学习什么呢？ - XML Schema 教程
- • 我们已经学习了 SQL，下一步学习什么呢？ - SQL 教程
- • Tomcat学习笔记（史上最全tomcat学习笔记）
- • Kotlin学习（一）基本语法
相关标签/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
欢迎关注本站公众号,获取更多信息
相关文章
- 1. Efficient polynomial commitment schemes for multiple points and polynomials学习笔记
- 2. Hyrax: Doubly-efficient zkSNARKs without trusted setup学习笔记
- 3. Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting学习笔记
- 4. Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments 学习笔记
- 5. Efficient Modular NIZK Arguments from Shift and Product学习笔记
- 6. Efficient Zero-Knowledge Argument for Correctness of a Shuffle学习笔记
- 7. JavaScript 学习笔记— —Arguments
- 8. 论文笔记-IGCV3：Interleaved Low-Rank Group Convolutions for Efficient Deep Neural Networks
- 9. 《Efficient Batch Processing for Multiple Keyword Queries on Graph Data》——论文笔记
- 10. Batch Normalization 学习笔记