The following pages link to Theory of Cryptography (Q5898361):
Displayed 18 items.
- Secure message transmission in asynchronous networks (Q635383) (← links)
- Quantum private comparison protocol with five-particle cluster states (Q1740868) (← links)
- Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← links)
- Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
- An efficient passive-to-active compiler for honest-majority MPC over rings (Q2117048) (← links)
- Fluid MPC: secure multiparty computation with dynamic participants (Q2128557) (← links)
- Honest majority MPC with abort with minimal online communication (Q2146110) (← links)
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings (Q2175924) (← links)
- Optimal extension protocols for Byzantine broadcast and agreement (Q2657277) (← links)
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584) (← links)
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (Q2697681) (← links)
- Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing (Q2827715) (← links)
- Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited (Q3540054) (← links)
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks (Q3616571) (← links)
- Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience (Q4931669) (← links)
- Round Efficient Unconditionally Secure Multiparty Computation Protocol (Q5504622) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time (Q6061361) (← links)