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