Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting学习笔记
1. 引言 Bootle和Groth等人2016年论文《Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting》。 在本论文中，主要为 (只有加法门和乘法门的) arithmetic circcuit satisfiability 提供了一种零知识证明算法，具有的communica
相关文章
- 1. Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials 学习笔记
- 2. Hyrax: Doubly-efficient zkSNARKs without trusted setup学习笔记
- 3. Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments 学习笔记
- 4. Efficient polynomial commitment schemes for multiple points and polynomials学习笔记
- 5. Efficient Modular NIZK Arguments from Shift and Product学习笔记
- 6. 《Discrete Mathematic with Applications》读书笔记一
- 7. Efficient Zero-Knowledge Argument for Correctness of a Shuffle学习笔记
- 8. Proof Systems for General Statements about Discrete Logarithms 学习笔记
- 9. JavaScript 学习笔记— —Arguments
- 10. Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists 学习笔记
- 更多相关文章...
- • Swift for-in 循环 - Swift 教程
- • 您已经学习了 XML Schema，下一步学习什么呢？ - XML Schema 教程
- • Tomcat学习笔记（史上最全tomcat学习笔记）
- • Kotlin学习（一）基本语法
相关标签/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
最新文章
欢迎关注本站公众号,获取更多信息
相关文章
- 1. Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials 学习笔记
- 2. Hyrax: Doubly-efficient zkSNARKs without trusted setup学习笔记
- 3. Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments 学习笔记
- 4. Efficient polynomial commitment schemes for multiple points and polynomials学习笔记
- 5. Efficient Modular NIZK Arguments from Shift and Product学习笔记
- 6. 《Discrete Mathematic with Applications》读书笔记一
- 7. Efficient Zero-Knowledge Argument for Correctness of a Shuffle学习笔记
- 8. Proof Systems for General Statements about Discrete Logarithms 学习笔记
- 9. JavaScript 学习笔记— —Arguments
- 10. Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists 学习笔记