Dory: Efficient, Transparent Arguments for Generalised Inner Products and Polynomial Commitments
Author:
- 4 November 2021
- book chapter
- Published by Springer Nature
- p. 1-34
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Structure-Preserving Signatures and Commitments to Group Elements2010
- Security Estimates for Quadratic Field Based CryptosystemsLecture Notes in Computer Science, 2010
- Constant-Size Commitments to Polynomials and Their Applications2010
- How to Hash into Elliptic Curves2009
- Linear Algebra with Sub-linear Zero-Knowledge Arguments2009
- Pairings for cryptographersDiscrete Applied Mathematics, 2008
- On Compressible Pairings and Their Computation2008
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle2008
- On Diophantine Complexity and Statistical Zero-Knowledge Arguments2003
- Computational Aspects of NUCOMPLecture Notes in Computer Science, 2002