Constant-round oblivious transfer in the bounded storage model

DOI10.1007/S00145-006-0438-1MaRDI QIDQ877811zbMATH OpenOpenAlexFDO

Authors Yan Zong Ding, D. Harnik, Alon Rosen, Ronen Shaltiel

Publication date 3 May 2007

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00145-006-0438-1

zbMATH Keywords

derandomization

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• Theory of Cryptography
• Efficient Oblivious Transfer in the Bounded-Storage Model
• scientific article; zbMATH DE number 1842490
• Weak oblivious transfer from strong one-way functions
• Simple schemes in the bounded storage model

Cited in

(9)

• Low cost constant round MPC combining BMR and oblivious transfer
• Efficient Oblivious Transfer in the Bounded-Storage Model
• Speak much, remember little: cryptography in the bounded storage model, revisited
• Theory of Cryptography
• scientific article; zbMATH DE number 1842490 (Why is no real title available?)
• Bit commitment in the bounded storage model: tight bound and simple optimal construction
• Authentication in the bounded storage model
• Interactive Hashing: An Information Theoretic Tool (Invited Talk)
• Disappearing cryptography in the bounded storage model

This page was built for publication: Constant-round oblivious transfer in the bounded storage model

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