Overdrive: making SPDZ great again

From MaRDI portal
Publication:1653082

DOI10.1007/978-3-319-78372-7_6zbMath1415.94446OpenAlexW2794685135MaRDI QIDQ1653082

Marcel Keller, Valerio Pastro, Dragos Rotaru

Publication date: 17 July 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-78372-7_6




Related Items (47)

Threshold Schnorr with stateless deterministic signing from standard assumptionsMhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKPSublinear GMW-style compiler for MPC with preprocessingAn efficient structural attack on NIST submission DAGSImproving the efficiency of AES protocols in multi-party computationFull-threshold actively-secure multiparty arithmetic circuit garblingHonest majority MPC with abort with minimal online communicationSecure multiparty computation with free branchingSecure multiparty computation with sublinear preprocessingLimits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPNMArBLed circuits: mixing arithmetic and Boolean circuits with active securityAbsentia: secure multiparty computation on ethereumPutting the online phase on a diet: covert security from short MACsOne round threshold ECDSA without roll callLe Mans: dynamic and fluid MPC for dishonest majorityVerifiable decryption in the headMixed-technique multi-party computations composed of two-party computationsMPClan: protocol suite for privacy-conscious computationsAmortizing division and exponentiationAttaining GOD beyond honest majority with friends and foesMore efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois ringsCorrelated pseudorandomness from expand-accumulate codes\textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'sManticore: a framework for efficient multiparty computation supporting real number and Boolean arithmeticHalf-tree: halving the cost of tree expansion in COT and DPFSecure multiparty computation from threshold encryption based on class groupsCorrelated pseudorandomness from the hardness of quasi-abelian decodingToward practical lattice-based proof of knowledge from Hint-MLWEMaliciously secure matrix multiplication with applications to private deep learningConcretely efficient large-scale MPC with active security (or tinykeys for tinyot)Improved Multiplication Triple Generation over Rings via RLWE-Based AHEFast large-scale honest-majority MPC for malicious adversariesEfficient, actively secure MPC with a dishonest majority: a surveyFinite interval-time transition system for real-time actorsSecure multi-party quantum computation with a dishonest majorityGoing beyond dual execution: MPC for functions with efficient verificationMon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)The more the merrier: reducing the cost of large scale MPCLarge scale, actively secure computation from LPN and free-XOR garbled circuitsMasked triples. Amortizing multiplication triples across conditionalsActively secure setup for SPDZEfficient pseudorandom correlation generators from ring-LPNEfficient two-party exponentiation from quotient transferTurboIKOS: improved non-interactive zero knowledge and post-quantum signaturesThe price of active security in cryptographic protocolsOn a generalization of substitution-permutation networks: the HADES design strategy




This page was built for publication: Overdrive: making SPDZ great again