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. © Springer-Verlag Berlin Heidelberg 2013.
CITATION STYLE
Ahlswede, R., & Csiszár, I. (2013). On oblivious transfer capacity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7777, pp. 145–166). Springer Verlag. https://doi.org/10.1007/978-3-642-36899-8_6
Mendeley helps you to discover research relevant for your work.