Pages that link to "Item:Q5445508"

The following pages link to Perfectly-Secure MPC with Linear Communication Complexity (Q5445508):

Displaying 34 items.

• A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468) (← links)
• Secure message transmission in asynchronous networks (Q635383) (← links)
• An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
• Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) (Q1710665) (← links)
• Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← links)
• The more the merrier: reducing the cost of large scale MPC (Q2056763) (← links)
• Constant-overhead unconditionally secure multiparty computation over binary fields (Q2056769) (← links)
• Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
• ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
• Efficient information-theoretic multi-party computation over non-commutative rings (Q2128567) (← links)
• Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC (Q2129015) (← links)
• Honest majority MPC with abort with minimal online communication (Q2146110) (← links)
• Perfectly-secure asynchronous MPC for general adversaries (extended abstract) (Q2152066) (← links)
• High throughput secure MPC over small population in hybrid networks (extended abstract) (Q2152069) (← links)
• Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings (Q2175924) (← links)
• Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities (Q2229260) (← links)
• Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584) (← links)
• Circuit amortization friendly encodingsand their application to statistically secure multiparty computation (Q2691586) (← links)
• On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (Q2697681) (← links)
• On communication-efficient asynchronous MPC with adaptive security (Q2697849) (← links)
• Communication-Optimal Proactive Secret Sharing for Dynamic Groups (Q2794492) (← links)
• Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing (Q2827715) (← links)
• Proactive Secret Sharing with a Dishonest Majority (Q2827737) (← links)
• Network Oblivious Transfer (Q2829221) (← links)
• On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
• Secure Computation, I/O-Efficient Algorithms and Distributed Signatures (Q2890013) (← links)
• Realistic versus Rational Secret Sharing (Q3297660) (← links)
• From Passive to Covert Security at Low Cost (Q3408191) (← links)
• Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems (Q3408195) (← links)
• Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience (Q4931669) (← links)
• Round Efficient Unconditionally Secure Multiparty Computation Protocol (Q5504622) (← links)
• Efficient perfectly secure computation with optimal resilience (Q5918515) (← links)
• Efficient perfectly secure computation with optimal resilience (Q5925697) (← links)
• Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)