Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

On ObliviousTransfer Capacity

Rudolf Ahlswede

Published Jan 1, 2007• 0 citations
OpenAlex

Abstract

Theconcept ofoblivious transfer capacity hasbeen recently introduced byNascimento andWinter. Wegive anupper boundtothis capacity, bothforsource andchannel models, and provethatitistight fora class ofchannels. Forothercases, lowerboundsareprovided. Thetools include knownresults on secrecy capacity ofsimple source andchannel models.

Related papers

On Oblivious Transfer Capacity

Rudolf Ahlswede, Imre Csiszár

The concept of oblivious transfer capacity has been recently introduced by Nascimento and Winter. We give an upper bound to this capacity, both for source and channel models, and prove that it is tight for a class of channels. For other cases, lower bounds are provided. The tools include known results on secrecy capacity of simple source and channel models.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•30 citations

On oblivious transfer capacity

Rudolf Ahlswede, Imre Csiszár

The concept of oblivious transfer capacity has been introduced by Nascimento and Winter, ISIT06. Its value has been determined for certain models, and bounds to it were given for other models, in the present authors' ISIT07 contribution. This talk is based on the latter work. The tools include known results on secrecy capacity of simple source and channel models.

IEEE Information Theory Workshop (ITW)•Jun 1, 2009•7 citations

Secrecy capacity of a class of orthogonal relay eavesdropper channels

Vaneet Aggarwal, Lalitha Sankar, A.R. Calderbank +1 more

The secrecy capacity is developed for a class of relay channels with orthogonal components and a passive eavesdropper node. The relay and destination receive signals from the source on two orthogonal channels such that the destination also receives transmissions from the relay on its channel. The eavesdropper can overhear either one or both of the orthogonal channels. Inner and outer bounds on the secrecy capacity are developed for both the discrete memoryless and the Gaussian channel models. For the discrete memoryless case, the secrecy capacity is shown to be achieved by a partial decode-and-forward (PDF) scheme when the eavesdropper can overhear only one of the two orthogonal channels. Two new outer bounds are presented for the Gaussian model using recent capacity results for a Gaussian multi-antenna channel with a multi-antenna eavesdropper. The outer bounds are shown to be tight for two sub-classes of channels. The first sub-class is one in which the source and relay are clustered and the eavesdropper overhears on only one of the two channels for which the PDF strategy is optimal. The second is a sub-class in which the source does not transmit to the relay for which a noise-forwarding strategy is optimal.

Information Theory and Applications Workshop (ITA)•Feb 1, 2009•45 citations

Lower Bounds for Oblivious Transfer Reductions

Yevgeniy Dodis, Silvio M. Micali

Lecture notes in computer science•Jan 1, 1999•46 citations

On Oblivious Transfer Capacity

Rudolf Ahlswede, Imre Csiszár

Lecture notes in computer science•Jan 1, 2013•35 citations

Secrecy Capacity of a Class of Orthogonal Relay Eavesdropper Channels

Vaneet Aggarwal, Lalitha Sankar, A.R. Calderbank +1 more

The secrecy capacity of relay channels with orthogonal components is studied in the presence of an additional passive eavesdropper node. The relay and destination receive signals from the source on two orthogonal channels such that the destination also receives transmissions from the relay on its channel. The eavesdropper can overhear either one or both of the orthogonal channels. Inner and outer bounds on the secrecy capacity are developed for both the discrete memoryless and the Gaussian channel models. For the discrete memoryless case, the secrecy capacity is shown to be achieved by a partial decode-and-forward (PDF) scheme when the eavesdropper can overhear only one of the two orthogonal channels. Two new outer bounds are presented for the Gaussian model using recent capacity results for a Gaussian multiantenna point-to-point channel with a multiantenna eavesdropper. The outer bounds are shown to be tight for two subclasses of channels. The first subclass is one in which the source and relay are clustered, and the eavesdropper receives signals only on the channel from the source and the relay to the destination, for which the PDF strategy is optimal. The second is a subclass in which the source does not transmit to the relay, for which a noise-forwarding strategy is optimal.

arXiv:0812.2275•EURASIP Journal on Wireless Communications and Networking•Jul 14, 2009•54 citations
The secrecy capacity is developed for a class of relay channels with orthogonal components and a passive eavesdropper node. The relay and destination receive signals from the source on two orthogonal channels such that the destination also receives transmissions from the relay on its channel. The eavesdropper can overhear either one or both of the orthogonal channels. Inner and outer bounds on the secrecy capacity are developed for both the discrete memoryless and the Gaussian channel models. For the discrete memoryless case, the secrecy capacity is shown to be achieved by a partial decode-and-forward (PDF) scheme when the eavesdropper can overhear only one of the two orthogonal channels. Two new outer bounds are presented for the Gaussian model using recent capacity results for a Gaussian multi-antenna channel with a multi-antenna eavesdropper. The outer bounds are shown to be tight for two sub-classes of channels. The first sub-class is one in which the source and relay are clustered and the eavesdropper overhears on only one of the two channels for which the PDF strategy is optimal. The second is a sub-class in which the source does not transmit to the relay for which a noise-forwarding strategy is optimal.
The secrecy capacity of relay channels with orthogonal components is studied in the presence of an additional passive eavesdropper node. The relay and destination receive signals from the source on two orthogonal channels such that the destination also receives transmissions from the relay on its channel. The eavesdropper can overhear either one or both of the orthogonal channels. Inner and outer bounds on the secrecy capacity are developed for both the discrete memoryless and the Gaussian channel models. For the discrete memoryless case, the secrecy capacity is shown to be achieved by a partial decode-and-forward (PDF) scheme when the eavesdropper can overhear only one of the two orthogonal channels. Two new outer bounds are presented for the Gaussian model using recent capacity results for a Gaussian multiantenna point-to-point channel with a multiantenna eavesdropper. The outer bounds are shown to be tight for two subclasses of channels. The first subclass is one in which the source and relay are clustered, and the eavesdropper receives signals only on the channel from the source and the relay to the destination, for which the PDF strategy is optimal. The second is a subclass in which the source does not transmit to the relay, for which a noise-forwarding strategy is optimal.