On Oblivious Transfer Capacity

DOI10.1007/978-3-642-36899-8_6zbMath1334.94047OpenAlexW2176183625MaRDI QIDQ4915234

Imre Csiszár

Publication date: 9 April 2013

Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36899-8_6

zbMATH Keywords

secret keywiretap channelentropy difference boundgeneralized erasure channelhonest but curiousoblivios transferone of two strings

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Related Items (3)

Complete characterization of broadcast and pseudo-signatures from correlations ⋮ Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions ⋮ On Oblivious Transfer Capacity

Cites Work

• Assisted Common Information With an Application to Secure Two-Party Sampling
• Estimating Mutual Information Via Kolmogorov Distance
• Oblivious Transfer Is Symmetric
• On the Oblivious-Transfer Capacity of Noisy Resources
• The Wire-Tap Channel
• Broadcast channels with confidential messages
• Secret key agreement by public discussion from common information
• Common randomness in information theory and cryptography. I. Secret sharing
• Continuity of quantum conditional information
• On Oblivious Transfer Capacity
• Constant-Rate Oblivious Transfer from Noisy Channels
• Achieving Oblivious Transfer Capacity of Generalized Erasure Channels in the Malicious Model
• A sharp continuity estimate for the von Neumann entropy
• Cryptography and Coding
• Information Theory

This page was built for publication: On Oblivious Transfer Capacity