More efficient oblivious transfer extensions with security for malicious adversaries

DOI10.1007/978-3-662-46800-5_26MaRDI QIDQ2948348zbMATH OpenOpenAlexFDO

Authors Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner

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

zbMATH Keywords

concrete efficiencysecure computationoblivious transfer extensions

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• More efficient oblivious transfer extensions
• Advances in Cryptology - CRYPTO 2003
• Extending oblivious transfer efficiently or -- how to get active security with constant cryptographic overhead
• Improved OT extension for transferring short secrets
• On the feasibility of extending oblivious transfer

Cited in

(33)

• Efficient, actively secure MPC with a dishonest majority: a survey
• From attack on Feige-Shamir to construction of oblivious transfer
• On the complexity of additively homomorphic UC commitments
• Two-round MPC: information-theoretic and black-box
• Extending oblivious transfer with low communication via key-homomorphic PRFs
• Survey of information security
• Actively secure OT extension with optimal overhead
• Advances in Cryptology - CRYPTO 2003
• On the feasibility of extending oblivious transfer
• Faster secure two-party computation in the single-execution setting
• Non-interactive secure 2PC in the offline/online and batch settings
• Actively secure arithmetic computation and VOLE with constant computational overhead
• Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
• On the feasibility of extending oblivious transfer
• SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
• Extending white-box cryptography based oblivious transfer protocol
• Encryption switching protocols
• Actively secure 1-out-of-\(N\) OT extension with application to private set intersection
• More efficient constant-round multi-party computation from BMR and SHE
• Improved private set intersection against malicious adversaries
• Blazing fast OT for three-round UC OT extension
• Stacked garbling for disjunctive zero-knowledge proofs
• Low cost constant round MPC combining BMR and oblivious transfer
• Efficient constant-round MPC with identifiable abort and public verifiability
• Private set operations from multi-query reverse private membership test
• On the round complexity of OT extension
• Adaptively code-correlation robustness functions and its applications to private set intersection
• Improved OT extension for transferring short secrets
• More efficient oblivious transfer extensions
• Efficient k-out-of-n oblivious transfer scheme with the ideal communication cost
• Extending oblivious transfer efficiently or -- how to get active security with constant cryptographic overhead
• Efficient two-party exponentiation from quotient transfer
• The simplest protocol for oblivious transfer

This page was built for publication: More efficient oblivious transfer extensions with security for malicious adversaries

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