Title :
An end-to-end exponentially secure secrecy scheme against an unbounded adversary
Author :
Khiabani, Yahya S. ; Shuangqing Wei
Author_Institution :
Sch. of Electr. Eng. & Comput. Sci., Louisiana State Univ. (LSU), Baton Rouge, LA, USA
Abstract :
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 sampler and a Renyi extractor derives secret keys with the required entropy from this source. Encryption using this key with a general cipher maps Eve´s uncertainty about the key to uncertainty about the plaintext that can also be interpreted as degradation in her channel. Using privacy amplification on top of this cipher based on inverse universal2 hashing results in information leakage with decreasing exponent that can be optimized to guarantee a higher level of secrecy.
Keywords :
cryptography; Renyi extractor; adversary computational resources; eavesdropper; encryption; end-to-end exponentially secure secrecy scheme; exponential rate; general cipher maps Eve uncertainty; information leakage; inverse universal2 hashing; key extractor; legitimate users; physical channel condition; privacy amplification; unbounded adversary; Ciphers; Data mining; Encryption; Entropy; Privacy; Random variables; Uncertainty;
Conference_Titel :
Information Sciences and Systems (CISS), 2013 47th Annual Conference on
Conference_Location :
Baltimore, MD
Print_ISBN :
978-1-4673-5237-6
Electronic_ISBN :
978-1-4673-5238-3
DOI :
10.1109/CISS.2013.6552269