mrNISC from LWE with polynomial modulus
From MaRDI portal
Publication:6134835
Recommendations
Cites work
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Classical hardness of learning with errors
- Computationally private randomizing polynomials and their applications
- Degree 2 is complete for the round-complexity of malicious MPC
- Fully homomorphic encryption using ideal lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Lattice-based FHE as secure as PKE
- Leveled fully homomorphic signatures from standard lattices
- Mr NISC: multiparty reusable non-interactive secure computation
- Multiparty reusable non-interactive secure computation from LWE
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On lattices, learning with errors, random linear codes, and cryptography
- On perfect correctness in (lockable) obfuscation
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- Two round information-theoretic MPC with malicious security
- Two round multiparty computation via multi-key FHE
- Two-message statistically sender-private OT from LWE
- Two-round multiparty secure computation from minimal assumptions
- Two-round secure MPC from indistinguishability obfuscation
- Unbounded multi-party computation from learning with errors
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
Cited in
(4)
This page was built for publication: mrNISC from LWE with polynomial modulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134835)