mrNISC from LWE with polynomial modulus (Q6116180): Difference between revisions

@@ Property / cites work @@
+Two-Round Secure MPC from Indistinguishability Obfuscation
+Normal rank
@@ Property / cites work @@
+Two Round Multiparty Computation via Multi-key FHE
+Normal rank
@@ Property / cites work @@
+Two-round multiparty secure computation from minimal assumptions
+Normal rank
@@ Property / cites work @@
+\(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
+Normal rank
@@ Property / cites work @@
+Degree 2 is complete for the round-complexity of malicious MPC
+Normal rank
@@ Property / cites work @@
+Two round information-theoretic MPC with malicious security
+Normal rank
@@ Property / cites work @@
+Mr NISC: multiparty reusable non-interactive secure computation
+Normal rank
@@ Property / cites work @@
+Multiparty reusable non-interactive secure computation from LWE
+Normal rank
@@ Property / cites work @@
+Unbounded multi-party computation from learning with errors
+Normal rank
@@ Property / cites work @@
+On lattices, learning with errors, random linear codes, and cryptography
+Normal rank
@@ Property / cites work @@
+Pseudorandomness of ring-LWE for any ring and modulus
+Normal rank
@@ Property / cites work @@
+On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
+Normal rank
@@ Property / cites work @@
+Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
+Normal rank
@@ Property / cites work @@
+Leveled Fully Homomorphic Signatures from Standard Lattices
+Normal rank
@@ Property / cites work @@
+Two-message statistically sender-private OT from LWE
+Normal rank
@@ Property / cites work @@
+Lattice-based FHE as secure as PKE
@@ Property / cites work: Lattice-based FHE as secure as PKE / rank @@
+Normal rank
@@ Property / cites work @@
+Computationally private randomizing polynomials and their applications
+Normal rank
@@ Property / cites work @@
+Q3729902
@@ Property / cites work: Q3729902 / rank @@
+Normal rank
@@ Property / cites work @@
+Noninteractive zero knowledge for NP from (Plain) Learning With Errors
+Normal rank
@@ Property / cites work @@
+Definitions and properties of zero-knowledge proof systems
+Normal rank
@@ Property / cites work @@
+Reusable two-round MPC from DDH
@@ Property / cites work: Reusable two-round MPC from DDH / rank @@
+Normal rank
@@ Property / cites work @@
+Reusable Two-Round MPC from LPN
@@ Property / cites work: Reusable Two-Round MPC from LPN / rank @@
+Normal rank
@@ Property / cites work @@
+Public-key cryptosystems from the worst-case shortest vector problem
+Normal rank
@@ Property / cites work @@
+Classical hardness of learning with errors
@@ Property / cites work: Classical hardness of learning with errors / rank @@
+Normal rank