Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over $\mathbb{Z}/p^k\mathbb{Z} $ (Q2691584): Difference between revisions

@@ Property / author @@
-Ivan B. Damgård
@@ Property / author: Ivan B. Damgård / rank @@
-Normal rank
@@ Property / author @@
-Daniel E. Escudero
@@ Property / author: Daniel E. Escudero / rank @@
-Normal rank
@@ Property / author @@
-Xing, Chaoping
@@ Property / author: Xing, Chaoping / rank @@
-Normal rank
@@ Property / author @@
+Ivan B. Damgård
@@ Property / author: Ivan B. Damgård / rank @@
+Normal rank
@@ Property / author @@
+Daniel E. Escudero
@@ Property / author: Daniel E. Escudero / rank @@
+Normal rank
@@ Property / author @@
+Xing, Chaoping
@@ Property / author: Xing, Chaoping / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-030-64840-4_6
+Normal rank
@@ Property / OpenAlex ID @@
+W3111032938
@@ Property / OpenAlex ID: W3111032938 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
+Normal rank
@@ Property / cites work @@
+Theory of Cryptography
@@ Property / cites work: Theory of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Perfectly-Secure MPC with Linear Communication Complexity
+Normal rank
@@ Property / cites work @@
+Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
+Normal rank
@@ Property / cites work @@
+Zero-knowledge proofs on secret-shared data via fully linear PCPs
+Normal rank
@@ Property / cites work @@
+Amortized complexity of information-theoretically secure MPC revisited
+Normal rank
@@ Property / cites work @@
+Secure Computation from Random Error Correcting Codes
+Normal rank
@@ Property / cites work @@
+Fast large-scale honest-majority MPC for malicious adversaries
+Normal rank
@@ Property / cites work @@
+\(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
+Normal rank
@@ Property / cites work @@
+Q3374918
@@ Property / cites work: Q3374918 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4434901
@@ Property / cites work: Q4434901 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication lower bounds for statistically secure MPC, with or without preprocessing
+Normal rank
@@ Property / cites work @@
+Scalable and Unconditionally Secure Multiparty Computation
+Normal rank
@@ Property / cites work @@
+A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
+Normal rank
@@ Property / cites work @@
+Circuits resilient to additive attacks with applications to secure computation
+Normal rank
@@ Property / cites work @@
+Communication-efficient unconditional MPC with guaranteed output delivery
+Normal rank
@@ Property / cites work @@
+Guaranteed output delivery comes free in honest majority MPC
+Normal rank
@@ Property / cites work @@
+The Byzantine generals problem
@@ Property / cites work: The Byzantine generals problem / rank @@
+Normal rank
@@ Property / cites work @@
+Minimising communication in honest-majority MPC by batchwise multiplication verification
+Normal rank
@@ Property / cites work @@
+Transitive and self-dual codes attaining the Tsfasman-Vla/spl breve/dut$80-Zink bound
+Normal rank
@@ Property / cites work @@
+Algebraic Function Fields and Codes
@@ Property / cites work: Algebraic Function Fields and Codes / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2691584

Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584): Difference between revisions

Latest revision as of 19:13, 31 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)