Abstract
We present a constant round protocol for Oblivious Transfer in Maurer’s bounded storage model. In this model, a long random string \(\mathcal{R}\) is initially transmitted and each of the parties interacts based on a small portion of \(\mathcal{R}\). Even though the portions stored by the honest parties are small, security is guaranteed against any malicious party that remembers almost all of the string \(\mathcal{R}\).
Previous constructions for Oblivious Transfer in the bounded storage model required polynomially many rounds of interaction. Our protocol has only 5 messages. We also improve other parameters, such as the number of bits transferred and the probability of immaturely aborting the protocol due to failure.
Our techniques utilize explicit constructions from the theory of derandomization. In particular, we use constructions of almost t-wise independent permutations, randomness extractors and averaging samplers.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aumann, Y., Ding, Y.Z., Rabin, M.O.: Everlasting security in the bounded storage model. IEEE Transactions on Information Theory 48 (2002)
Aumann, Y., Rabin, M.O.: Information theoretically secure communication in the limited storage space model. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 65–79. Springer, Heidelberg (1999)
Bennett, C.H., Brassard, G., Crépeau, C., Skubiszewska, M.H.: Practical quantum oblivious transfer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 351–366. Springer, Heidelberg (1992)
Bellare, M., Micali, S.: Non-interactive oblivious transfer and applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 547–557. Springer, Heidelberg (1990)
Bellare, M., Rompel, J.: Randomnessefficient oblivious sampling. In: 35th IEEE Symposium on Foundations of Computer Science, pp. 276–287 (1994)
Cachin, C., Crépeau, C., Marcil, J.: Oblivious transfer with a memorybound receiver. In: 39th IEEE Symposium on Foundations of Computer Science, pp. 493–502 (1998)
Crépeau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions. In: 29th IEEE Symposium on Foundations of Computer Science, pp. 42–52 (1988)
Cachin, C., Maurer, U.M.: Unconditional security against memory-bounded adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 292–306. Springer, Heidelberg (1997)
Cover, T.M.: Enumerative source encoding. IEEE Transaction on Information Theory 19(1), 73–77 (1973)
Crépeau, C.: Equivalence between two flavours of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 350–354. Springer, Heidelberg (1988)
Damgård, I.B.: Interactive hashing can simplify zero-knowledge protocol design without computational assumptions. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 100–109. Springer, Heidelberg (1994)
Damgård, 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. 963, pp. 325–338. Springer, Heidelberg (1995)
Damgård, I., Goldreich, O., Wigderson, A.: Information theory versus complexity theory: Another test case (1995)
Ding, Y.Z.: Oblivious transfer in the bounded storage model. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 155–170. Springer, Heidelberg (2001)
Dziembowski, S., Maurer, U.: Tight security proofs for the boundedstorage model. In: 34th ACM Symposium on the Theory of Computing, pp. 341–350 (2002)
Damgård, 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. 773, pp. 250–265. Springer, Heidelberg (1994)
Ding, Y.Z., Rabin, M.O.: Hyper-encryption and everlasting security. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 1–26. Springer, Heidelberg (2002)
Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM 28(6), 637–647 (1985)
Goldreich, O., Kahan, A.: How to construct constant-round zeroknowledge proof systems for np. Journal of Cryptology 9(2), 167–189 (1996)
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–335 (2000)
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–229 (1987)
Goldreich, O.: A sample of samplers - a computational perspective on sampling (survey). In: Electronic Colloquium on Computational Complexity (ECCC) (20), vol. 4 (1997)
Goldreich, O.: Foundations of cryptography - volume 2. Working Draft (2003), available at: www.wisdom.weizmann.ac.il/oded/foc-vol2.html
Gowers, W.T.: An almost m-wise independent random permutation of the cube. Combinatorics, Probability and Computing 5, 119–130 (1996)
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–408 (1998)
Hong, D., Chang, K.-Y., Ryu, H.: Efficient oblivious transfer in the bounded-storage model. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 143–159. Springer, Heidelberg (2002)
Impagliazzo, R., Rudich, S.: Limits on the provable consequences of oneway permutations. In: 21st ACM Symposium on the Theory of Computing, pp. 44–61 (1989)
Kilian, J.: Founding cryptography on oblivious transfer. In: 20th ACM Symposium on the Theory of Computing, pp. 20–31 (1988)
Lu, C.: Hyper-encryption against space-bounded adversaries from on-line strong extractors. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 257–271. Springer, Heidelberg (2002)
Maurer, U.: Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology 5(1), 53–66 (1992)
Maurer, U.: Secret key agreement by public discussion. IEEE Transaction on Information Theory 39(3), 733–742 (1993)
Nisan, N.: Extracting randomness: How and why, a survey. In: IEEE Conference on Computational Complexity, pp. 44–58 (1996)
Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect zeroknowledge arguments for np using any one-way permutation. Journal of Cryptology 11(2), 87–108 (1998); preliminary version in CRYPTO 1992
Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 448–457 (2001)
Naor, M., Reingold, O.: On the construction of pseudorandom permutations: Luby-rackoff revisited. Journal of Cryptology 12(1), 29–66 (1999)
Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: 21st ACM Symposium on the Theory of Computing, pp. 33–43 (1989)
Nisan, N., Zuckerman, D.: Randomness is linear in space. JCSS 52(1), 43–52 (1996)
Rabin, M.O.: How to exchange secrets by oblivious transfer. TR-81, Harvard (1981)
Raz, R., Reingold, O., Vadhan, S.: Error reduction for extractor. In: 40th IEEE Symposium on Foundations of Computer Science, pp. 191–201 (1999)
Reingold, O., Shaltiel, R., Wigderson, A.: Extracting randomness via repeated condensing. In: 41st IEEE Symposium on Foundations of Computer Science, pp. 22–31 (2000)
Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the EATCS 77, 67–95 (2002)
Vadhan, S.P.: On constructing locally computable extractors and cryptosystems in the bounded storage model. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 61–77. Springer, Heidelberg (2003)
Yao, A.C.: How to generate and exchange secrets. In: 27th IEEE Symposium on Foundations of Computer Science, pp. 162–167 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ding, Y.Z., Harnik, D., Rosen, A., Shaltiel, R. (2004). Constant-Round Oblivious Transfer in the Bounded Storage Model. In: Naor, M. (eds) Theory of Cryptography. TCC 2004. Lecture Notes in Computer Science, vol 2951. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24638-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-24638-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21000-9
Online ISBN: 978-3-540-24638-1
eBook Packages: Springer Book Archive