Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:1404.5701 (cs)
This paper has been withdrawn by Shahid Shah
[Submitted on 23 Apr 2014 (v1), last revised 5 Jul 2016 (this version, v3)]

Title:Achieving Shannon Capacity in a Wiretap Channel via Previous Messages

Authors:Shahid Mehraj Shah, Vinod Sharma
No PDF available, click to view other formats
Abstract:In this paper we consider a wiretap channel with a secret key buffer. We use the coding scheme of [1] to enhance the secrecy rate to the capacity of the main channel, while storing each securely transmitted message in the secret key buffer. We use the oldest secret bits from the buffer to be used as a secret key to transmit a message in a slot and then remove those bits. With this scheme we are able to prove stronger results than those in [1]. i.e., not only the message which is being transmitted currently, but all the messages transmitted in last $N_1$ slots are secure with respect to all the information that the eavesdropper possesses, where $N_1$ can be chosen arbitrarily large.
Comments: This paper has been withdrawn as we have extended this result to more general setup and submitted another paper, of which this is small part
Subjects: Information Theory (cs.IT); Cryptography and Security (cs.CR)
Cite as: arXiv:1404.5701 [cs.IT]
  (or arXiv:1404.5701v3 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1404.5701

Submission history

From: Shahid Shah [view email]
[v1] Wed, 23 Apr 2014 04:39:02 UTC (31 KB)
[v2] Fri, 8 May 2015 16:29:23 UTC (25 KB)
[v3] Tue, 5 Jul 2016 17:46:10 UTC (1 KB) (withdrawn)
Full-text links:

Access Paper:

  • Withdrawn
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2014-04
Change to browse by:
cs
cs.CR
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Shahid Mehraj Shah
Vinod Sharma
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)