A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+A60
@@ Property / Mathematics Subject Classification ID: 94A60 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+P25
@@ Property / Mathematics Subject Classification ID: 68P25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6690816
@@ Property / zbMATH DE Number: 6690816 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+multiparty computation
@@ Property / zbMATH Keywords: multiparty computation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+perfect security
@@ Property / zbMATH Keywords: perfect security / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+BGW
@@ Property / zbMATH Keywords: BGW / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+cryptographic protocols
@@ Property / zbMATH Keywords: cryptographic protocols / 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/s00145-015-9214-4
+Normal rank
@@ Property / OpenAlex ID @@
+W1245637661
@@ Property / OpenAlex ID: W1245637661 / rank @@
+Normal rank
@@ Property / cites work @@
+A full proof of the BGW protocol for perfectly secure multiparty computation
+Normal rank
@@ Property / cites work @@
+Perfectly-Secure Multiplication for Any t &lt; n/3
@@ Property / cites work: Perfectly-Secure Multiplication for Any t < n/3 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3212258
@@ Property / cites work: Q3212258 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4035733
@@ Property / cites work: Q4035733 / rank @@
+Normal rank
@@ Property / cites work @@
+Perfectly-Secure MPC with Linear Communication Complexity
+Normal rank
@@ Property / cites work @@
+Resilient-optimal interactive consistency in constant time
+Normal rank
@@ Property / cites work @@
+Adaptive versus non-adaptive security of multi-party protocols
+Normal rank
@@ Property / cites work @@
+Security and composition of multiparty cryptographic protocols
+Normal rank
@@ Property / cites work @@
+Q4228521
@@ Property / cites work: Q4228521 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737255
@@ Property / cites work: Q4737255 / rank @@
+Normal rank
@@ Property / cites work @@
+Universally composable two-party and multi-party secure computation
+Normal rank
@@ Property / cites work @@
+Q4536795
@@ Property / cites work: Q4536795 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
+Normal rank
@@ Property / cites work @@
+Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
+Normal rank
@@ Property / cites work @@
+Foundations of Cryptography
@@ Property / cites work: Foundations of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Q4279565
@@ Property / cites work: Q4279565 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic encryption
@@ Property / cites work: Probabilistic encryption / rank @@
+Normal rank
@@ Property / cites work @@
+Information-Theoretically Secure Protocols and Security under Composition
+Normal rank
@@ Property / cites work @@
+The Byzantine Generals Problem
@@ Property / cites work: The Byzantine Generals Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Sequential composition of protocols without simultaneous termination
+Normal rank
@@ Property / cites work @@
+Reaching Agreement in the Presence of Faults
@@ Property / cites work: Reaching Agreement in the Presence of Faults / rank @@
+Normal rank
@@ Property / cites work @@
+How to share a secret
@@ Property / cites work: How to share a secret / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:514468