Broadcast-optimal two-round MPC (Q2119034): Difference between revisions

@@ Property / cites work @@
+Round-optimal secure multiparty computation with honest majority
+Normal rank
@@ Property / cites work @@
+Two round information-theoretic MPC with malicious security
+Normal rank
@@ Property / cites work @@
+Perfect secure computation in two rounds
@@ Property / cites work: Perfect secure computation in two rounds / rank @@
+Normal rank
@@ Property / cites work @@
+Degree 2 is complete for the round-complexity of malicious MPC
+Normal rank
@@ Property / cites work @@
+Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
+Normal rank
@@ Property / cites work @@
+Q4343426
@@ Property / cites work: Q4343426 / rank @@
+Normal rank
@@ Property / cites work @@
+Resilient-optimal interactive consistency in constant time
+Normal rank
@@ Property / cites work @@
+\(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
+Normal rank
@@ Property / cites work @@
+Two-round adaptively secure multiparty computation from standard assumptions
+Normal rank
@@ Property / cites work @@
+Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
+Normal rank
@@ Property / cites work @@
+Security and composition of multiparty cryptographic protocols
+Normal rank
@@ Property / cites work @@
+Secure computation with honest-looking parties (extended abstract)
+Normal rank
@@ Property / cites work @@
+Better Two-Round Adaptive Multi-party Computation
@@ Property / cites work: Better Two-Round Adaptive Multi-party Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Simple constant-time consensus protocols in realistic failure models
+Normal rank
@@ Property / cites work @@
+Fairness versus guaranteed output delivery in secure multiparty computation
+Normal rank
@@ Property / cites work @@
+Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
+Normal rank
@@ Property / cites work @@
+Characterization of secure multiparty computation without broadcast
+Normal rank
@@ Property / cites work @@
+Probabilistic termination and composability of cryptographic protocols
+Normal rank
@@ Property / cites work @@
+Adaptively secure MPC with sublinear communication complexity
+Normal rank
@@ Property / cites work @@
+Spooky Encryption and Its Applications
@@ Property / cites work: Spooky Encryption and Its Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Authenticated Algorithms for Byzantine Agreement
@@ Property / cites work: Authenticated Algorithms for Byzantine Agreement / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for the time to assure interactive consistency
+Normal rank
@@ Property / cites work @@
+Detectable byzantine agreement secure against faulty majorities
+Normal rank
@@ Property / cites work @@
+Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
+Normal rank
@@ Property / cites work @@
+Two-round multiparty secure computation from minimal assumptions
+Normal rank
@@ Property / cites work @@
+Two-Round Secure MPC from Indistinguishability Obfuscation
+Normal rank
@@ Property / cites work @@
+Two-round MPC: information-theoretic and black-box
+Normal rank
@@ Property / cites work @@
+Two-round multiparty secure computation minimizing public key operations
+Normal rank
@@ Property / cites work @@
+The round complexity of verifiable secret sharing and secure multicast
+Normal rank
@@ Property / cites work @@
+Q4409117
@@ Property / cites work: Q4409117 / rank @@
+Normal rank
@@ Property / cites work @@
+Foundations of Cryptography
@@ Property / cites work: Foundations of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Secure multi-party computation without agreement
@@ Property / cites work: Secure multi-party computation without agreement / rank @@
+Normal rank
@@ Property / cites work @@
+Constant-Round MPC with Fairness and Guarantee of Output Delivery
+Normal rank
@@ Property / cites work @@
+Secure Computation on the Web: Computing without Simultaneous Interaction
+Normal rank
@@ Property / cites work @@
+Low cost constant round MPC combining BMR and oblivious transfer
+Normal rank
@@ Property / cites work @@
+Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
+Normal rank
@@ Property / cites work @@
+Player simulation and general adversary structures in perfect multiparty computation
+Normal rank
@@ Property / cites work @@
+Q4737161
@@ Property / cites work: Q4737161 / rank @@
+Normal rank
@@ Property / cites work @@
+Secure Multiparty Computation with Minimal Interaction
+Normal rank
@@ Property / cites work @@
+Secure Multi-Party Computation with Identifiable Abort
+Normal rank
@@ Property / cites work @@
+Secure Computation with Minimal Interaction, Revisited
+Normal rank
@@ Property / cites work @@
+On Expected Constant-Round Protocols for Byzantine Agreement
+Normal rank
@@ Property / cites work @@
+Sequential composition of protocols without simultaneous termination
+Normal rank
@@ Property / cites work @@
+Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
+Normal rank
@@ Property / cites work @@
+More Efficient Constant-Round Multi-party Computation from BMR and SHE
+Normal rank
@@ Property / cites work @@
+Two Round Multiparty Computation via Multi-key FHE
+Normal rank
@@ Property / cites work @@
+On the exact round complexity of secure three-party computation
+Normal rank
@@ Property / cites work @@
+Beyond honest majority: the round complexity of fair and robust multi-party computation
+Normal rank
@@ Property / cites work @@
+Unconditional Byzantine agreement for any number of faulty processors
+Normal rank
@@ Property / cites work @@
+On the round complexity of randomized Byzantine agreement
+Normal rank