Pages that link to "Item:Q5259585"
From MaRDI portal
The following pages link to Circuits resilient to additive attacks with applications to secure computation (Q5259585):
Displaying 30 items.
- Bounded tamper resilience: how to go beyond the algebraic barrier (Q514469) (← links)
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- Subversion-resilient signatures: definitions, constructions and applications (Q1989360) (← links)
- Going beyond dual execution: MPC for functions with efficient verification (Q2055697) (← 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)
- Constant-overhead unconditionally secure multiparty computation over binary fields (Q2056769) (← links)
- Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
- Improved primitives for MPC over mixed arithmetic-binary circuits (Q2096551) (← links)
- An efficient passive-to-active compiler for honest-majority MPC over rings (Q2117048) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- Fluid MPC: secure multiparty computation with dynamic participants (Q2128557) (← links)
- ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
- Unconditional communication-efficient MPC via Hall's marriage theorem (Q2128564) (← links)
- Sublinear GMW-style compiler for MPC with preprocessing (Q2128572) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- Continuously non-malleable codes in the split-state model (Q2210446) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584) (← links)
- Secure Protocol Transformations (Q2829224) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803) (← links)
- Binary AMD Circuits from Secure Multiparty Computation (Q3179363) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)
- High-throughput secure three-party computation with an honest majority (Q6110385) (← links)
- MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
- (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates (Q6489333) (← links)
