mrNISC from LWE with polynomial modulus
From MaRDI portal
Publication:6116180
DOI10.1016/j.ic.2023.105043OpenAlexW4366824800MaRDI QIDQ6116180
Publication date: 17 July 2023
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2023.105043
Cites Work
- Unnamed Item
- Definitions and properties of zero-knowledge proof systems
- Two-message statistically sender-private OT from LWE
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- Multiparty reusable non-interactive secure computation from LWE
- Unbounded multi-party computation from learning with errors
- Reusable two-round MPC from DDH
- Mr NISC: multiparty reusable non-interactive secure computation
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Degree 2 is complete for the round-complexity of malicious MPC
- Two round information-theoretic MPC with malicious security
- Computationally private randomizing polynomials and their applications
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Lattice-based FHE as secure as PKE
- Pseudorandomness of ring-LWE for any ring and modulus
- Reusable Two-Round MPC from LPN
- Public-key cryptosystems from the worst-case shortest vector problem
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Classical hardness of learning with errors
- Two Round Multiparty Computation via Multi-key FHE
- Two-Round Secure MPC from Indistinguishability Obfuscation
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: mrNISC from LWE with polynomial modulus
