Constant-Round Oblivious Transfer in the Bounded Storage Model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2951, Issue , 2004, Pages 446-472

  Ding, Yan Zong ^a   Harnik, Danny ^b   Rosen, Alon ^c   Shaltie, Ronen ^b  

^a Georgia Institute of Technology   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

BOUNDED STORAGE MODEL; DERANDOMIZATION; EXPLICIT CONSTRUCTIONS; OBLIVIOUS TRANSFER; RANDOM STRING; RANDOMNESS EXTRACTORS;

ARTIFICIAL INTELLIGENCE;

EID: 35048840744     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24638-1_25     Document Type: Article

References (43)

1. [ADR02] Y. Aumann, Y.Z. Ding, and M. O. Rabin. Everlasting security in the bounded storage model.IEEE Transactions on Information Theory, 48, 2002.
2. [AR99] Y. Aumann and M. O. Rabin. Information theoretically secure communication in the limited storage space model. In Advances in Crypology CRYPTO '99, volume 1666, pages 65-79, 1999.
3. [BBCS92] C.H. Bennett, G. Brassard, G. Crépeau, and M.H. Skubiszewska. Practical quantum oblivious transfer protocols. In Advances in Cryptology CRYPTO '91, Lecture Notes in Computer Science, volume 576, pages 351366. Springer, 1992.
4. [BM89] M. Bellare and S. Micali. Non-interactive oblivious transfer and applications. In Advances in Cryptology - CRYPTO '89, Lecture Notes in Computer Science, volume 435, pages 547-557. Springer, 1989.
5. [BR94] M. Bellare and J. Rompel. Randomnessefficient oblivious sampling. In 35th IEEE Symposium on Foundations of Computer Science, pages 276-287, 1994.
6. [CCM98] C. Cachin, G. Crépeau, and J. Marcil. Oblivious transfer with a memorybound receiver. In 39th IEEE Symposium on Foundations of Computer Science, pages 493-502, 1998.
7. [CK88] G. Crépeau and J. Kilian. Achieving oblivious transfer using weakened security assumptions. In 29th IEEE Symposium on Foundations of Computer Science, pages 42-52, 1988.
8. [CM97] C. Cachin and U. Maurer. Unconditional security against memory-bound adversaries. In Advances in Cryptology - CRYPTO '97, pages 292-306, 1997.
9. [Cov73] T.M. Cover. Enumerative source encoding. IEEE Transaction on Information Theory, 19(l):73-77, 1973.
10. [Cre87] C. Crépeau. Equivalence between two avours of oblivious transfers. In Advances in Cryptology - CRYPTO '87, Lecture Notes in Computer Science, volume 293, pages 350-354. Springer-Verlag, 1987.
11. [Dam93] I. Damgard. Interactive hashing can simplify zero-knowledge protocol design without computational assumptions. In Advances in Cryptology CRYPTO '93, Lecture Notes in Computer Science, volume 773, pages 100109. Springer, 1993.
12. [DGOW95] I. Damgård, O. Goldreich, T. Okamoto, and A. Wigderson. Honest verifier vs dishonest verifier in public cain zero-knowledge proofs. In Advances in Cryptology - CRYPTO '95, Lecture Notes in Computer Science, volume 963, pages 325-338. Springer, 1995.
13. [DGW95] I. Damgård, O. Goldreich, and A. Wigderson. Information theory versus complexity theory: Another test case, 1995.
14. [DinOl] Y.Z. Ding. Oblivious transfer in the bounded storage model. In Advances in Cryptology - CRYPTO '01, Lecture Notes in Computer Science, volume 2139, pages 155-170, Springer, 2001.
15. [DM02] S. Dziembowski and U. Maurer. Tight security proofs for the boundedstorage model. In 34th ACM Symposium on the Theory of Computing, pages 341-350, 2002.
16. [DPP93] I. Damgård, T. Pedersen, and B. Pfitzmann. On the existence of statistically hiding bit commitment schemes and fail-stop signatures. In Advances in Cryptology - CRYPTO '93, Lecture Notes in Computer Science, volume 773, pages 250-265. Springer, 1993.
17. [DR02] Y.Z. Ding and M.O. Rabin. Hyper-encryption and everlasting security. In Annual Symposium on Theoretical Aspects of Computer Science (STACS), pages 1-26, 2002.
18. [EGL85] S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, 1985.
19. [GK96] O. Goldreich and A. Kahan. How to construct constant-round zeroknowledge proof systems for np. Journal of Cryptology, 9(2):167-189, 1996.
20. [GKM+00] Y. Gertner, S. Kannan, T. Malkin, O. Reingold, and M. Viswanathan. The relationship between public key encryption and oblivious transfer. In 41st IEEE Symposium on Foundations of Computer Science, pages 325-335, 2000.
21. [GMW87] O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game - a completeness theorem for protocols with honest majority. In 19th ACM Symposium on the Theory of Computing, pages 218-229, 1987.
22. [Gol97] O. Goldreich. A sample of samplers - a computational perspective on sampling (survey). In Electronic Colloquium on Computational Complexity (ECCC)(20), volume 4, 1997.
23. [Gol03] O. Goldreich. Foundations of cryptography - volume 2. Working Draft, available at www.wisdom.weizmann.ac.il/oded/foc-vol2.html, 2003.
24. [Gow96] W.T. Gowers. An almost m-wise independent random permutation of the cube. Combinatorics, Probability and Computing, 5:119-130, 1996.
25. [GSV98] O. Goldreich, A. Sahai, and S. Vadhan. Honest-verifier statistical zeroknowledge equals general statistical zero-knowledge. In 30th ACM Symposium on the Theory of Computing, pages 399-408, 1998.
26. [IICR02] Dowon Hong, Ku-Young Chang, and Heuisu Ryu. Efficient oblivious transfer in the bounded-storage model. In Advances in Cryptology. ASIACRYPT '02, Lecture Notes in Computer Science, pages 143-159. Springer-Verlag, December 2002.
27. [IR89] R. Impagliazzo and S. Rudich. Limits on the provable consequences of oneway permutations. In 21st ACM Symposium on the Theory of Computing, pages 44-61, 1989.
28. [Kil88] J. Kilian. Founding cryptography on oblivious transfer. In 20th ACM Symposium on the Theory of Computing, pages 20-31, 1988.
29. [Lu02] C. Lu. Hyper-encryption against space-bounded adversaries from on-line strong extractors. In Advances in Cryptology - CRYPTO '02, volume 2442, pages 257-271. Springer, 2002.
30. [Mau92] U. Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology, 5(l):53-66, 1992.
31. [Mau93] U. Maurer. Secret key agreement by public discussion. IEEE Transaction on Information Theory, 39(3):733-742, 1993.
32. [Nis96] N. Nisan. Extracting randomness: How and why, a survey. IEEE Conference on Computational Complexity, pages 44-58, 1996.
33. [NOVY98] M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zeroknowledge arguments for np using any one-way permutation. Journal of Cryptology, 11(2):87-108, 1998. preliminary version in CRYPTO 92.
34. [NP01] M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In SIAM Symposium on Discrete Algorithms (SODA 2001), pages 448-457, 2001.
35. [NR99] M. Naor and O. Reingold. On the construction of pseudorandom permutations: Luby-rackoff revisited. Journal of Cryptology, 12(l):29-66, 1999.
36. [NY89] M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In 21st ACM Symposium on the Theory of Computing, pages 33-43, 1989.
37. [NZ96] N. Nisan and D. Zuckerman. Randomness is linear in space. JCSS, 52(l):43-52, 1996.
38. [RabSl] M.O. Rabin. How to exchange secrets by oblivious transfer. TR-81, Harvard, 1981.
39. [RRV99] R. Raz, O. Reingold, and S. Vadhan. Error reduction for extractor. In 40th IEEE Symposium on Foundations of Computer Science, pages 191-201, 1999.
40. [RSW00] O. Reingold, R. Shaltiel, and A. Wigderson. Extracting randomness via repeated condensing. In 41st IEEE Symposium on Foundations of Computer Science, pages 22-31, 2000.
41. [Sha02] R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin of the EATCS, 77:67-95, 2002.
42. [Vad03] S.P. Vadhan. On constructing locally computable extractors and cryptosystems in the bounded storage model. In Advances in Cryptology - CRYPTO '03. Springer, 2003.
43. [Yao86] A.C. Yao. How to generate and exchange secrets. In 27th IEEE Symposium on Foundations of Computer Science, pages 162-167, 1986.