Towards non-interactive zero-knowledge for NP from LWE

DOI10.1007/978-3-030-17259-6_16MaRDI QIDQ2289441zbMATHOpenAlexFDO

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

zbMATH Keywords

learning with errors (LWE)non-interactive zero-knowledge (NIZK)

Mathematics Subject Classification ID

Cryptography (94A60)

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

(12)

• Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
• Toward non-interactive zero-knowledge proofs for NP from LWE
• Non-interactive zero-knowledge from LPN and MQ
• From laconic zero-knowledge to public-key cryptography. Extended abstract
• Compact designated verifier NIZKs from the CDH assumption without pairings
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
• Multi-theorem preprocessing NIZKs from lattices
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
• Simulation-sound arguments for LWE and applications to KDM-CCA2 security
• Multi-theorem preprocessing NIZKs from lattices
• 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)