{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T11:06:29Z","timestamp":1776942389768,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540210009","type":"print"},{"value":"9783540246381","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24638-1_25","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:15:28Z","timestamp":1280762128000},"page":"446-472","source":"Crossref","is-referenced-by-count":42,"title":["Constant-Round Oblivious Transfer in the Bounded Storage Model"],"prefix":"10.1007","author":[{"given":"Yan Zong","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Harnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alon","family":"Rosen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronen","family":"Shaltiel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Aumann, Y., Ding, Y.Z., Rabin, M.O.: Everlasting security in the bounded storage model. IEEE Transactions on Information Theory\u00a048 (2002)","DOI":"10.1109\/TIT.2002.1003845"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/3-540-48405-1_5","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"Y. Aumann","year":"1999","unstructured":"Aumann, Y., Rabin, M.O.: Information theoretically secure communication in the limited storage space model. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 65\u201379. Springer, Heidelberg (1999)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-46766-1_29","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"C.H. Bennett","year":"1992","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e9peau, C., Skubiszewska, M.H.: Practical quantum oblivious transfer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 351\u2013366. Springer, Heidelberg (1992)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/0-387-34805-0_48","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"M. Bellare","year":"1990","unstructured":"Bellare, M., Micali, S.: Non-interactive oblivious transfer and applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 547\u2013557. Springer, Heidelberg (1990)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rompel, J.: Randomnessefficient oblivious sampling. In: 35th IEEE Symposium on Foundations of Computer Science, pp. 276\u2013287 (1994)","DOI":"10.1109\/SFCS.1994.365687"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Cachin, C., Cr\u00e9peau, C., Marcil, J.: Oblivious transfer with a memorybound receiver. In: 39th IEEE Symposium on Foundations of Computer Science, pp. 493\u2013502 (1998)","DOI":"10.1109\/SFCS.1998.743500"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions. In: 29th IEEE Symposium on Foundations of Computer Science, pp. 42\u201352 (1988)","DOI":"10.1109\/SFCS.1988.21920"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0052243","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"C. Cachin","year":"1997","unstructured":"Cachin, C., Maurer, U.M.: Unconditional security against memory-bounded adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 292\u2013306. Springer, Heidelberg (1997)"},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/TIT.1973.1054929","volume":"19","author":"T.M. Cover","year":"1973","unstructured":"Cover, T.M.: Enumerative source encoding. IEEE Transaction on Information Theory\u00a019(1), 73\u201377 (1973)","journal-title":"IEEE Transaction on Information Theory"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-48184-2_30","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"C. Cr\u00e9peau","year":"1988","unstructured":"Cr\u00e9peau, C.: Equivalence between two flavours of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 350\u2013354. Springer, Heidelberg (1988)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/3-540-48329-2_9","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"I.B. Damg\u00e5rd","year":"1994","unstructured":"Damg\u00e5rd, I.B.: Interactive hashing can simplify zero-knowledge protocol design without computational assumptions. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 100\u2013109. Springer, Heidelberg (1994)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-44750-4_26","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"I.B. Damg\u00e5rd","year":"1995","unstructured":"Damg\u00e5rd, I.B., Goldreich, O., Okamoto, T., Wigderson, A.: Honest verifier vs dishonest verifier in public cain zero-knowledge proofs. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 325\u2013338. Springer, Heidelberg (1995)"},{"key":"25_CR13","unstructured":"Damg\u00e5rd, I., Goldreich, O., Wigderson, A.: Information theory versus complexity theory: Another test case (1995)"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-44647-8_9","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"Y.Z. Ding","year":"2001","unstructured":"Ding, Y.Z.: Oblivious transfer in the bounded storage model. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 155\u2013170. Springer, Heidelberg (2001)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Maurer, U.: Tight security proofs for the boundedstorage model. In: 34th ACM Symposium on the Theory of Computing, pp. 341\u2013350 (2002)","DOI":"10.1145\/509957.509960"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-48329-2_22","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"I.B. Damg\u00e5rd","year":"1994","unstructured":"Damg\u00e5rd, I.B., Pedersen, T.P., Pfitzmann, B.: On the existence of statistically hiding bit commitment schemes and fail-stop sigantures. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 250\u2013265. Springer, Heidelberg (1994)"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45841-7_1","volume-title":"STACS 2002","author":"Y.Z. Ding","year":"2002","unstructured":"Ding, Y.Z., Rabin, M.O.: Hyper-encryption and everlasting security. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 1\u201326. Springer, Heidelberg (2002)"},{"issue":"6","key":"25_CR18","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Communications of the ACM"},{"issue":"2","key":"25_CR19","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to construct constant-round zeroknowledge proof systems for np. Journal of Cryptology\u00a09(2), 167\u2013189 (1996)","journal-title":"Journal of Cryptology"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The relationship between public key encryption and oblivious transfer. In: 41st IEEE Symposium on Foundations of Computer Science, pp. 325\u2013335 (2000)","DOI":"10.1109\/SFCS.2000.892121"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game - a completeness theorem for protocols with honest majority. In: 19th ACM Symposium on the Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"25_CR22","unstructured":"Goldreich, O.: A sample of samplers - a computational perspective on sampling (survey). In: Electronic Colloquium on Computational Complexity (ECCC) (20), vol.\u00a04 (1997)"},{"key":"25_CR23","unstructured":"Goldreich, O.: Foundations of cryptography - volume 2. Working Draft (2003), available at: www.wisdom.weizmann.ac.il\/oded\/foc-vol2.html"},{"key":"25_CR24","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1017\/S0963548300001917","volume":"5","author":"W.T. Gowers","year":"1996","unstructured":"Gowers, W.T.: An almost m-wise independent random permutation of the cube. Combinatorics, Probability and Computing\u00a05, 119\u2013130 (1996)","journal-title":"Combinatorics, Probability and Computing"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Sahai, A., Vadhan, S.: Honest-verifier statistical zeroknowledge equals general statistical zero-knowledge. In: 30th ACM Symposium on the Theory of Computing, pp. 399\u2013408 (1998)","DOI":"10.1145\/276698.276852"},{"key":"25_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-36178-2_9","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"D. Hong","year":"2002","unstructured":"Hong, D., Chang, K.-Y., Ryu, H.: Efficient oblivious transfer in the bounded-storage model. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 143\u2013159. Springer, Heidelberg (2002)"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of oneway permutations. In: 21st ACM Symposium on the Theory of Computing, pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: 20th ACM Symposium on the Theory of Computing, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"25_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-45708-9_17","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"C. Lu","year":"2002","unstructured":"Lu, C.: Hyper-encryption against space-bounded adversaries from on-line strong extractors. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 257\u2013271. Springer, Heidelberg (2002)"},{"issue":"1","key":"25_CR30","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"U. Maurer","year":"1992","unstructured":"Maurer, U.: Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology\u00a05(1), 53\u201366 (1992)","journal-title":"Journal of Cryptology"},{"issue":"3","key":"25_CR31","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/18.256484","volume":"39","author":"U. Maurer","year":"1993","unstructured":"Maurer, U.: Secret key agreement by public discussion. IEEE Transaction on Information Theory\u00a039(3), 733\u2013742 (1993)","journal-title":"IEEE Transaction on Information Theory"},{"key":"25_CR32","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Extracting randomness: How and why, a survey. In: IEEE Conference on Computational Complexity, pp. 44\u201358 (1996)","DOI":"10.1109\/CCC.1996.507667"},{"issue":"2","key":"25_CR33","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s001459900037","volume":"11","author":"M. Naor","year":"1998","unstructured":"Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect zeroknowledge arguments for np using any one-way permutation. Journal of Cryptology\u00a011(2), 87\u2013108 (1998); preliminary version in CRYPTO 1992","journal-title":"Journal of Cryptology"},{"key":"25_CR34","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 448\u2013457 (2001)"},{"issue":"1","key":"25_CR35","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/PL00003817","volume":"12","author":"M. Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: On the construction of pseudorandom permutations: Luby-rackoff revisited. Journal of Cryptology\u00a012(1), 29\u201366 (1999)","journal-title":"Journal of Cryptology"},{"key":"25_CR36","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: 21st ACM Symposium on the Theory of Computing, pp. 33\u201343 (1989)","DOI":"10.1145\/73007.73011"},{"issue":"1","key":"25_CR37","first-page":"43","volume":"52","author":"N. Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. JCSS\u00a052(1), 43\u201352 (1996)","journal-title":"JCSS"},{"key":"25_CR38","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. TR-81, Harvard (1981)"},{"key":"25_CR39","doi-asserted-by":"crossref","unstructured":"Raz, R., Reingold, O., Vadhan, S.: Error reduction for extractor. In: 40th IEEE Symposium on Foundations of Computer Science, pp. 191\u2013201 (1999)","DOI":"10.1109\/SFFCS.1999.814591"},{"key":"25_CR40","doi-asserted-by":"crossref","unstructured":"Reingold, O., Shaltiel, R., Wigderson, A.: Extracting randomness via repeated condensing. In: 41st IEEE Symposium on Foundations of Computer Science, pp. 22\u201331 (2000)","DOI":"10.1109\/SFCS.2000.892008"},{"key":"25_CR41","first-page":"67","volume":"77","author":"R. Shaltiel","year":"2002","unstructured":"Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the EATCS\u00a077, 67\u201395 (2002)","journal-title":"Bulletin of the EATCS"},{"key":"25_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-45146-4_4","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"S.P. Vadhan","year":"2003","unstructured":"Vadhan, S.P.: On constructing locally computable extractors and cryptosystems in the bounded storage model. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 61\u201377. Springer, Heidelberg (2003)"},{"key":"25_CR43","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: 27th IEEE Symposium on Foundations of Computer Science, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24638-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T18:04:00Z","timestamp":1740333840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24638-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210009","9783540246381"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24638-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}