Yahya S. Khiabani

Learn More
This paper focuses on the problem of sharing secret keys using Automatic Repeat reQuest (ARQ) protocol. We consider cases where forward and feedback channels are erasure channels for a legitimate receiver (Bob) and an eavesdropper (Eve). In prior works, the wiretap channel is modeled as statistically independent packet erasure channels for Bob and Eve. In(More)
Acknowledgments First of all, I would like to sincerely thank Dr. Shuangqing Wei for his insightful guidance and seemingly unbounded enthusiasm throughout the course of my graduate studies. His desire for me to achieve my full potential and thoroughly clarify any misgivings about the most minor of details has allowed me to truly understand how meaningful(More)
This paper considers the problem of end-to-end security enhancement by resorting to deliberate noise injected in ciphertexts. The main goal is to generate a degraded wiretap channel in the application layer over which Wyner-type secrecy encoding is invoked to deliver additional secure information. More specifically, we study secrecy enhancement of the Data(More)
—The main idea in this work is to design and analyze a symmetric key generation algorithm whereby we can strengthen wireless network security. Our main goal is generating a sequence of highly secure secret keys based on an ARQ based transmission mechanism that relies on the statistical independence of channel errors between the attacker and legitimate(More)
In this paper we propose an encoding-encryption approach to take advantage of intentional noise introduced in ciphertexts for a block cipher working in CFB or CBC mode. First of all, we provide a rigorous analysis of the impacts of channel degradation on block ciphered systems. We show that the overall channel can be modeled as a Finite State Markov Chain(More)
In this paper without tailoring to any presumed condition on communication channel or any restriction on adversary's resources we design a secrecy scheme with information leakage that decays at an exponential rate. The only requirement for such an exponentially secure system is existence of a common key source between legitimate users that is partially(More)
In this paper without tailoring to any physical channel condition or any restriction on adversary's computational resources we design a secrecy scheme with information leakage that decays at an exponential rate. The only advantage for legitimate users over eavesdropper is existence of a key source that is partially known by Eve. A key extractor based on a(More)