Abstract
Upper and lower bounds to the oblivious transfer (OT) capacity of discrete memoryless channels and multiple sources are obtained, for 1 of 2 strings OT with honest but curious participants. The upper bounds hold also for one-string OT. The results provide the exact value of OT capacity for a specified class of models, and the necessary and sufficient condition of its positivity, in general.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Ahlswede, R., Csiszár, I.: Common randomness in information theory and cryptography, part I. IEEE Trans. Inf. Theory 39, 1121–1132 (1993)
Ahlswede, R., Csiszár, I.: On oblivious transfer capacity. In: Proc. ISIT 2007, Nice, pp. 2061–2064 (2007)
Alicki, R., Fannes, M.: Continuity of quantum conditional information. J. Phys. A: Math. Gen. 37, L55–L57 (2004)
Audenaert, K.M.R.: A sharp Fannes-type inequality for the von Neumann entropy. J. Phys. A. 40, 8127–8136 (2007)
Csiszár, I., Körner, J.: Broadcast channels with confidential messages. IEEE Trans. Inf. Theory 24, 339–348 (1978)
Csiszár, I., Körner, J.: Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd edn. Cambridge University Press (2011)
Imai, H., Nascimento, A., Morozov, K.: On the oblivious transfer capacity of the erasure channel. In: Proc. ISIT 2006, Seattle, pp. 1428–1431 (2006)
Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A., Wullschleger, J.: Constant-Rate Oblivious Transfer from Noisy Channels. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 667–684. Springer, Heidelberg (2011)
Kilian, J.: Founding cryptography on oblivious transfer. In: Proc. STOC 1988, pp. 20–31 (1988)
Maurer, U.: Secret key agreement by public discussion. IEEE Trans. Inf. Theory 39, 733–742 (1993)
Nascimento, A., Winter, A.: On the oblivious transfer capacity of noisy correlations. In: Proc. ISIT 2006, Seattle, pp. 1871–1875 (2006)
Nascimento, A., Winter, A.: On the oblivious transfer capacity of noisy resources. IEEE Trans. Inf. Theory 54, 2572–2581 (2008)
Pinto, A., Dowsley, R., Morozov, K., Nascimento, A.: Achieving oblivious transfer apacity of generalized erasure channels in the malicious model. IEEE Trans. Inf. Theory 57, 5566–5571 (2011)
Prabhakaran, V., Prabhakaran, M.: Assisted common information with an application to secure two-party sampling. arXiv:1206.1282v1 [cs.IT] (2012)
Winter, A., Nascimento, A.C.A., Imai, H.: Commitment Capacity of Discrete Memoryless Channels. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol. 2898, pp. 35–51. Springer, Heidelberg (2003)
Wolf, S., Wullschleger, J.: Oblivious Transfer Is Symmetric. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 222–232. Springer, Heidelberg (2006)
Wyner, A.: The wiretap channel. Bell System Tech. J. 54, 1355–1387 (1975)
Zhang, Z.: Estimating mutual information via Kolmogorov distance. IEEE Trans. Inf. Theory 53, 3280–3283 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ahlswede, R., Csiszár, I. (2013). On Oblivious Transfer Capacity. In: Aydinian, H., Cicalese, F., Deppe, C. (eds) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science, vol 7777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36899-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-36899-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36898-1
Online ISBN: 978-3-642-36899-8
eBook Packages: Computer ScienceComputer Science (R0)