Attaining GOD beyond honest majority with friends and foes

DOI10.1007/978-3-031-22963-3_19zbMATH Open1519.94131MaRDI QIDQ6135412FDOQ6135412

Authors: Aditya Hegde, Nishat Koti, Varsha Bhat Kukkala, Shravani Patil, Arpita Patra, Protik Paul 

Publication date: 25 August 2023

Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)

Recommendations

• MPC with friends and foes
• Fast large-scale honest-majority MPC for malicious adversaries
• Fully-secure MPC with minimal trust

zbMATH Keywords

oblivious transfermultiparty computationfriends and foes

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Multiparty Computation from Somewhat Homomorphic Encryption
• Founding Cryptography on Oblivious Transfer – Efficiently
• Advances in Cryptology - CRYPTO 2003
• Authenticated Algorithms for Byzantine Agreement
• Perfectly secure message transmission
• Scalable and Unconditionally Secure Multiparty Computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast large-scale honest-majority MPC for malicious adversaries
• Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• High-throughput secure three-party computation for malicious adversaries and an honest majority
• Secure computation with minimal interaction, revisited
• Actively secure OT extension with optimal overhead
• Overdrive: making SPDZ great again
• Yet another compiler for active security or: efficient MPC over arbitrary rings
• Minimising communication in honest-majority MPC by batchwise multiplication verification
• Secure computation with low communication from cross-checking
• Title not available (Why is that?)
• Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
• An efficient passive-to-active compiler for honest-majority MPC over rings
• Better preprocessing for secure multiparty computation
• High-throughput secure three-party computation with an honest majority
• Guaranteed output delivery comes free in honest majority MPC
• Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
• Zero-knowledge proofs on secret-shared data via fully linear PCPs
• Efficient pseudorandom correlation generators: silent OT extension and more
• Secure MPC: laziness leads to GOD
• Efficient fully secure computation via distributed zero-knowledge proofs
• Efficient secure multiparty computation with identifiable abort
• MPC with friends and foes
• Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
• Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
• Multi-Party Computation with Omnipresent Adversary

Cited In (3)

• Three party secure computation with friends and foes
• Threshold-optimal MPC with friends and foes
• MPC with friends and foes

This page was built for publication: Attaining GOD beyond honest majority with friends and foes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135412)