Reducing Complexity Assumptions for Oblivious Transfer

DOI10.1007/978-3-642-04846-3_8MaRDI QIDQ3638987zbMATH OpenOpenAlexFDO

Authors Kai Y. Cheong, Takeshi Koshiba

Publication date 28 October 2009

Published in Advances in Information and Computer Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04846-3_8

zbMATH Keywords

oblivious transfertrapdoor one-way functions

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
• Oblivious transfer from trapdoor permutations in minimal rounds
• On the feasibility of extending oblivious transfer
• On the feasibility of extending oblivious transfer
• Oblivious-Transfer Amplification

Cited in

(5)

• Reducing complexity assumptions for statistically-hiding commitment
• Oblivious transfer from trapdoor permutations in minimal rounds
• scientific article; zbMATH DE number 1256767 (Why is no real title available?)
• Lower Bounds for Oblivious Transfer Reductions
• Semi-honest to Malicious Oblivious Transfer—The Black-Box Way

This page was built for publication: Reducing Complexity Assumptions for Oblivious Transfer

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