Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
From MaRDI portal
Publication:6132422
DOI10.1007/978-3-031-22966-4_17zbMath1519.94125MaRDI QIDQ6132422
Riddhi Ghosal, Paul Lou, Amit Sahai
Publication date: 16 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
- Decoding of Reed Solomon codes beyond the error-correction bound
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- From obfuscation to the security of Fiat-Shamir for proofs
- Order-C secure multiparty computation for highly repetitive circuits
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Unconditional communication-efficient MPC via Hall's marriage theorem
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On the Correlation Intractability of Obfuscated Pseudorandom Functions
- Polynomial Codes Over Certain Finite Fields
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- New lattice based cryptographic constructions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Foundations of Cryptography
- The knowledge complexity of interactive proof-systems
- Fiat-Shamir: from practice to theory
- Scalable Secure Multiparty Computation
- Algorithmic Results in List Decoding
- Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
This page was built for publication: Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
