Towards non-interactive zero-knowledge for NP from LWE
From MaRDI portal
Publication:2289441
DOI10.1007/978-3-030-17259-6_16zbMATH Open1447.94055OpenAlexW2810750723MaRDI QIDQ2289441FDOQ2289441
Authors: Ron D. Rothblum, Adam Sealfon, Katerina Sotiraki 
Publication date: 28 January 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-17259-6_16
Recommendations
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- New techniques for noninteractive zero-knowledge
- Perfect Non-interactive Zero Knowledge for NP
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
Cited In (11)
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Multi-theorem preprocessing NIZKs from lattices
- Simulation-sound arguments for LWE and applications to KDM-CCA2 security
- Multi-theorem preprocessing NIZKs from lattices
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- From laconic zero-knowledge to public-key cryptography. Extended abstract
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
- On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
This page was built for publication: Towards non-interactive zero-knowledge for NP from LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289441)
