Pages that link to "Item:Q3563850"
From MaRDI portal
The following pages link to Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography (Q3563850):
Displaying 47 items.
- Efficient robust secret sharing from expander graphs (Q680925) (← links)
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
- Secure arithmetic computation with constant computational overhead (Q1675726) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- On the message complexity of secure multiparty computation (Q1749308) (← links)
- Graph coloring applied to secure computation in non-abelian groups (Q1928772) (← links)
- Order-C secure multiparty computation for highly repetitive circuits (Q2056761) (← links)
- The more the merrier: reducing the cost of large scale MPC (Q2056763) (← links)
- Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
- ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
- Unconditional communication-efficient MPC via Hall's marriage theorem (Q2128564) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Algebraic geometric secret sharing schemes over large fields are asymptotically threshold (Q2171881) (← links)
- Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities (Q2229260) (← links)
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
- Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587) (← links)
- Packed multiplication: how to amortize the cost of side-channel masking? (Q2692370) (← links)
- Efficient Leakage Resilient Circuit Compilers (Q2790050) (← 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)
- Secure Protocol Transformations (Q2829224) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations (Q2947113) (← links)
- Binary AMD Circuits from Secure Multiparty Computation (Q3179363) (← links)
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits (Q3457092) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- On the Computational Overhead of MPC with Dishonest Majority (Q5738762) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5918515) (← links)
- Correction to: ``Unconditionally secure computation against low-complexity leakage'' (Q5925544) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- Sharing transformation and dishonest majority MPC with packed secret sharing (Q6111539) (← links)
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head'' (Q6132422) (← links)
- Non-interactive zero-knowledge proofs to multiple verifiers (Q6135446) (← links)
- Efficient circuits for permuting and mapping packed values across leveled homomorphic ciphertexts (Q6173299) (← links)
- On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications (Q6488447) (← links)
- Ramp hyper-invertible matrices and their applications to MPC protocols (Q6595682) (← links)
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity (Q6595687) (← links)
- Leakage-tolerant circuits (Q6637525) (← links)
- Perfect asynchronous MPC with linear communication overhead (Q6637548) (← links)
- Stochastic secret sharing with 1-bit shares and applications to MPC (Q6652972) (← links)
- Scalable multiparty computation from non-linear secret sharing (Q6653034) (← links)
- Scalable agreement protocols with optimal optimistic efficiency (Q6660395) (← links)
