Constant-round oblivious transfer in the bounded storage model

DOI10.1007/S00145-006-0438-1zbMath1113.68046OpenAlexW2045234394MaRDI QIDQ877811

Yan Zong Ding, Danny Harnik, Ronen Shaltiel, Alon Rosen

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)

Related Items (4)

Authentication in the bounded storage model ⋮ Speak much, remember little: cryptography in the bounded storage model, revisited ⋮ Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction ⋮ Interactive Hashing: An Information Theoretic Tool (Invited Talk)

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