From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- 8 January 2012
- proceedings article
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 326-349
- https://doi.org/10.1145/2090236.2090263
Abstract
No abstract availableFunding Information
- Seventh Framework Programme (240258)
This publication has 40 references indexed in Scilit:
- Polylogarithmic two-round argument systemsJournal of Mathematical Cryptology, 2008
- Short PCPs with Polylog Query ComplexitySIAM Journal on Computing, 2008
- Worst‐Case to Average‐Case Reductions Based on Gaussian MeasuresSIAM Journal on Computing, 2007
- New lattice-based cryptographic constructionsJournal of the ACM, 2004
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- On the complexity of interactive proofs with bounded communicationInformation Processing Letters, 1998
- Natural ProofsJournal of Computer and System Sciences, 1997
- IP = PSPACEJournal of the ACM, 1992
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Does co-NP have short interactive proofs?Information Processing Letters, 1987