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

Problems of Information Transmission

Quantum privacy and quantum wiretap channels

Ning Cai, Andreas Winter, Raymond W. Yeung

Published Oct 1, 2004• 204 citations
Publisher
DOI
10.1007/s11122-005-0002-x

Related papers

Quantum Security and Privacy

Wiley eBooks•Nov 30, 2012•0 citations

Wiretap Channels: Nonasymptotic Fundamental Limits

Wei Qing Yang, Rafael F. Schaefer, H. Vincent Poor

This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than existing bounds, and lead to the tightest bounds on the second-order coding rate for discrete memoryless and Gaussian wiretap channels. The exact second-order coding rate is established for semi-deterministic wiretap channels, which characterizes the optimal tradeoff between reliability and secrecy in the finite-blocklength regime. Underlying our achievability bounds are two new privacy amplification results, which not only refine the classic privacy amplification results, but also achieve secrecy under the stronger semantic-security metric.

arXiv:1706.03866•IEEE Transactions on Information Theory•Mar 12, 2019•147 citations

Quantum privacy and Schur product channels

Jeremy Levick, David W. Kribs, Rajesh Pereira

arXiv:1709.01752•Reports on Mathematical Physics•Dec 1, 2017•15 citations

On the oblivious transfer capacity of the degraded wiretapped binary erasure channel

Manoj Mishra, Bikash Kumar Dey, Vinod M. Prabhakaran +1 more

We study oblivious transfer (OT) between Alice and Bob in the presence of an eavesdropper Eve over a degraded wiretapped binary erasure channel from Alice to Bob and Eve. In addition to the privacy goals of oblivious transfer between Alice and Bob, we require privacy of Alice and Bob's private data from Eve. In previous work we derived the OT capacity (in the honest-but-curious model) of the wiretapped binary independent erasure channel where the erasure processes of Bob and Eve are independent. Here we derive a lower bound on the OT capacity in the same secrecy model when the wiretapped binary erasure channel is degraded in favour of Bob.

arXiv:1504.04499•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2015•0 citations

Construction of wiretap codes from ordinary channel codes

Masahito Hayashi, Ryutaroh Matsumoto

From an arbitrary given channel code over a discrete or Gaussian memoryless channel, we construct a wiretap code with the strong security. Our construction can achieve the wiretap capacity under mild assumptions. The key tool is the new privacy amplification theorem bounding the eavesdropped information in terms of the Gallager function.

arXiv:1001.1197•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2010•41 citations

Quantum Direct Communication Wiretapping

Piotr Zawadzki

Communications in computer and information science•Jan 1, 2017•1 citation
This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than existing bounds, and lead to the tightest bounds on the second-order coding rate for discrete memoryless and Gaussian wiretap channels. The exact second-order coding rate is established for semi-deterministic wiretap channels, which characterizes the optimal tradeoff between reliability and secrecy in the finite-blocklength regime. Underlying our achievability bounds are two new privacy amplification results, which not only refine the classic privacy amplification results, but also achieve secrecy under the stronger semantic-security metric.
We study oblivious transfer (OT) between Alice and Bob in the presence of an eavesdropper Eve over a degraded wiretapped binary erasure channel from Alice to Bob and Eve. In addition to the privacy goals of oblivious transfer between Alice and Bob, we require privacy of Alice and Bob's private data from Eve. In previous work we derived the OT capacity (in the honest-but-curious model) of the wiretapped binary independent erasure channel where the erasure processes of Bob and Eve are independent. Here we derive a lower bound on the OT capacity in the same secrecy model when the wiretapped binary erasure channel is degraded in favour of Bob.