Pages that link to "Item:Q1653082"
From MaRDI portal
The following pages link to Overdrive: making SPDZ great again (Q1653082):
Displaying 47 items.
- Using TopGear in overdrive: a more efficient ZKPoK for SPDZ (Q778926) (← links)
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption (Q785020) (← 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)
- Finite interval-time transition system for real-time actors (Q1997268) (← links)
- Secure multi-party quantum computation with a dishonest majority (Q2055679) (← links)
- Going beyond dual execution: MPC for functions with efficient verification (Q2055697) (← links)
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \) (Q2055698) (← links)
- The more the merrier: reducing the cost of large scale MPC (Q2056763) (← links)
- Large scale, actively secure computation from LPN and free-XOR garbled circuits (Q2056780) (← links)
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster (Q2057167) (← links)
- Masked triples. Amortizing multiplication triples across conditionals (Q2061960) (← links)
- Actively secure setup for SPDZ (Q2072211) (← links)
- Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← links)
- Efficient two-party exponentiation from quotient transfer (Q2096636) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- On a generalization of substitution-permutation networks: the HADES design strategy (Q2119029) (← links)
- Threshold Schnorr with stateless deterministic signing from standard assumptions (Q2120070) (← links)
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP (Q2128571) (← links)
- Sublinear GMW-style compiler for MPC with preprocessing (Q2128572) (← links)
- Improving the efficiency of AES protocols in multi-party computation (Q2145388) (← links)
- Full-threshold actively-secure multiparty arithmetic circuit garbling (Q2146106) (← links)
- Honest majority MPC with abort with minimal online communication (Q2146110) (← links)
- Secure multiparty computation with free branching (Q2170008) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) (Q2170012) (← links)
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security (Q2179391) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- Absentia: secure multiparty computation on ethereum (Q2670861) (← links)
- Maliciously secure matrix multiplication with applications to private deep learning (Q2691579) (← links)
- Improved Multiplication Triple Generation over Rings via RLWE-Based AHE (Q3297630) (← links)
- Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN (Q5087258) (← links)
- One round threshold ECDSA without roll call (Q6080915) (← links)
- Le Mans: dynamic and fluid MPC for dishonest majority (Q6097268) (← links)
- Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)
- MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
- Attaining GOD beyond honest majority with friends and foes (Q6135412) (← links)
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6155261) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
- \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s (Q6164395) (← links)
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic (Q6176271) (← links)
- A new approach to efficient and secure fixed-point computation (Q6547972) (← links)
- Efficient secure multi-party computation for proof of custody in Ethereum sharding (Q6564095) (← links)
- The price of active security in cryptographic protocols (Q6595846) (← links)
- On information-theoretic secure multiparty computation with local repairability (Q6635769) (← links)
- An efficient ZK compiler from SIMD circuits to general circuits (Q6655875) (← links)
