Efficient 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 2501, Issue , 2002, Pages 143-149

  Hong, Dowon ^a   Chang, Ku Young ^a   Ryu, Heuisu ^a  

^a Electronics and Telecommunications Research Institute (ETRI)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

BOUNDED STORAGE MODEL; HASHING PROTOCOLS; OBLIVIOUS TRANSFER; PROVABLY SECURE; RANDOM STRING; SECURITY PARAMETERS; SENDER AND RECEIVERS; STORAGE MODEL;

CRYPTOGRAPHY;

EID: 84958744545     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36178-2_9     Document Type: Conference Paper

References (21)

1. C. H. Bennett, G. Brassard, C. Crepeau, and M. H. Skubiszewska, Practical quantum oblivious transter protocols, In Advances in Cryptology - CRYPTO’91, pp. 351-366, 1991.
2. G. Brassard, C. Crépeau, and J. M. Robert, All-or-nothing disclosure of secrets, In Advances in Cryptology - Crypto 86, pp. 234-238, 1987.
3. C. Cachin and U. Maurer, Unconditional security against memory-bounded adversaries, In Advances in Cryptology - CRYPTO’97, pp. 292-306, 1997.
4. C. Cachin, C Crépeau, and J. Marcil, Oblivious tranfser with a memory-bounded receiver, In Proc. 39th IEEE Symposium in Foundations of Computer Science, pp. 493-502, 1998.
5. J. L. Carter and M. N. Wegman, Universal classes of hash functions, Journal of Computer and System Sciences 18, pp. 143-154, 1979.
6. C. Crépeau, Equivalence between two flavours of oblivious transter, In Advances in Cryptology - CRYPTO’87, pp. 351-368, 1987.
7. C. Crépeau, J. van de Graff, and A. Tapp, Committed oblivious transter and private multy-party computations, In Advances in Cryptology - CRYPTO’95, pp. 110-123, 1995.
8. C. Crépeau and J. Kilian, Achieving oblivious transfer using weakened security assumptions, In Proc. 29th IEEE Symposium in the Foundatins of Computer Science, pp. 42-52, 1988.
9. C. Crépeau and M. Santha, On the reversibility of oblivious transter and private multi-party computations, In Advances in Cryptology - CRYPTO’95, pp. 110-123, 1995.
10. Y. Z. Ding, Oblivious Transfer in the Bounded Storage Model, In Advances in Cryptology - CRYPTO 2001, pp. 155-170, 2001.
11. S. Even, O. Goldreich, and A. Lempel, A randomized protocol for signing contracts, In Advances in Cryptology - CRYPTO’82, pp. 205-210, 1982.
12. O. Goldreich, S. Micali, and A. Wigderson, How to play ahy mental game or a completeness theorem for protocols with homest majority, In Proc. 19th ACM Symposium on Theory of Computing, pp. 218-229, 1987.
13. J. Kilian, Founding cryptography on oblivious transfer, In Proc. 20th ACM Symposium on Theory of Computing, pp. 20-31, 1988.
14. J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky, Reducibility and completeness in private computations, SIAM Journal on Computing, 29(4), pp.1189-1208, 2000.
15. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung, Perfect sero-knowledge arguments for NP using any one-way function, Journal of Cryptology, 11(2), pp. 87-108, 1998. Preliminary version presented at CRYPTO’92.
16. M. O. Rabin, How to exchange secrets by oblivious transfer, Technical Report TR- 81, Harvard University, 1981.
17. M. O. Rabin, Transaction Protection by Beacons, JCSS 27(2), pp. 256-267, 1983.
18. P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Computing, 26(5), pp. 1484-1509, 1997.
19. D. R. Stinson, On the connections between universal hasing, combinatorial designs and error-correcting codes, Congressus Numerantium 114, pp. 7-27, 1996.
20. D. R. Stinson Universal hash families and the leftover hash lemma, and applications to crypto graphy and computing, 2002. preprint, see, http://cacr.math.uwaterloo.ca/˜dstinson/
21. A. C. Yao, How to generate and exchange secrets, In Proc. 27th IEEE Symposium on the Foundations of Computer Science, pp. 162-167, 1986.