Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head

DOI10.1007/978-3-031-22966-4_17zbMATH Open1519.94125MaRDI QIDQ6132422FDOQ6132422

Authors: Riddhi Ghosal, Paul Lou, Amit Sahai 

Publication date: 16 August 2023

Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)

Recommendations

• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Towards non-interactive zero-knowledge for NP from LWE
• Toward non-interactive zero-knowledge proofs for NP from LWE
• Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
• NIZK from LPN and trapdoor hash via correlation intractability for approximable relations

zbMATH Keywords

honest-verifier protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Polynomial Codes Over Certain Finite Fields
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Title not available (Why is that?)
• Foundations of Cryptography
• The knowledge complexity of interactive proof-systems
• Title not available (Why is that?)
• The Knowledge Complexity of Interactive Proof Systems
• Decoding of Reed Solomon codes beyond the error-correction bound
• New lattice based cryptographic constructions
• Title not available (Why is that?)
• Scalable Secure Multiparty Computation
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption
• From obfuscation to the security of Fiat-Shamir for proofs
• On the Correlation Intractability of Obfuscated Pseudorandom Functions
• Order-C secure multiparty computation for highly repetitive circuits
• NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
• Fiat-Shamir: from practice to theory
• Algorithmic Results in List Decoding
• Unconditional communication-efficient MPC via Hall's marriage theorem
• Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)

Cited In (3)

• Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
• NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
• Non-interactive zero-knowledge from LPN and MQ

This page was built for publication: Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132422)