Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
From MaRDI portal
Publication:6132422
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
Cites work
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 4037759 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- Algorithmic Results in List Decoding
- Decoding of Reed Solomon codes beyond the error-correction bound
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Fiat-Shamir: from practice to theory
- Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
- Foundations of Cryptography
- From obfuscation to the security of Fiat-Shamir for proofs
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- New lattice based cryptographic constructions
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On the correlation intractability of obfuscated pseudorandom functions
- Order-C secure multiparty computation for highly repetitive circuits
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Polynomial Codes Over Certain Finite Fields
- Scalable Secure Multiparty Computation
- The Knowledge Complexity of Interactive Proof Systems
- The knowledge complexity of interactive proof-systems
- Unconditional communication-efficient MPC via Hall's marriage theorem
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
Cited in
(7)- Non-interactive zero-knowledge from LPN and MQ
- Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head}
- Towards non-interactive zero-knowledge for NP from LWE
- Multi-theorem preprocessing NIZKs from lattices
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- 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
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)
