Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability
Authors:
- Jonathan BootleJBJonathan Bootle
- Andrea CerulliACAndrea Cerulli
- Essam GhadafiEGEssam Ghadafi
- Jens GrothJGJens Groth
- Mohammad HajiabadiMHMohammad Hajiabadi
- Sune K. JakobsenSJSune K. Jakobsen
- 17 November 2017
- book chapter
- Published by Springer Nature
- p. 336-365
Abstract
No abstract availableThis publication has 48 references indexed in Scilit:
- Quadratic Span Programs and Succinct NIZKs without PCPs2013
- On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative RelationsLecture Notes in Computer Science, 2012
- Linear Algebra with Sub-linear Zero-Knowledge Arguments2009
- Zero-Knowledge Proofs from Secure Multiparty ComputationSIAM Journal on Computing, 2009
- Interactive PCP2008
- Linear-Time Encodable/Decodable Codes With Near-Optimal RateIEEE Transactions on Information Theory, 2005
- Simulatable Commitments and Efficient Concurrent Zero-KnowledgeLecture Notes in Computer Science, 2003
- Round-Optimal Zero-Knowledge Arguments Based on Any One-Way Function1997
- Efficient signature generation by smart cardsJournal of Cryptology, 1991
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962