From Polynomial IOP and Commitments to Non-malleable zkSNARKs
- 27 November 2023
- book chapter
- Published by Springer Nature
- p. 455-485
Abstract
No abstract availableKeywords
This publication has 44 references indexed in Scilit:
- Subtleties in the Definition of IND-CCA: When and How Should Challenge Decryption Be Disallowed?Journal of Cryptology, 2013
- Quadratic Span Programs and Succinct NIZKs without PCPs2013
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments2012
- On the Non-malleability of the Fiat-Shamir Transform2012
- Leakage-Resilient Zero Knowledge2011
- Efficient Public-Key Cryptography in the Presence of Key Leakage2010
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments2010
- Constant-Size Commitments to Polynomials and Their Applications2010
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors2005
- Short Signatures Without Random Oracles2004