Multi-theorem Preprocessing NIZKs from Lattices
- 1 July 2020
- journal article
- research article
- Published by Springer Nature in Journal of Cryptology
- Vol. 33 (3) , 619-702
Abstract
No abstract availableKeywords
This publication has 100 references indexed in Scilit:
- Practical Homomorphic MACs for Arithmetic Circuits2013
- Enhancements of Trapdoor PermutationsJournal of Cryptology, 2012
- Generating Shorter Bases for Hard Random LatticesTheory of Computing Systems, 2010
- Zero-Knowledge Proofs from Secure Multiparty ComputationSIAM Journal on Computing, 2009
- Worst‐Case to Average‐Case Reductions Based on Gaussian MeasuresSIAM Journal on Computing, 2007
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection FactorSIAM Journal on Computing, 2004
- An Efficient Noninteractive Zero-Knowledge Proof System for NP with General AssumptionsJournal of Cryptology, 1998
- Definitions and properties of zero-knowledge proof systemsJournal of Cryptology, 1994
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- Blind Signatures for Untraceable Payments1983