Cryptology ePrint Archive: Report 2019/839

Statistical Zap Arguments from Quasi-Polynomial LWE

Abhishek Jain and Zhengzhong Jin

Abstract: We give the first construction of statistical Zaps. Our construction satisfies computational soundness and relies on the quasi-polynomial hardness of learning with errors assumption.

Category / Keywords: foundations / ZAPs, interactive proofs, argument, witness indistinguishable, LWE, quasi-polynomial

Date: received 18 Jul 2019

Contact author: zjin12 at jhu edu, abhishek at cs jhu edu

Available format(s): PDF | BibTeX Citation

Version: 20190719:134712 (All versions of this report)

Short URL: ia.cr/2019/839