Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

26

CRYPTO
2001
Springer

favoriteEmaildiscussreport

106views Cryptology» more CRYPTO 2001»

Oblivious Transfer in the Bounded Storage Model

14 years 3 months ago

Oblivious Transfer in the Bounded Storage Model

Download www.iacr.org

Building on a previous important work of Cachin, Cr´epeau, and Marcil [15], we present a provably secure and more eﬃcient protocol for 2 1 -Oblivious Transfer with a storage-bounded receiver. A public random string of n bits long is employed, and the protocol is secure against

Yan Zong Ding

Real-time Traffic

CRYPTO 2001 | Cryptology | Eﬃcient Protocol | Provably Secure | Public Random String |

claim paper

Related Content

» Composable Security in the BoundedQuantumStorage Model

» Cryptography in the BoundedQuantumStorage Model

» Cryptography In the Bounded QuantumStorage Model

» On Unconditionally Secure Distributed Oblivious Transfer

» On the Impossibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security ...

» Priced Oblivious Transfer How to Sell Digital Goods

» Lower Bounds and Impossibility Results for Concurrent Self Composition

» Coding for Errors and Erasures in Random Network Coding

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	CRYPTO
Authors	Yan Zong Ding

Comments (0)