Results 141 to 150 of about 15,116 (186)
2017 IEEE Conference on Communications and Network Security (CNS), 2017 We investigate the possibility of covert and secret key generation over a discrete memoryless channel model with one way public discussion. Protocols are required to conceal not only the key but also whether a protocol is being implemented. For some models, we show that covert secret key generation is possible and characterize the covert secret key ...
Tahmasbi, Mehrdad, Bloch, Matthieu
openaire +2 more sources
Authentication based on secret-key generation
2012 IEEE International Symposium on Information Theory Proceedings, 2012 We present models for authentication in biometric settings. We could determine the trade-off between false-acceptance exponents and the so-called privacy-leakage rate. In this way we extend the Ahlswede-Csiszar secret-key generation result [1993] and more specifically the secret-key rate vs.
Willems, F.M.J., Ignatenko, T.
openaire +2 more sources
Fault-tolerant secret key generation
2012 IEEE International Symposium on Information Theory Proceedings, 2012 Mobile nodes observing correlated data communicate using an insecure bidirectional switch to generate a secret key, which must remain concealed from the switch. We are interested in fault-tolerant secret key rates, i.e., the rates of secret key generated even if a subset of nodes drop out before the completion of the communication protocol.
Himanshu Tyagi +3 more
openaire +2 more sources
Secret Key Generation for Correlated Gaussian Sources
IEEE Transactions on Information Theory, 2012 Secret key generation by multiple terminals is considered based on their observations of jointly distributed Gaussian signals, followed by public communication among themselves. Exploiting an inherent connection between secrecy generation and lossy data compression, two main contributions are made.
Sirin Nitinawarat, Prakash Narayan
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Common randomness and secret key generation with a helper
IEEE Transactions on Information Theory, 2000Summary: We consider the generation of common randomness (CR), secret or not secret, by two user terminals with aid from a ``helper'' terminal. Each terminal observes a different component of a discrete memoryless multiple source. The helper aids the users by transmitting information to them over a noiseless public channel subject to a rate constraint.
Imre Csiszár, Prakash Narayan
exaly +2 more sources