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 2139 LNCS, Issue , 2001, Pages 155-170

  Ding, Yan Zong ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BOUNDED STORAGE MODEL; EFFICIENT PROTOCOLS; OBLIVIOUS TRANSFER; PROTOCOL CANS; PROVABLY SECURE; RANDOM STRING; SECURITY PARAMETERS; SENDER AND RECEIVERS; TWO WAYS;

CRYPTOGRAPHY;

EID: 84880895217     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44647-8_9     Document Type: Conference Paper

References (52)

1. Y. Aumann and M. O. Rabin. Information Theoretically Secure Communication in the Limited Storage Space Model. In Advances in Cryptology - CRYPTO '99, pages 65-79, 1999.
2. Y. Aumann, Y. Z. Ding, and M. O. Rabin. Everlasting Security in the Bounded Storage Model. Accepted to IEEE Transactions on Information Theory, 2001.
3. Y. Aumann and U. Feige. One message proof systems with known space verifier. In Advances in Cryptology - CRYPTO '93, pages 85-99, 1993.
4. Y. Aumann and M. O. Rabin. Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. TCS, 128(1):3-30, 1994.
5. D. Beaver. Commoditiy-Based Cryptography. In Proc. 29th ACM Symposium on Theory of Computing, pages 446-455, 1997.
6. M. Bellare and S. Micali. Non-interactive oblivious transfer and applications. In Advances in Cryptology - CRYPTO '89, pages 200-215, 1989.
7. C. H. Bennett, G. Brassard, C. Crépeau, and M.H. Skubiszewska. Practical quantum oblivious transfer protocols. In Advances in Cryptology - CRYPTO '91, pages 351-366, 1991.
8. M. Blum. How to exchange (secret) keys. ACM Transactions of Computer Systems, 1(20): 175-193, 1983.
9. G. Brassard and C. Crépeau. Oblivious transfers and privacy amplification. In Advances in Cryptology - EUROCRYPT '97, pages 334-347, 1997.
10. G. Brassard, C. Crépeau, and J-M. Roberts. Information theoretic reductions among disclosure problems. In Proc. 27th IEEE Symposium on the Foundations of Computer Science, pages 168-173, 1986.
11. G. Brassard, C. Crépeau, and J-M. Roberts. All-or-nothing disclosure of secrets. In Advances in Cryptology - CRYPTO '86, pages 234-238, 1986.
12. G. Brassard, C. Crépeau, and M. Sántha. Oblivious transfers and intersecting codes. IEEE Transactions on Information Theory, 42(6): 1769-80, 1996.
13. C. Cachin. Entropy Measures and Unconditional Security in Cryptography, volume 1 of ETH Series in Information Security and Cryptography. Hartun-Gorre Verlag, Konstanz, Germany, 1997.
14. C. Cachin. On the foundations of oblivious transfer. In Advances in Cryptology - EUROCRYPT '98, pages 361-374, 1998.
15. C. Cachin, C. Crépeau, and J. Marcil. Oblivious transfer with a memory-bounded receiver. In Proc. 39th IEEE Symposium on Foundations of Computer Science, pages 493-502, 1998.
16. C. Cachin and U. Maurer. Unconditional security against memory bounded adversaries. In Advances in Cryptology - CRYPTO '97, pages 292-306, 1997.
17. A. Condon. Bounded Space Probabilistic Games. JACM, 38(2):472-494, 1991.
18. A. Condon, and R. Ladner. Probabilistic Game Automata. JCSS, 36(3):452-489, 1987.
19. C. Crépeau. Equivalence between two flavours of oblivious transfer. In Advances in Cryptology - CRYPTO '87, pages 351-368, 1987.
20. C. Crépeau and J. Kilian. Achieving oblivious transfer using weakened security assumptions. In Proc. 29th IEEE Symposium on the Foundations of Computer Science, 42-52, 1988.
21. C. Crépeau and M. Sántha. On the reversibility of oblivious transfer. In Advances in Cryptology - EUROCRYPT '91, pages 106-113, 1991.
22. C. Crépeau, J. van de Graff, and A. Tapp. Committed oblivious transfer and private multi-party computations. In Advances in Cryptology - CRYPTO '95, pages 110-123, 1995.
23. A. De-Santis, G. Persiano, and M. Yung. One-message statistical zero-knowledge proofs with space-bounded verifier. In Proc. 19th ICALP, pages 28-40, 1992.
24. Y. Z. Ding and M. O. Rabin. Provably Secure and Non-Malleable Encryption. To appear, 2001.
25. Y. Dodis and S. Micali. Lower bounds for oblivious transfer reductions. In Advances in Cryptology - EUROCRYPT '99, pages 42-55, 1999.
26. C. Dwork and L. J. Stockmeyer. Finite State Verifiers I: The Power of Interaction. JACM 39(4): 800-828, 1992
27. C. Dwork and L. J. Stockmeyer. Finite State Verifiers II: Zero Knowledge. JACM 39(4): 829-858, 1992.
28. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. In Advances in Cryptology - CRYPTO '82, pages 205-210, 1982.
29. J. A. Garay and P. Mackenzie. Concurrent Oblivious Transfer. In Proc. 41th IEEE Symposium on the Foundations of Computer Science, pages 314-324, 2000.
30. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Proc. 19th ACM Symposium on Theory of Computing, pages 218-229, 1987.
31. O. Goldreich and R. Vainish. How to solve any protocol problem - an efficiency improvement. In Advances in Cryptology - CRYPTO '87, pages 73-86, 1987.
32. S. Goldwasser and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. In Advances in Cryptology - CRYPTO '90, pages 77-93, 1990.
33. J. Kilian. Founding cryptography on oblivious transfer. In Proc. 20th ACM Symposium on Theory of Computing, pages 20-31, 1988.
34. J. Kilian. Zero-knowledge with Log-Space Verifiers. In Proc. 29th IEEE Symposium on the Foundations of Computer Science, pages 25-35, 1988.
35. J. Kilian. A general completeness theorem for two-party games. In Proc. 23th ACM Symposium on Theory of Computing, pages 553-560, 1991.
36. J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky. Reducibility and completeness in private computations. SIAM Journal on Computing, 29(4): 1189-1208, 2000.
37. U. Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology, 5(1):53-66, 1992.
38. U. Maurer. Secret key agreement by public discussion from common information. IEEE Transactions on Information Theory, 39(3):733-742, 1993.
39. U. Maurer and S. Wolf. Toward characterizing when information-theoretic secret key agreement is possible. In Advances in Cryptology - ASIACRYPT'96, pages 196-209, 1996.
40. U. Maurer. Information-theoretically secure secret-key agreement by NOT authenticated public discussion. Advances in Cryptology - EUROCRYPT '97, pages 209-225, 1997.
41. U. Maurer and S. Wolf. Unconditional secure key agreement and the intrinsic conditional information. IEEE Transaction on Information Theory, 45(2): 499-514, 1999.
42. U. Maurer and S. Wolf. Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free. In Advances in Cryptology - EUROCRYPT '00, pages 351-368, 2000.
43. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for NP using any one-way function. Journal of Cryptology, 11(2): 87-108, 1998.
44. M. Naor and B. Pinkas. Distributed Oblivious Transfer. In Advances in Cryptology - ASIACRYPT '00, pages 205-219, 2000.
45. N. Nisan. Pseudorandom generators for space-bounded computation. In Proc. 22rd ACM Symposium on Theory of Computing, pages 204-212, 1990.
46. N. Nisan and D. Zuckerman. Randomness is linear in space. JCSS 52(1): 43-52, 1996.
47. M. O. Rabin. How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard University, 1981.
48. M. O. Rabin. Transaction Protection by Beacons. JCSS 27(2): 256-267, 1983.
49. R. Rivest. Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a Trusted Initializer. Manuscript, 1999.
50. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Computing, 26(5): 1484-1509, 1997.
51. L. G. Valiant and V. V. Vazirani. NP is as easy as detecting unique solutions. In Proc. ACM Symposium on Theory of Computing, pages 458-463, 1985.
52. A. C. Yao. How to generate and exchange secrets. In Proc. 27th IEEE Symposium on the Foundations of Computer Science, pages 162-167, 1986.