On cut-and-choose oblivious transfer and its variants

DOI10.1007/978-3-662-48797-6_17zbMATH Open1408.94941OpenAlexW2294870782MaRDI QIDQ2811140FDOQ2811140

Authors: Vladimir Kolesnikov, Ranjit Kumaresan 

Publication date: 10 June 2016

Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48797-6_17

Recommendations

• Secure two-party computation via cut-and-choose oblivious transfer
• Secure two-party computation via cut-and-choose oblivious transfer
• Cut-and-choose bilateral oblivious transfer
• Fast cut-and-choose-based protocols for malicious and covert adversaries
• Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings

zbMATH Keywords

concrete efficiencycut-and-choose oblivious transferOT extension

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (3)

• Privacy-enhanced attribute-based private information retrieval
• Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost
• Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer

This page was built for publication: On cut-and-choose oblivious transfer and its variants

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