{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T11:06:27Z","timestamp":1776942387184,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":52,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424567","type":"print"},{"value":"9783540446477","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44647-8_9","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T19:28:14Z","timestamp":1194982094000},"page":"155-170","source":"Crossref","is-referenced-by-count":32,"title":["Oblivious Transfer in the Bounded Storage Model"],"prefix":"10.1007","author":[{"given":"Yan Zong","family":"Ding","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Y. Aumann and M. O. Rabin. Information Theoretically Secure Communication in the Limited Storage Space Model. In Advances in Cryptology-CRYPTO\u2019 99, pages 65\u201379, 1999.","DOI":"10.1007\/3-540-48405-1_5"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Y. Aumann, Y. Z. Ding, and M. O. Rabin. Everlasting Security in the Bounded Storage Model. Accepted to IEEE Transactions on Information Theory, 2001.","DOI":"10.1109\/TIT.2002.1003845"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Y. Aumann and U. Feige. One message proof systems with known space verifier. In Advances in Cryptology-CRYPTO\u2019 93, pages 85\u201399, 1993.","DOI":"10.1007\/3-540-48329-2_8"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)90162-7","volume":"128","author":"Y. Aumann","year":"1994","unstructured":"Y. Aumann and M. O. Rabin. Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. TCS, 128(1):3\u201330, 1994.","journal-title":"TCS"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"D. Beaver. Commoditiy-Based Cryptography. In Proc. 29th ACM Symposium on Theory of Computing, pages 446\u2013455, 1997.","DOI":"10.1145\/258533.258637"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"M. Bellare and S. Micali. Non-interactive oblivious transfer and applications. In Advances in Cryptology-CRYPTO\u2019 89, pages 200\u2013215, 1989.","DOI":"10.1007\/0-387-34799-2_15"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"C. H. Bennett, G. Brassard, C. Cr\u2019\u00e9peau, and M.H. Skubiszewska. Practical quantum oblivious transfer protocols. In Advances in Cryptology-CRYPTO\u2019 91, pages 351\u2013366, 1991.","DOI":"10.1007\/3-540-46766-1_29"},{"issue":"20","key":"9_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/357360.357368","volume":"1","author":"M. Blum","year":"1983","unstructured":"M. Blum. How to exchange (secret) keys. ACM Transactions of Computer Systems, 1(20): 175\u2013193, 1983.","journal-title":"ACM Transactions of Computer Systems"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"G. Brassard and C. Cr\u00e9peau. Oblivious transfers and privacy amplification. In Advances in Cryptology-EUROCRYPT\u2019 97, pages 334\u2013347, 1997.","DOI":"10.1007\/3-540-69053-0_23"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Cr\u00e9peau, and J-M. Roberts. Information theoretic reductions among disclosure problems. In Proc. 27th IEEE Symposium on the Foundations of Computer Science, pages 168\u2013173, 1986.","DOI":"10.1109\/SFCS.1986.26"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Cr\u00e9peau, and J-M. Roberts. All-or-nothing disclosure of secrets. In Advances in Cryptology-CRYPTO\u2019 86, pages 234\u2013238, 1986.","DOI":"10.1007\/3-540-47721-7_17"},{"issue":"6","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1109\/18.556673","volume":"42","author":"G. Brassard","year":"1996","unstructured":"G. Brassard, C. Cr\u00e9peau, and M. S\u00e1ntha. Oblivious transfers and intersecting codes. IEEE Transactions on Information Theory, 42(6): 1769\u201380, 1996.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9_CR13","unstructured":"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."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"C. Cachin. On the foundations of oblivious transfer. In Advances in Cryptology-EUROCRYPT\u2019 98, pages 361\u2013374, 1998.","DOI":"10.1007\/BFb0054139"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"C. Cachin, C. Cr\u00e9peau, and J. Marcil. Oblivious transfer with a memory-bounded receiver. In Proc. 39th IEEE Symposium on Foundations of Computer Science, pages 493\u2013502, 1998.","DOI":"10.1109\/SFCS.1998.743500"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"C. Cachin and U. Maurer. Unconditional security against memory bounded adversaries. In Advances in Cryptology-CRYPTO\u2019 97, pages 292\u2013306, 1997.","DOI":"10.1007\/BFb0052243"},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1145\/103516.128681","volume":"38","author":"A. Condon","year":"1991","unstructured":"A. Condon. Bounded Space Probabilistic Games. JACM, 38(2):472\u2013494, 1991.","journal-title":"JACM"},{"issue":"3","key":"9_CR18","first-page":"452","volume":"36","author":"A. Condon","year":"1987","unstructured":"A. Condon, and R. Ladner. Probabilistic Game Automata. JCSS, 36(3):452\u2013489, 1987.","journal-title":"JCSS"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau. Equivalence between two flavours of oblivious transfer. In Advances in Cryptology-CRYPTO\u2019 87, pages 351\u2013368, 1987.","DOI":"10.1007\/3-540-48184-2_30"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau and J. Kilian. Achieving oblivious transfer using weakened security assumptions. In Proc. 29th IEEE Symposium on the Foundations of Computer Science, 42\u201352, 1988.","DOI":"10.1109\/SFCS.1988.21920"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau and M. S\u00e1ntha. On the reversibility of oblivious transfer. In Advances in Cryptology-EUROCRYPT\u2019 91, pages 106\u2013113, 1991.","DOI":"10.1007\/3-540-46416-6_9"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"C. Cr\u00e9peau, J. van de Graff, and A. Tapp. Committed oblivious transfer and private multi-party computations. In Advances in Cryptology-CRYPTO\u2019 95, pages 110\u2013123, 1995.","DOI":"10.1007\/3-540-44750-4_9"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"A. De-Santis, G. Persiano, and M. Yung. One-message statistical zero-knowledge proofs with space-bounded verifier. In Proc. 19th ICALP, pages 28\u201340, 1992.","DOI":"10.1007\/3-540-55719-9_61"},{"key":"9_CR24","unstructured":"Y. Z. Ding and M. O. Rabin. Provably Secure and Non-Malleable Encryption. To appear, 2001."},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Y. Dodis and S. Micali. Lower bounds for oblivious transfer reductions. In Advances in Cryptology-EUROCRYPT\u2019 99, pages 42\u201355, 1999.","DOI":"10.1007\/3-540-48910-X_4"},{"issue":"4","key":"9_CR26","first-page":"800","volume":"39","author":"C. Dwork","year":"1992","unstructured":"C. Dwork and L. J. Stockmeyer. Finite State Verifiers I: The Power of Interaction. JA CM 39(4): 800\u2013828, 1992","journal-title":"JA CM"},{"issue":"4","key":"9_CR27","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1145\/146585.146601","volume":"39","author":"C. Dwork","year":"1992","unstructured":"C. Dwork and L. J. Stockmeyer. Finite State Verifiers II: Zero Knowledge. JACM 39(4): 829\u2013858, 1992.","journal-title":"JACM"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. In Advances in Cryptology-CRYPTO\u2019 82, pages 205\u2013210, 1982.","DOI":"10.1007\/978-1-4757-0602-4_19"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"J. A. Garay and P. Mackenzie. Concurrent Oblivious Transfer. In Proc. 41th IEEE Symposium on the Foundations of Computer Science, pages 314\u2013324, 2000.","DOI":"10.1109\/SFCS.2000.892120"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"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\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"O. Goldreich and R. Vainish. How to solve any protocol problem-an efficiency improvement. In Advances in Cryptology-CRYPTO\u2019 87, pages 73\u201386, 1987.","DOI":"10.1007\/3-540-48184-2_6"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"S. Goldwasser and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. In Advances in Cryptology-CRYPTO\u2019 90, pages 77\u201393, 1990.","DOI":"10.1007\/3-540-38424-3_6"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"J. Kilian. Founding cryptography on oblivious transfer. In Proc. 20th ACM Symposium on Theory of Computing, pages 20\u201331, 1988.","DOI":"10.1145\/62212.62215"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"J. Kilian. Zero-knowledge with Log-Space Verifiers. In Proc. 29th IEEE Symposium on the Foundations of Computer Science, pages 25\u201335, 1988.","DOI":"10.1109\/SFCS.1988.21918"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"J. Kilian. A general completeness theorem for two-party games. In Proc. 23th ACM Symposium on Theory of Computing, pages 553\u2013560, 1991.","DOI":"10.1145\/103418.103475"},{"issue":"4","key":"9_CR36","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1137\/S0097539797321742","volume":"29","author":"J. Kilian","year":"2000","unstructured":"J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky. Reducibility and completeness in private computations. SIAM Journal on Computing, 29(4): 1189\u20131208, 2000.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"9_CR37","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"U. Maurer","year":"1992","unstructured":"U. Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology, 5(1):53\u201366, 1992.","journal-title":"Journal of Cryptology"},{"issue":"3","key":"9_CR38","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/18.256484","volume":"39","author":"U. Maurer","year":"1993","unstructured":"U. Maurer. Secret key agreement by public discussion from common information. IEEE Transactions on Information Theory, 39(3):733\u2013742, 1993.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9_CR39","doi-asserted-by":"crossref","unstructured":"U. Maurer and S. Wolf. Toward characterizing when information-theoretic secret key agreement is possible. In Advances in Cryptology-ASIACRYPT\u201996, pages 196\u2013209, 1996.","DOI":"10.1007\/BFb0034847"},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"U. Maurer. Information-theoretically secure secret-key agreement by NOT authenticated public discussion. Advances in Cryptology-EUROCRYPT\u2019 97, pages 209\u2013225, 1997.","DOI":"10.1007\/3-540-69053-0_15"},{"issue":"2","key":"9_CR41","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1109\/18.748999","volume":"45","author":"U. Maurer","year":"1999","unstructured":"U. Maurer and S. Wolf. Unconditional secure key agreement and the intrinsic conditional information. IEEE Transaction on Information Theory, 45(2): 499\u2013514, 1999.","journal-title":"IEEE Transaction on Information Theory"},{"key":"9_CR42","doi-asserted-by":"crossref","unstructured":"U. Maurer and S. Wolf. Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free. In Advances in Cryptology-EUROCRYPT\u2019 00, pages 351\u2013368, 2000.","DOI":"10.1007\/3-540-45539-6_24"},{"issue":"2","key":"9_CR43","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001459900037","volume":"11","author":"M. Naor","year":"1998","unstructured":"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\u2013108, 1998.","journal-title":"Journal of Cryptology"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"M. Naor and B. Pinkas. Distributed Oblivious Transfer. In Advances in Cryptology-ASIACRYPT\u2019 00, pages 205\u2013219, 2000.","DOI":"10.1007\/3-540-44448-3_16"},{"key":"9_CR45","doi-asserted-by":"crossref","unstructured":"N. Nisan. Pseudorandom generators for space-bounded computation. In Proc. 22rd ACM Symposium on Theory of Computing, pages 204\u2013212, 1990.","DOI":"10.1145\/100216.100242"},{"issue":"1","key":"9_CR46","first-page":"43","volume":"52","author":"N. Nisan","year":"1996","unstructured":"N. Nisan and D. Zuckerman. Randomness is linear in space. JCSS 52(1): 43\u201352, 1996.","journal-title":"JCSS"},{"key":"9_CR47","unstructured":"M. O. Rabin. How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard University, 1981."},{"issue":"2","key":"9_CR48","first-page":"256","volume":"27","author":"M. O. Rabin","year":"1983","unstructured":"M. O. Rabin. Transaction Protection by Beacons. JCSS 27(2): 256\u2013267, 1983.","journal-title":"JCSS"},{"key":"9_CR49","unstructured":"R. Rivest. Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a Trusted Initializer. Manuscript, 1999."},{"issue":"5","key":"9_CR50","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. W. Shor","year":"1997","unstructured":"P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Computing, 26(5): 1484\u20131509, 1997.","journal-title":"SIAM J. Computing"},{"key":"9_CR51","doi-asserted-by":"crossref","unstructured":"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\u2013463, 1985.","DOI":"10.1145\/22145.22196"},{"key":"9_CR52","doi-asserted-by":"crossref","unstructured":"A. C. Yao. How to generate and exchange secrets. In Proc. 27th IEEE Symposium on the Foundations of Computer Science, pages 162\u2013167, 1986.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44647-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T18:05:32Z","timestamp":1684087532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44647-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424567","9783540446477"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/3-540-44647-8_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}