Identifying Cheaters without an Honest Majority
From MaRDI portal
Publication:2891474
DOI10.1007/978-3-642-28914-9_2zbMath1303.94083OpenAlexW32204006MaRDI QIDQ2891474
Rafail Ostrovsky, Hakan Seyalioglu, Yuval Ishai
Publication date: 15 June 2012
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_2
Related Items (12)
Efficient Secure Multiparty Computation with Identifiable Abort ⋮ Round-optimal multi-party computation with identifiable abort ⋮ Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters ⋮ Fully-secure MPC with minimal trust ⋮ On sufficient oracles for secure computation with identifiable abort ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Efficient robust secret sharing from expander graphs ⋮ Nearly optimal robust secret sharing ⋮ From fairness to full security in multiparty computation ⋮ Protocols for multiparty coin toss with a dishonest majority ⋮ Quantum verifiable protocol for secure modulo zero-sum randomness
This page was built for publication: Identifying Cheaters without an Honest Majority
