More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
From MaRDI portal
Publication:2948348
DOI10.1007/978-3-662-46800-5_26zbMath1370.94481OpenAlexW2157314106MaRDI QIDQ2948348
Michael Zohner, Yehuda Lindell, Thomas Schneider, Gilad Asharov
Publication date: 30 September 2015
Published in: Advances in Cryptology -- EUROCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://encrypto.de/papers/ALSZ15.pdf
Related Items
Two-round MPC: information-theoretic and black-box ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Survey of information security ⋮ More efficient oblivious transfer extensions ⋮ The Simplest Protocol for Oblivious Transfer ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ Adaptively code-correlation robustness functions and its applications to private set intersection ⋮ Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost ⋮ Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Improved Private Set Intersection Against Malicious Adversaries ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Stacked garbling for disjunctive zero-knowledge proofs ⋮ Blazing fast OT for three-round UC OT extension ⋮ Encryption Switching Protocols ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ Efficient two-party exponentiation from quotient transfer ⋮ Faster Secure Two-Party Computation in the Single-Execution Setting ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings
